Computer Science Logic

DOI10.1007/b100120zbMath1095.03008MaRDI QIDQ5311254

Mooly Sagiv, Alex Rabinovich, Greta Yorsh, Tom Reps, Neil Immerman

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100120

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

03B25: Decidability of theories and sets of sentences

03D15: Complexity of computation (including implicit computational complexity)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Interactive and automated proofs for graph transformations, Separation logics and modalities: a survey, Local Reasoning for Global Graph Properties, An Efficient Decision Procedure for Imperative Tree Data Structures, Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction, An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures, Verification of multi-linked heaps, Complexity of hybrid logics over transitive frames, Doomed program points, Decidable fragments of many-sorted logic, Program verification with interacting analysis plugins, A logic of reachable patterns in linked data-structures, Bounded Quantifier Instantiation for Checking Inductive Invariants, Verifying Heap-Manipulating Programs in an SMT Framework