University of Twente Student Theses


Static Analysis of Symbolic Transition Systems with Goose

Fleur, S. la (2018) Static Analysis of Symbolic Transition Systems with Goose.

[img] PDF
Abstract:Verification of software is becoming a more prevelant topic in Computer Science. Formalisms such as Symbolic Transition Systems (STS) are used to formalize requirements or system behavior and these specifications are used as the target of verification. Properties such as safety and liveness properties are then proven for the specifications. This work focuses on what verification properties may be defined for STS specifications. A STS is a type of transition system where constraints are included on the transition guarding if the transition may be taken and showing which state to which state is related. This work also proposes a new approach to (dis)prove the verification properties we have defined for STS specifications and evaluates the new approach with existing approaches.
Item Type:Essay (Master)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science MSc (60300)
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page