Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
ERLEBACH, P.; ČEŠKA, M.; VOJNAR, T.
Originální název
Generalised Multi-Pattern-Based Verification of Programs with Linear Linked Structures
Anglický název
Druh
Článek recenzovaný mimo WoS a Scopus
Originální abstrakt
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.
Anglický abstrakt
Klíčová slova
formal verification, program analysis, shape analysis, dynamic linked data structures
Klíčová slova v angličtině
Autoři
Vydáno
30.03.2007
ISSN
0934-5043
Periodikum
FORMAL ASPECTS OF COMPUTING
Svazek
19
Číslo
3
Stát
Spojené státy americké
Strany od
363
Strany do
374
Strany počet
12
URL
http://www.springerlink.com/content/47472236k6213t7l/
BibTex
@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/" }