Improved symbolic verification using partitioning techniques

DOI10.1007/B93958zbMATH Open1179.68087OpenAlexW219731125MaRDI QIDQ5897082FDOQ5897082

Authors: Subramanian Iyer, Debashis Sahoo, Christian Stangier, Amit Narayan, Jawahar Jain 

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93958

Recommendations

• Formal Methods in Computer-Aided Design
• Partial-order reduction in symbolic state-space exploration
• FM 2005: Formal Methods
• Counterexample-guided abstraction refinement for symbolic model checking
• Symbolic model checking of software

Mathematics Subject Classification ID

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

Cited In (6)

• Exploiting partial knowledge for efficient model analysis
• Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
• Improving BDD based symbolic model checking with isomorphism exploiting transition relations
• Formal Methods in Computer-Aided Design
• GSTE is partitioned model checking
• Efficient hybrid reachability analysis for asynchronous concurrent systems

This page was built for publication: Improved symbolic verification using partitioning techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897082)