scholarly journals A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement

2009 ◽  
pp. 271-288 ◽  
Author(s):  
Yael Meller ◽  
Orna Grumberg ◽  
Sharon Shoham
Keyword(s):  
Compositional Verification ◽  
Abstraction Refinement

scholarly journals A framework for compositional verification of multi-valued systems via abstraction-refinement

2016 ◽  
Vol 247 ◽  
pp. 169-202 ◽  
Author(s):  
Yael Meller ◽  
Orna Grumberg ◽  
Sharon Shoham
Keyword(s):  
Compositional Verification ◽  
Abstraction Refinement

scholarly journals Compositional Abstraction Refinement for Component-Based Systems

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Lianyi Zhang ◽  
Qingdi Meng ◽  
Kueiming Lo
Keyword(s):  
Compositional Verification ◽  
Safety Properties ◽  
Abstraction Refinement

The efficiency of the compositional verification of invariants depends on the abstraction, which may lead to verification incompleteness. The invariant strengthening and state partitioning techniques are proposed in this paper. The former could refine the overapproximation by removing the unreachable states, and the latter is a variant of counterexample-guided abstraction refinement. Integrated with these two refinement techniques, a unified compositional verification framework is presented to strengthen the abstraction and find counterexamples. Some examples are included to show that the verification of the safety properties in component-based systems has been achieved by our framework.

Sound and mechanised compositional verification of input-output conformance

2013 ◽  
Vol 24 (4) ◽  
pp. 289-319 ◽  
Author(s):  
Augusto Sampaio ◽  
Sidney Nogueira ◽  
Alexandre Mota ◽  
Yoshinao Isobe
Keyword(s):  
Compositional Verification ◽  
Input Output

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

scholarly journals Robust and compositional verification of object capability patterns

2017 ◽  
Vol 1 (OOPSLA) ◽  
pp. 1-26 ◽  
Author(s):  
David Swasey ◽  
Deepak Garg ◽  
Derek Dreyer
Keyword(s):  
Compositional Verification
Sign in / Sign up

Export Citation Format

Share Document