Boosting Lazy Abstraction for SystemC with Partial Order Reduction
DOI10.1007/978-3-642-19835-9_31zbMATH Open1316.68072DBLPconf/tacas/CimattiNR11OpenAlexW1913652065WikidataQ62041214 ScholiaQ62041214MaRDI QIDQ3000665FDOQ3000665
Authors: Alessandro Cimatti, Iman Narasamdya, Marco Roveri 
Publication date: 19 May 2011
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19835-9_31
Recommendations
- Incremental computation of succinct abstractions for hybrid systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Abstraction refinement with Craig interpolation and symbolic pushdown systems
- scientific article; zbMATH DE number 1693041
- Partial order reduction for rewriting semantics of programming languages
- Automated compositional abstraction refinement for concurrent C programs: a two-level approach
Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to computer science (68-04)
Cites Work
- NuSMV: A new symbolic model checker
- Counterexample-guided abstraction refinement for symbolic model checking
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Combining partial-order reductions with on-the-fly model-checking.
- Peephole Partial Order Reduction
- Partial-order reduction in symbolic state-space exploration
- Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
Uses Software
This page was built for publication: Boosting Lazy Abstraction for SystemC with Partial Order Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000665)
