CSL B

39 papers

YearTitle / Authors
2004A Bounding Quantifier.
Mikolaj Bojanczyk
2004A Dependent Type Theory with Names and Binding.
Ulrich Schöpp, Ian Stark
2004A Functional Scenario for Bytecode Verification of Resource Bounds.
Roberto M. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio, Line Jakubiec
2004A General Theorem on Termination of Rewriting.
Jeremy E. Dawson, Rajeev Goré
2004A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation.
Alessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato
2004A Third-Order Bounded Arithmetic Theory for PSPACE.
Alan Skelley
2004Abstract Interpretation of Proofs: Classical Propositional Calculus.
Martin Hyland
2004Applications of Craig Interpolation to Model Checking.
Kenneth L. McMillan
2004Automated Generation of Analytic Calculi for Logics with Linearity.
Agata Ciabattoni
2004Axioms for Delimited Continuations in the CPS Hierarchy.
Yukiyoshi Kameyama
2004Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract.
Dale Miller
2004Complete Lax Logical Relations for Cryptographic Lambda-Calculi.
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang
2004Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings
Jerzy Marcinkowski, Andrzej Tarlecki
2004Fixed Points of Type Constructors and Primitive Recursion.
Andreas Abel, Ralph Matthes
2004Game-Based Notions of Locality Over Finite Models.
Marcelo Arenas, Pablo Barceló, Leonid Libkin
2004Goal-Directed Methods for Lukasiewicz Logic.
George Metcalfe, Nicola Olivetti, Dov M. Gabbay
2004Higher-Order Matching in the Linear lambda-calculus with Pairing.
Philippe de Groote, Sylvain Salvati
2004Integrating Equational Reasoning into Instantiation-Based Theorem Proving.
Harald Ganzinger, Konstantin Korovin
2004Intuitionistic LTL and a New Characterization of Safety and Liveness.
Patrick Maier
2004Logical Characterizations of PSPACE.
David Richerby
2004Moving in a Crumbling Network: The Balanced Case.
Philipp Rohde
2004My (Un)Favourite Things.
Pawel Urzyczyn
2004Notions of Average-Case Complexity for Random 3-SAT.
Albert Atserias
2004On Nash Equilibria in Stochastic Games.
Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski
2004On Proof Nets for Multiplicative Linear Logic with Units.
Lutz Straßburger, François Lamarche
2004On the Building of Affine Retractions.
Aleksy Schubert
2004Parameterized Model Checking of Ring-Based Message Passing Systems.
E. Allen Emerson, Vineet Kahlon
2004Parity and Exploration Games on Infinite Graphs.
Hugo Gimbert
2004Pfaffian Hybrid Systems.
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2004Predicate Transformers and Linear Logic: Yet Another Denotational Model.
Pierre Hyvernat
2004Provably Total Primitive Recursive Functions: Theories with Induction.
Andrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín
2004Proving Abstract Non-interference.
Roberto Giacobazzi, Isabella Mastroeni
2004Set Constraints on Regular Terms.
Pawel Rychlikowski, Tomasz Truderung
2004Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity.
Pietro Di Gianantonio
2004Subtyping Union Types.
Jerome Vouillon
2004The Boundary Between Decidability and Undecidability for Transitive-Closure Logics.
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
2004The Logic of the Partial lambda-Calculus with Equality.
Lutz Schröder
2004Towards Mechanized Program Verification with Separation Logic.
Tjark Weber
2004Unsound Theorem Proving.
Christopher Lynch