Computer Science Logic

DOI10.1007/b100120zbMath1095.03008OpenAlexW2481899496MaRDI 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

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

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

This page was built for publication: Computer Science Logic