Formal verification of safety and liveness properties of systems with a dynamically changing, unbounded number of interlinked processes and infinite-domain local data is challenging due to the two sources of infiniteness. The existing state abstraction-based approaches Data Type Reduction and Environment Abstraction each address one aspect, but the former doesn’t support infinite-domain local data and the latter doesn’t support links and is restricted to particular properties. The contribution of this paper is a combination of both which is obtained by first stating them in the framework of Canonical Abstraction. This new use of Canonical Abstraction, originally designed and used for the analysis of programs with heap-allocated data structu...
Weakly continuation-closed abstractions are known to preserve properties satisfied within fairness, ...
We present a fully-symbolic LTL model checking approach for infinite-state transition systems. We ex...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...
Automatic formal verification of systems composed of a large or even unbounded number of components...
Abstract. We present a technique for automatically verifying safety properties of concurrent program...
Canonical abstraction is a static analysis technique that represents states as 3-valued logical stru...
Predicate abstraction and canonical abstraction are two finitary abstractions used to prove propert...
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems u...
Model checking is an automated method to prove safety and liveness properties for finite systems. So...
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
Checking the design or specification of a co-operating, i.e. concurrent and reactive, system for cor...
(SPECIAL POPL ISSUE) Predicate abstraction is the basis of many program verification tools. Until no...
Abstract. We study the uniform verification problem for infinite state processes, which consists of ...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems us...
Weakly continuation-closed abstractions are known to preserve properties satisfied within fairness, ...
We present a fully-symbolic LTL model checking approach for infinite-state transition systems. We ex...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...
Automatic formal verification of systems composed of a large or even unbounded number of components...
Abstract. We present a technique for automatically verifying safety properties of concurrent program...
Canonical abstraction is a static analysis technique that represents states as 3-valued logical stru...
Predicate abstraction and canonical abstraction are two finitary abstractions used to prove propert...
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems u...
Model checking is an automated method to prove safety and liveness properties for finite systems. So...
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
Checking the design or specification of a co-operating, i.e. concurrent and reactive, system for cor...
(SPECIAL POPL ISSUE) Predicate abstraction is the basis of many program verification tools. Until no...
Abstract. We study the uniform verification problem for infinite state processes, which consists of ...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems us...
Weakly continuation-closed abstractions are known to preserve properties satisfied within fairness, ...
We present a fully-symbolic LTL model checking approach for infinite-state transition systems. We ex...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...