On model checking multiple hybrid views
From MaRDI portal
Publication:947781
DOI10.1016/j.tcs.2008.03.010zbMath1151.68030OpenAlexW2029263782MaRDI QIDQ947781
Publication date: 7 October 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.010
Related Items (7)
Inherent Vacuity in Lattice Automata ⋮ Model checking computation tree logic over finite lattices ⋮ Learning and characterizing fully-ordered lattice automata ⋮ On model checking multiple hybrid views ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications ⋮ Lattice Automata ⋮ Minimizing Deterministic Lattice Automata
Uses Software
Cites Work
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- On model checking multiple hybrid views
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Reasoning and revision in hybrid representation systems
- Combinations of abstract domains for logic programming: Open product and generic pattern construction
- Model checking hybrid logics (with an application to semistructured data)
- Model checking, testing and verification working together
- Refinement is complete for implementations
- Institutions: abstract model theory for specification and programming
- A domain equation for refinement of partial systems
- Temporal abstract interpretation
- Lazy abstraction
- Labelled transition systems as a Stone space
- Verification, Model Checking, and Abstract Interpretation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On model checking multiple hybrid views
