 |
This page is no longer being maintained. The maintainers of the
Augur tool have moved to the University of Duisburg-Essen and the
new tool page can be found here.
Overview
Augur is a tool for the verification of systems described by graph
transformations using approximated unfoldings. The obtained
over-approximation consists of an underlying hypergraph and a Petri
net. Properties of graph transformation systems can be verified by
analyzing the approximation, using regular expressions and
coverability checking for Petri nets. The development of this tool is
part of the SANDS
project.
The current version of the tool is a prototype with some
limitations. More details are contained in the documentation and in
the publications listed below.
Downloads
Examples
Publications
Contact
Augur is currently maintained by
Vitali Kozioura and
Barbara König. Please contact
us if you should have any problems.
Changes
- 16.12.2004: Version 1.0, initial release of the tool
- 20.05.2005: Abstraction Refinement module is added
- 11.11.2005: Version 1.1 with some bug-fixing is on the web. Also
example scripts and augur-convert script have been added.
Links
- Project SANDS (Static Analysis of Dynamically Evolving Systems)
|
|
) |
© University of Stuttgart |
legal notice