Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Diploma thesis SAT-based Verification
 

Summary: Diploma thesis
SAT-based Verification
for Abstraction Refinement
Stephanie Kemper
January 4th, 2006
Responsible Supervisor: Prof. Dr. Ernst-R¨udiger Olderog
Second Supervisor: Prof. Dr. Martin Fr¨anzle
Advisor: Dipl.-Inform. Andr´e Platzer
Abstract
The aim of this diploma thesis is to verify reachability properties of timed au-
tomata using SAT-based verification methods, while mainly eliminating the state
explosion problem using abstraction refinement techniques. Especially for complex
and safety critical systems, reachability analysis plays a major role, thus, verification
shall be restricted to the system parts essential to the property.
This thesis will present an iterative approach to automatic verification of reach-
ability properties. While the essential, non-abstractable system parts have to be
"guessed" during the first cycle, from begin of the second it is possible to acces
former results and identify wrongly omitted system parts to include them again.
The timed automaton and the property are firstly translated into formulae, such
that abstraction reduces to modification of formulae and these may be verified us-

  

Source: Appelrath, Hans-Jürgen - Department für Informatik, Carl von Ossietzky Universität Oldenburg

 

Collections: Computer Technologies and Information Sciences