Willkommen, schön sind Sie da!
Logo Ex Libris

Computer Science Logic

  • E-Book (pdf)
  • 522 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
Inhalt Invited Lectures.- Notions of Average-Case Complexity for Random 3-SAT.- Abstract Interpretation of Proofs: Classical Propo... Weiterlesen
E-Books ganz einfach mit der kostenlosen Ex Libris-Reader-App lesen. Hiererhalten Sie Ihren Download-Link.
CHF 133.90
Download steht sofort bereit
Informationen zu E-Books
E-Books eignen sich auch für mobile Geräte (sehen Sie dazu die Anleitungen).
E-Books von Ex Libris sind mit Adobe DRM kopiergeschützt: Erfahren Sie mehr.
Weitere Informationen finden Sie hier.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

Inhalt

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.

Produktinformationen

Titel: Computer Science Logic
Untertitel: 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings
Editor:
EAN: 9783540301240
Format: E-Book (pdf)
Hersteller: Springer Berlin Heidelberg
Genre: Programmiersprachen
Veröffentlichung: 09.09.2004
Digitaler Kopierschutz: Wasserzeichen
Dateigrösse: 5.86 MB
Anzahl Seiten: 522

Weitere Bände aus der Buchreihe "Lecture Notes in Computer Science"