Improving reachability analysis of infinite state systems by specialization

DOI10.1007/978-3-642-24288-5_15MaRDI QIDQ5895015zbMATH OpenOpenAlexFDO

Authors Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni

Publication date 7 October 2011

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

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.590.712

Mathematics Subject Classification ID

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

Recommendations

• Improving reachability analysis of infinite state systems by specialization
• Controlling polyvariance for specialization-based verification
• Program specialization for verifying infinite state systems: an experimental evaluation
• Generalization strategies for the verification of infinite state systems
• Computer Science Logic

Cited in

(4)

• Controlling polyvariance for specialization-based verification
• Program specialization for verifying infinite state systems: an experimental evaluation
• Constraint-based reachability
• Improving reachability analysis of infinite state systems by specialization

This page was built for publication: Improving reachability analysis of infinite state systems by specialization

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