Abstract: This paper proposes an approach for the specification of the behavior of software components that implement data abstractions. By generalizing the ap-proach of behavior models using graph transformation, we provide a concise spec-ification for data abstractions that describes the relationship between the internal state, represented in a canonical form, and the observers of the component. Graph transformation also supports the generation of behavior models that are amenable to verification. To this end, we provide a translation approach into an LTL model on which we can express useful properties that can be model-checked with a SAT solver
Many important systems such as concurrent heap-manipulating programs, communication networks, or dis...
Many important systems like concurrent heap-manipulating programs, communication networks, or distri...
In model-based software development, a complete design and analysis process involves designing the s...
This paper proposes an approach for the specification of the behavior of software components that im...
This paper proposes an approach for the specification of the behavior of software components that im...
This paper describes an approach (SPY) to recovering the specification of a software component from ...
This paper describes an approach (SPY) to recovering the specification of a software component from ...
Graphs may be used as representations of system states in operational semantics and model checking; ...
AbstractGraphs may be used as representations of system states in operational semantics and model ch...
Graphs may be used as representations of system states in operational semantics and model checking; ...
In this abstract we present an overview of our intended approach for the verification of software wr...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
Graph transformation with its formal foundations and its broad range of theoretical results, on the ...
Model checking is increasingly popular for hardware and, more recently, software verification. In th...
In this paper we present the philosophy behind the GROOVE project, in which graph transformation is ...
Many important systems such as concurrent heap-manipulating programs, communication networks, or dis...
Many important systems like concurrent heap-manipulating programs, communication networks, or distri...
In model-based software development, a complete design and analysis process involves designing the s...
This paper proposes an approach for the specification of the behavior of software components that im...
This paper proposes an approach for the specification of the behavior of software components that im...
This paper describes an approach (SPY) to recovering the specification of a software component from ...
This paper describes an approach (SPY) to recovering the specification of a software component from ...
Graphs may be used as representations of system states in operational semantics and model checking; ...
AbstractGraphs may be used as representations of system states in operational semantics and model ch...
Graphs may be used as representations of system states in operational semantics and model checking; ...
In this abstract we present an overview of our intended approach for the verification of software wr...
The verification of systems with respect to a desired set of behavioural properties is a crucial ste...
Graph transformation with its formal foundations and its broad range of theoretical results, on the ...
Model checking is increasingly popular for hardware and, more recently, software verification. In th...
In this paper we present the philosophy behind the GROOVE project, in which graph transformation is ...
Many important systems such as concurrent heap-manipulating programs, communication networks, or dis...
Many important systems like concurrent heap-manipulating programs, communication networks, or distri...
In model-based software development, a complete design and analysis process involves designing the s...