18. CSL 2004: Karpacz, Poland

Jerzy Marcinkowski, Andrzej Tarlecki (Eds.): Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings. Lecture Notes in Computer Science 3210 Springer 2004, ISBN 3-540-23024-6 BibTeX

Invited Lectures

Albert Atserias:
Notions of Average-Case Complexity for Random 3-SAT. 1-5
Electronic Edition (link) BibTeX
Martin Hyland:
Abstract Interpretation of Proofs: Classical Propositional Calculus. 6-21
Electronic Edition (link) BibTeX
Kenneth L. McMillan:
Applications of Craig Interpolation to Model Checking. 22-23
Electronic Edition (link) BibTeX
Dale Miller:
Bindings, Mobility of Bindings, and the "generic judgments"-Quantifier: An Abstract. 24
Electronic Edition (link) BibTeX
Pawel Urzyczyn:
My (Un)Favourite Things. 25
Electronic Edition (link) BibTeX

Regular Papers

Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski:
On Nash Equilibria in Stochastic Games. 26-40
Electronic Edition (link) BibTeX
Mikolaj Bojanczyk:
A Bounding Quantifier. 41-55
Electronic Edition (link) BibTeX
Hugo Gimbert:
Parity and Exploration Games on Infinite Graphs. 56-70
Electronic Edition (link) BibTeX
Harald Ganzinger, Konstantin Korovin:
Integrating Equational Reasoning into Instantiation-Based Theorem Proving. 71-84
Electronic Edition (link) BibTeX
George Metcalfe, Nicola Olivetti, Dov M. Gabbay:
Goal-Directed Methods for Lukasiewicz Logic. 85-99
Electronic Edition (link) BibTeX
Jeremy E. Dawson, Rajeev Goré:
A General Theorem on Termination of Rewriting. 100-114
Electronic Edition (link) BibTeX
Pierre Hyvernat:
Predicate Transformers and Linear Logic: Yet Another Denotational Model. 115-129
Electronic Edition (link) BibTeX
Pietro Di Gianantonio:
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity. 130-144
Electronic Edition (link) BibTeX
Lutz Straßburger, François Lamarche:
On Proof Nets for Multiplicative Linear Logic with Units. 145-159
Electronic Edition (link) BibTeX
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. 160-174
Electronic Edition (link) BibTeX
Marcelo Arenas, Pablo Barceló, Leonid Libkin:
Game-Based Notions of Locality Over Finite Models. 175-189
Electronic Edition (link) BibTeX
Andreas Abel, Ralph Matthes:
Fixed Points of Type Constructors and Primitive Recursion. 190-204
Electronic Edition (link) BibTeX
Aleksy Schubert:
On the Building of Affine Retractions. 205-219
Electronic Edition (link) BibTeX
Philippe de Groote, Sylvain Salvati:
Higher-Order Matching in the Linear lambda-calculus with Pairing. 220-234
Electronic Edition (link) BibTeX
Ulrich Schöpp, Ian Stark:
A Dependent Type Theory with Names and Binding. 235-249
Electronic Edition (link) BibTeX
Tjark Weber:
Towards Mechanized Program Verification with Separation Logic. 250-264
Electronic Edition (link) BibTeX
Roberto M. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio, Line Jakubiec:
A Functional Scenario for Bytecode Verification of Resource Bounds. 265-279
Electronic Edition (link) BibTeX
Roberto Giacobazzi, Isabella Mastroeni:
Proving Abstract Non-interference. 280-294
Electronic Edition (link) BibTeX
Patrick Maier:
Intuitionistic LTL and a New Characterization of Safety and Liveness. 295-309
Electronic Edition (link) BibTeX
Philipp Rohde:
Moving in a Crumbling Network: The Balanced Case. 310-324
Electronic Edition (link) BibTeX
E. Allen Emerson, Vineet Kahlon:
Parameterized Model Checking of Ring-Based Message Passing Systems. 325-339
Electronic Edition (link) BibTeX
Alan Skelley:
A Third-Order Bounded Arithmetic Theory for PSPACE. 340-354
Electronic Edition (link) BibTeX
Andrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín:
Provably Total Primitive Recursive Functions: Theories with Induction. 355-369
Electronic Edition (link) BibTeX
David Richerby:
Logical Characterizations of PSPACE. 370-384
Electronic Edition (link) BibTeX
Lutz Schröder:
The Logic of the Partial lambda-Calculus with Equality. 385-399
Electronic Edition (link) BibTeX
Jean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang:
Complete Lax Logical Relations for Cryptographic Lambda-Calculi. 400-414
Electronic Edition (link) BibTeX
Jerome Vouillon:
Subtyping Union Types. 415-429
Electronic Edition (link) BibTeX
Margarita V. Korovina, Nicolai Vorobjov:
Pfaffian Hybrid Systems. 430-441
Electronic Edition (link) BibTeX
Yukiyoshi Kameyama:
Axioms for Delimited Continuations in the CPS Hierarchy. 442-457
Electronic Edition (link) BibTeX
Pawel Rychlikowski, Tomasz Truderung:
Set Constraints on Regular Terms. 458-472
Electronic Edition (link) BibTeX
Christopher Lynch:
Unsound Theorem Proving. 473-487
Electronic Edition (link) BibTeX
Alessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato:
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation. 488-502
Electronic Edition (link) BibTeX
Agata Ciabattoni:
Automated Generation of Analytic Calculi for Logics with Linearity. 503-517
Electronic Edition (link) BibTeX