On the consistency, expressiveness, and precision of partial modeling formalisms

DOI10.1016/j.ic.2010.08.001zbMath1214.68226OpenAlexW2005831808MaRDI QIDQ617712

Arie Gurfinkel, Marsha Chechik, Ou Wei

Publication date: 13 January 2011

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

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

zbMATH Keywords

model-checkingabstractionmodal transition systems3-valued analysispartial transition systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• CUDD
• YASM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• On Modal Refinement and Consistency
• LTL Generalized Model Checking Revisited
• Mixed Transition Systems Revisited
• A domain equation for refinement of partial systems
• EXPTIME-complete Decision Problems for Modal and Mixed Specifications
• Abstract Interpretation Frameworks
• Tools and Algorithms for the Construction and Analysis of Systems
• Complexity of Decision Problems for Mixed and Modal Specifications
• Correct Hardware Design and Verification Methods
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: On the consistency, expressiveness, and precision of partial modeling formalisms