3-valued abstraction: More precision at less cost

DOI10.1016/j.ic.2008.07.004zbMath1169.68028OpenAlexW2169614829MaRDI QIDQ958307

Orna Grumberg, Sharon Shoham

Publication date: 3 December 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.07.004

Mathematics Subject Classification ID

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

Related Items (6)

Abstraction in Fixpoint Logic ⋮ Abstraction and Abstraction Refinement ⋮ Inverse-limit and topological aspects of abstract interpretation ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Refinement Sensitive Formal Semantics of State Machines With Persistent Choice ⋮ Compositional Abstraction for Stochastic Systems

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• A lattice-theoretical fixpoint theorem and its applications
• Abstract Interpretation Frameworks
• Tools and Algorithms for the Construction and Analysis of Systems
• Programming Languages and Systems
• Making abstract interpretations complete
• Comparing Completeness Properties of Static Analyses and Their Logics
• Static Analysis
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Computer Aided Verification
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 3-valued abstraction: More precision at less cost