6 search results - page 1 / 2 » Verifying Finite-State Graph Grammars: An Unfolding-Based Ap... |
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
TSE
2010
13 years 3 months ago
2010
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
TSE
2008
13 years 4 months ago
2008
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
APLAS
2003
ACM
13 years 8 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...