MODULAR RANKING ABSTRACTION

DOI10.1142/S0129054107004553MaRDI QIDQ3426785zbMATH OpenFDO

Authors Ittai Balaban, Amir Pnueli, Lenore D. Zuck

Publication date 13 March 2007

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054107004553

zbMATH Keywords

deductive verificationmodel checkingpredicate abstractionranking abstraction

Mathematics Subject Classification ID

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

Recommendations

• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Automated Technology for Verification and Analysis
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Inference of ranking functions for proving temporal properties by abstract interpretation

Cites work

• A compositional approach to CTL^* verification
• Completing the temporal picture
• From complementation to certification
• Verification by augmented abstraction: The automata-theoretic view
• Verification by augmented finitary abstraction

Cited in

(10)

• Verification by augmented finitary abstraction
• Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
• Verification of multi-linked heaps
• Automatic verification of counter systems with ranking function
• Proving the refuted: symbolic model checkers as proof generators
• Tools and Algorithms for the Construction and Analysis of Systems
• Ranking Abstractions
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Automated Technology for Verification and Analysis
• Computing and proving well-founded orderings through finite abstractions

This page was built for publication: MODULAR RANKING ABSTRACTION

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