The GROOVE simulator: A tool for state space generation
A Rensink - Applications of Graph Transformations with Industrial …, 2004 - Springer
The tool described here is the first part of a tool set called GROOVE (GRaph-based Object-
Oriented VErification) for software model checking of object-oriented systems. The special …
Oriented VErification) for software model checking of object-oriented systems. The special …
A model-driven framework for guided design space exploration
Abstract Design space exploration (DSE) aims at searching through various models
representing different design candidates to support activities like configuration design of …
representing different design candidates to support activities like configuration design of …
Symbolic invariant verification for systems with dynamic structural adaptation
The next generation of networked mechatronic systems will be characterized by complex
coordination and structural adaptation at run-time. Crucial safety properties have to be …
coordination and structural adaptation at run-time. Crucial safety properties have to be …
Model checking graph transformations: A comparison of two approaches
Abstract Model checking is increasingly popular for hardware and, more recently, software
verification. In this paper we describe two different approaches to extend the benefits of …
verification. In this paper we describe two different approaches to extend the benefits of …
Automated formal verification of visual modeling languages by model checking
D Varró - Software & Systems Modeling, 2004 - Springer
Graph transformation has recently become more and more popular as a general, rule-based
visual specification paradigm to formally capture (a) requirements or behavior of user …
visual specification paradigm to formally capture (a) requirements or behavior of user …
A framework for the verification of infinite-state graph transformation systems
We propose a technique for the analysis of infinite-state graph transformation systems,
based on the construction of finite structures approximating their behaviour. Following a …
based on the construction of finite structures approximating their behaviour. Following a …
Weakest preconditions for high-level programs
A Habel, KH Pennemann, A Rensink - … , ICGT 2006 Natal, Rio Grande do …, 2006 - Springer
In proof theory, a standard method for showing the correctness of a program wrt given pre-
and postconditions is to construct a weakest precondition and to show that the precondition …
and postconditions is to construct a weakest precondition and to show that the precondition …
Towards a generalised semistructured data model and query language
G Bergami, W Zegadło - ACM SIGWEB Newsletter, 2023 - dl.acm.org
Although current efforts are all aimed at re-defining new ways to harness old data
representations, possibly with new schema features, the challenges still open provide …
representations, possibly with new schema features, the challenges still open provide …
Verifying finite-state graph grammars: an unfolding-based approach
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 …
graph transformation systems can be expressed and verified. The technique is based on the …
Quantitative μ-calculus and CTL defined over constraint semirings
A Lluch-Lafuente, U Montanari - Theoretical Computer Science, 2005 - Elsevier
Model checking and temporal logics are boolean. The answer to the model checking
question does a system satisfy a property? is either true or false, and properties expressed …
question does a system satisfy a property? is either true or false, and properties expressed …