Result Details
Generalised Multi-Pattern-Based Verification of Programs with Linear Linked Structures
Češka Milan, prof. RNDr., CSc., DITS (FIT)
Vojnar Tomáš, prof. Ing., Ph.D., DITS (FIT)
The paper deals with the problem of automatic verification of programsworking with extended linear linked dynamic data structures, inparticular, pattern-based verification is considered. In this approach,one can abstract memory configurations by abstracting away the exactnumber of adjacent occurrences of certain memory patterns. With respectto the previous work on the subject the method presented in the paperhas been extended to be able to handle multiple patterns, which allowsfor verification of programs working with more types of structuresand/or with structures with irregular shapes. The experimental resultsobtained from a prototype implementation of the method show that themethod is very competitive and offers a big potential for futureextensions.
formal verification, program analysis, shape analysis, dynamic linked data structures
@article{BUT45155,
author="Pavel {Erlebach} and Milan {Češka} and Tomáš {Vojnar}",
title="Generalised Multi-Pattern-Based Verification of Programs with Linear Linked Structures",
journal="FORMAL ASPECTS OF COMPUTING",
year="2007",
volume="19",
number="3",
pages="363--374",
issn="0934-5043",
url="http://www.springerlink.com/content/47472236k6213t7l/"
}
Advanced Methods of Automatic Verification of Parametric and Infinite-State Systems, GACR, Postdoktorandské granty, GP102/03/D211, start: 2003-09-01, end: 2006-09-01, completed
Integrated approach to education of PhD students in the area of parallel and distributed systems, GACR, Doktorské granty, GD102/05/H050, start: 2005-01-01, end: 2008-12-31, completed
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