« January 2019 »
January
MoTuWeThFrSaSu
123456
78910111213
14151617181920
21222324252627
28293031
Uni-Logo
You are here: Home Teaching Student Projects and Thesis Topics Finished [B.Sc. Thesis] Trace Abstraction for Concurrent Programs via Petri Net Acceptors
Document Actions

Trace Abstraction for Concurrent Programs via Petri Net Acceptors

Course type Bachelor Thesis
Instructors Matthias Heizmann
Credits 15
Course Catalog
Extend the trace abstraction [1] approach to program verification to concurrent programs by using petri net acceptors instead of finite automata.

 

Literature

[1] Javier Esparza, Stefan Römer, Walter Vogler: An Improvement of McMillan's Unfolding Algorithm. TACAS 1996:87-106

[2] Matthias Heizmann, Jochen Hoenicke, Andreas Podelski: Refinement of Trace Abstraction. SAS 2009:69-85

Personal tools