Computer science logic : 18th International Workshop, CSL 2004 : 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004 : proceedings
Spremljeno u:
| Autori kompanije: | , |
|---|---|
| Daljnji autori: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
3210 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computer science logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, proceedings, Jerzy Marcinkowski, Andrzej Tarlecki (eds.), 2004, Berlin, Springer, 1 vol. (XI-520 p.), Lecture notes in computer science, 3-540-23024-6 • Computer Science Logic, Texte imprimé, 9783662164976 |
Sadržaj:
- Invited Lectures
- Notions of Average-Case Complexity for Random 3-SAT
- Abstract Interpretation of Proofs: Classical Propositional Calculus
- Applications of Craig Interpolation to Model Checking
- Bindings, Mobility of Bindings, and the ?-Quantifier: An Abstract
- My (Un)Favourite Things
- Regular Papers
- On Nash Equilibria in Stochastic Games
- A Bounding Quantifier
- Parity and Exploration Games on Infinite Graphs
- Integrating Equational Reasoning into Instantiation-Based Theorem Proving
- Goal-Directed Methods for ?ukasiewicz Logic
- A General Theorem on Termination of Rewriting
- Predicate Transformers and Linear Logic: Yet Another Denotational Model
- Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
- On Proof Nets for Multiplicative Linear Logic with Units
- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
- Game-Based Notions of Locality Over Finite Models
- Fixed Points of Type Constructors and Primitive Recursion
- On the Building of Affine Retractions
- Higher-Order Matching in the Linear ?-calculus with Pairing
- A Dependent Type Theory with Names and Binding
- Towards Mechanized Program Verification with Separation Logic
- A Functional Scenario for Bytecode Verification of Resource Bounds
- Proving Abstract Non-interference
- Intuitionistic LTL and a New Characterization of Safety and Liveness
- Moving in a Crumbling Network: The Balanced Case
- Parameterized Model Checking of Ring-Based Message Passing Systems
- A Third-Order Bounded Arithmetic Theory for PSPACE
- Provably Total Primitive Recursive Functions: Theories with Induction
- Logical Characterizations of PSPACE
- The Logic of the Partial ?-Calculus with Equality
- Complete Lax Logical Relations for Cryptographic Lambda-Calculi.-Subtyping Union Types
- Pfaffian Hybrid Systems
- Axioms for Delimited Continuations in the CPS Hierarchy
- Set Constraints on Regular Terms
- Unsound Theorem Proving
- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation
- Automated Generation of Analytic Calculi for Logics with Linearity.