Result Details
Automated formal analysis and verification: an overview
This paper provides an overview of various existing approaches to automated formal analysis and verification. The most space is devoted to the approach of model checking, including its basic principles as well as the different techniques that have been proposed for dealing with the state space explosion problem in model checking. This paper, however, includes a brief discussion of theorem proving and static analysis too. All of the discussed approaches are introduced mostly on an informal level, with an attempt to provide the reader with their basic ideas and references to works where more details can be found.
formal analysis and verification; model checking; state space explosion; theorem proving; static analysis
@article{BUT103472,
author="Tomáš {Vojnar} and Bohuslav {Křena}",
title="Automated formal analysis and verification: an overview",
journal="INTERNATIONAL JOURNAL OF GENERAL SYSTEMS",
year="2013",
volume="2013",
number="42",
pages="335--365",
doi="10.1080/03081079.2012.757437",
issn="0308-1079",
url="http://www.tandfonline.com/eprint/jVBdnCqNINZHmymMCrpj/full"
}
Dealing with Complex Data Structures and Concurrency within the Rich Model Toolkit, MŠMT, COST, OC10009, start: 2010-01-01, end: 2012-12-31, running
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Static and Dynamic Verification of Programs with Advanced Features of Concurrency and Unboundedness, GACR, Standardní projekty, GAP103/10/0306, start: 2010-01-01, end: 2013-12-31, running
Verifikace a optimalizace počítačových systémů, BUT, Vnitřní projekty VUT, FIT-S-12-1, start: 2012-01-01, end: 2014-12-31, completed