AbstractA simple methodology for the design and the verification of finite-state concurrent programs is proposed and illustrated by a short example. In most cases, this methodology is likely to be more systematic than the technique of stepwise refinement, and more efficient than the fixpoint-based method
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
In recent years, we applied and extended the theory on the existence of refinement mappings. The pre...
AbstractA simple methodology for the design and the verification of finite-state concurrent programs...
In recent years, we extended an older theory on the existence of refinement mappings. The present pa...
AbstractDespite the enormous strides made in automatic verification technology over the past decade ...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
peer reviewedWe describe an automata-theoretic approach to the automatic verification of concurrent...
Lazy sequentialization has proven to be one of the most effective techniques for concurrent program ...
Abstract—VLSI systems are commonly specified using sequential exe-cutable functional specifications,...
As the use of concurrent software is increasing, we urgently need techniques to establish the correc...
This paper presents FLAVERS, a finite state verification approach that analyzes whether concurrent o...
A programming calculus is presented which will yield programs with simple, suitable, and safe concur...
The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expr...
This paper presents a proof technique for proving refinements for general state-based models of conc...
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
In recent years, we applied and extended the theory on the existence of refinement mappings. The pre...
AbstractA simple methodology for the design and the verification of finite-state concurrent programs...
In recent years, we extended an older theory on the existence of refinement mappings. The present pa...
AbstractDespite the enormous strides made in automatic verification technology over the past decade ...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
peer reviewedWe describe an automata-theoretic approach to the automatic verification of concurrent...
Lazy sequentialization has proven to be one of the most effective techniques for concurrent program ...
Abstract—VLSI systems are commonly specified using sequential exe-cutable functional specifications,...
As the use of concurrent software is increasing, we urgently need techniques to establish the correc...
This paper presents FLAVERS, a finite state verification approach that analyzes whether concurrent o...
A programming calculus is presented which will yield programs with simple, suitable, and safe concur...
The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expr...
This paper presents a proof technique for proving refinements for general state-based models of conc...
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
In recent years, we applied and extended the theory on the existence of refinement mappings. The pre...