Smaller Abstractions for ∀CTL* without Next

DOI10.1007/978-3-642-11512-7_16zbMath1274.68184OpenAlexW44343237MaRDI QIDQ5187833

Ralf Huuck, Kai Engelhardt

Publication date: 9 March 2010

Published in: Concurrency, Compositionality, and Correctness (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11512-7_16

Mathematics Subject Classification ID

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

Uses Software

• SPIN
• HyTech
• Uppaal
• CESAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing finite Kripke structures in propositional temporal logic
• Property preserving abstractions for the verification of concurrent systems
• Computer aided verification. 14th international conference, CAV 2002, Copenhagen, Denmark, July 27--31, 2002. Proceedings
• Verification by augmented finitary abstraction
• HyTech: A model checker for hybrid systems
• Generalized Strong Preservation by Abstract Interpretation
• Three logics for branching bisimulation
• Leaping Loops in the Presence of Abstraction

This page was built for publication: Smaller Abstractions for ∀CTL* without Next