Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems

Stückrath, Jan

doi:10.1007/978-3-319-21145-9_17

Cited by 4 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…UNCOVER [30,40] is a tool that performs a symbolic backward reachability analysis for GTS with universally quantified conditions. The tool exploits a generalization of monotonic abstraction to quantifications over graph patterns as a heuristic to manipulate infinite sets of configurations using minimal constraints (given in form of graphs) only.…”

Section: Related Workmentioning

confidence: 99%

“…UNCONVER can be viewed as the counterpart of UNDIP and PFS for systems in which configurations have a graph structure. Differently from [30,40] and [28], our specification logic can be applied to define invariants involving an arbitrary but fixed number of nodes. For this purpose, we use assertions with parametric formulas.…”

Section: Related Workmentioning

confidence: 99%

“…The use of permutation schemes seems less standard in approaches based on deductive verification. In particular the other approaches applied to the formal verification of the DDP protocol [30,40,28] are based on much more intricate machineries (assume-guarantee methods with complex circular proof systems, or symbolic backward analysis based on graph transformation systems). The use of a specification logic based on simple conditional update rules, and of source to source transformations help us in providing a much simpler proof of the desired correctness properties.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Logic-based Verification of the Distributed Dining Philosophers Protocol

Delzanno

2018

View full text Add to dashboard Cite

We present a logic-based framework for the specification and validation of distributed protocols. Our specification language is a logic-based presentation of update rules for arbitrary graphs. Update rules are specified via conditional rewriting rules defined over a relational language. We focus our attention on unary and binary relations as a way to specify predicates over nodes and edges of a graph. For the considered language, we define assertions that can be applied to specify correctness properties for arbitrary configurations. We apply the language to model the distributed version of the Dining Philosopher Protocol. The protocol is defined for asynchronous processes distributed over a graph with arbitrary topology. We propose then validation methods based on source to source transformations and deductive reasoning. We apply the resulting method to provide a succint correctness proof of the considered case-study.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Logic-based Verification of the Distributed Dining Philosophers Protocol

Delzanno

2018

View full text Add to dashboard Cite

show abstract

“…-UNCOVER [104,115] is a tool that performs a symbolic backward reachability analysis for GTS with universally quantified conditions. The tool exploits a generalization of monotonic abstraction to quantifications over graph patterns as a heuristic to manipulate infinite sets of configurations using minimal constraints (given in form of graphs) only.…”

Section: Tools For Parameterized Verificationmentioning

confidence: 99%

Parameterized verification

Abdulla

Delzanno

2016

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV ’14 and PV ’15, we survey some of the works developed in this research area

show abstract

Reachability Predicates for Graph Assertions

Delzanno

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems

Cited by 4 publications

References 9 publications

Logic-based Verification of the Distributed Dining Philosophers Protocol

Logic-based Verification of the Distributed Dining Philosophers Protocol

Parameterized verification

Reachability Predicates for Graph Assertions

Contact Info

Product

Resources

About