Improving saturation-based bounded model checking

DOI10.14232/ACTACYB.22.3.2016.2MaRDI QIDQ2820781zbMATH OpenOpenAlexFDO

Authors Dániel Darvasy, András Vörösy, Tamás Bartha

Publication date 9 September 2016

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.22.3.2016.2

zbMATH Keywords

asynchronous systemsbounded model checkingcompacting saturationCTLmodel checkingsaturationsymbolic model checking

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Models of Computation
• Formal Methods in Computer-Aided Design
• scientific article; zbMATH DE number 1670796
• Bounded model checking using satisfiability solving
• Efficient SAT-based bounded model checking for software verification
• Model Checking Software
• An incremental algorithm to check satisfiability for bounded model checking

Cited in

(7)

• Incremental bounded model checking for embedded software
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• scientific article; zbMATH DE number 2086516 (Why is no real title available?)
• Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse
• Theory and Applications of Models of Computation
• Partially Bounded Context-Aware Verification

This page was built for publication: Improving saturation-based bounded model checking

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