Bounded model checking of C programs using event automaton specifications

DOI10.13328/J.CNKI.JOS.004609MaRDI QIDQ5257124zbMATH OpenFDO

Authors Shuanglong Kan, Zhiqiu Huang, Zhe Chen, Bingfeng Xu

Publication date 29 June 2015

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.004609

zbMATH Keywords

automaton reachability treebounded model checkingevent automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formal verification for C program
• Integrated Formal Methods
• Efficient SAT-based bounded model checking for software verification
• Computer Aided Verification
• Bounded model checking of infinite state systems

This page was built for publication: Bounded model checking of C programs using event automaton specifications

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