Better Under-Approximation of Programs by Hiding Variables

DOI10.1007/978-3-540-69738-1_23MaRDI QIDQ5452617zbMATH OpenOpenAlexFDO

Authors Thomas Ball, Orna Kupferman

Publication date 4 April 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69738-1_23

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• Predicate Abstraction with Under-approximation Refinement
• Underapproximating Predicate Transformers
• Leaping Loops in the Presence of Abstraction
• More Precise Partition Abstractions
• Frameworks for abstract interpretation

Cites work

• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 1759610 (Why is no real title available?)
• scientific article; zbMATH DE number 1903350 (Why is no real title available?)
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
• Computer Aided Verification
• Formal Methods for Components and Objects
• On the Construction of Fine Automata for Safety Properties
• Reasoning about infinite computations
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(1)

• Approximating event system abstractions by covering their states and transitions

This page was built for publication: Better Under-Approximation of Programs by Hiding Variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452617)