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

• Augur 1.1 (Source code)
• Documentation (Augur 1.1) ( ps , pdf )
• Abstraction Refinement Add-on module (Source code)
• Abstraction Refinement Documentation ( ps , pdf )
• Graphical User Interface (GUI) for Augur 1 (With Java source code)
• GUI Documentation ( ps , pdf )

Examples

• List of examples

Publications

• A list of publications describing the underlying verification techniques.

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.
• 17.01.2007: Graphical user interface has been added.

Links

• Project SANDS (Static Analysis of Dynamically Evolving Systems)