Verification, Model Checking, and Abstract Interpretation

DOI10.1007/b105073zbMath1111.68396OpenAlexW2611288859MaRDI QIDQ5711489

Ittai Balaban, Lenore D. Zuck, Amir Pnueli

Publication date: 6 December 2005

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

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

A logic of reachable patterns in linked data-structures ⋮ Inference of Field-Sensitive Reachability and Cyclicity ⋮ Verifying Heap-Manipulating Programs in an SMT Framework ⋮ Verification of multi-linked heaps ⋮ Abstracting Complex Data Structures by Hyperedge Replacement ⋮ Programs with lists are counter automata ⋮ An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures ⋮ Algorithmic Analysis of Array-Accessing Programs

This page was built for publication: Verification, Model Checking, and Abstract Interpretation