113 search results - page 1 / 23 » A framework for the verification of infinite-state graph tra... |
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
IANDC
2008
13 years 7 months ago
2008
EUROMICRO
1996
IEEE
13 years 11 months ago
1996
IEEE
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
GG
2010
Springer
13 years 7 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...