Computer Science Logic - neues Buch

EAN (ISBN-13): 9783540301240
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-05-10T03:43:37+02:00 (Zurich)
Detailseite zuletzt geändert am 2021-11-15T06:22:49+01:00 (Zurich)
ISBN/EAN: 9783540301240

ISBN - alternative Schreibweisen:
978-3-540-30124-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: logic computer science

---

Daten vom Verlag:

Autor/in: Jerzy Marcinkowski
Titel: Lecture Notes in Computer Science; Computer Science Logic - 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings
Verlag: Springer; Springer Berlin
522 Seiten
Erscheinungsjahr: 2004-09-09
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 522 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; 3-SAT; AI logics; Erfüllbarkeitsproblem der Aussagenlogik; calculus; classical logic; complexity; computer science logic; linear logic; logic; mathematical logic; model checking; proving; term rewriting; theorem proving; verification; C; Compilers and Interpreters; Formal Languages and Automata Theory; Artificial Intelligence; Computer Science Logic and Foundations of Programming; Computer Science; Theoretische Informatik; Künstliche Intelligenz; BC

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.