Symgraph Prototype:

Graph-based Symbolic Reachability Analysis

 

The prototype is built in Sictus Prolog.

symgraph.pl: symb. back. reach. algorithm

fullmap.pl: The full-map consistency protocols specification

adr09.pdf: manuscript that describes the method

 

The bad states are defined by predicate "unsafe" (there are several examples of target "graph constraints)

that correspond to the properties discussed in the draft.

 

Usage (to run the fixpoint computation):

 

:-[symgraph].

 

:-[fullmap].

 

:- go.