de.rwth.i2.attestor.refinement

Interface StatelessHeapAutomaton

All Known Implementing Classes:

BalancednessAutomaton, LanguageInclusionAutomaton, ListLengthAutomaton, NeighbourhoodAutomaton, StatelessVisitedAutomaton, StatelessVisitedByAutomaton, VariableRelationsAutomaton

public interface StatelessHeapAutomaton

A very simplified heap automaton that has exactly one state. In particular this means that no grammar refinement is required.

Author:

Christoph

Method Summary

Modifier and Type	Method and Description
Set<String>	transition(HeapConfiguration heapConfiguration) Perform a transition on the given graph and compute the corresponding atomic propositions

Method Detail

transition

Set<String> transition(HeapConfiguration heapConfiguration)

Perform a transition on the given graph and compute the corresponding atomic propositions

Parameters:

heapConfiguration - The heap configuration to analyze.

Returns:

The corresponding set of atomic propositions.