Exploiting step semantics for efficient bounded model checking of asynchronous systems
From MaRDI portal
Publication:436411
DOI10.1016/j.scico.2011.07.005zbMath1243.68213OpenAlexW2004728613MaRDI QIDQ436411
Keijo Heljanko, Tommi Junttila, Jori Dubrovin
Publication date: 20 July 2012
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2011.07.005
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential and concurrent behaviour in Petri net theory
- Symbolic model checking: \(10^{20}\) states and beyond
- Unfoldings: A partial-order approach to model checking.
- Planning as satisfiability: parallel plans and algorithms for plan search
- Towards SMT Model Checking of Array-Based Systems
- SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
- Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing
- Bounded LTL model checking with stable models
- Linear Encodings of Bounded LTL Model Checking
- Automated Technology for Verification and Analysis
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Rewriting Systems with Data
- Peephole Partial Order Reduction
- Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking
- Computer Aided Verification
- Perspectives of System Informatics
- Symbolic model checking with rich assertional languages
This page was built for publication: Exploiting step semantics for efficient bounded model checking of asynchronous systems
