AbstractA unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) refinements, (2) forward and backward simulations, (3) hybrid forward-backward and backward-forward simulations, and (4) history and prophecy relations are defined. History and prophecy relations are abstract versions of the history and prophecy variables of Abadi and Lamport, as well as the auxiliary variables of Owicki and Gries, Relationships between the different types of simulations, as well as soundness and completeness results, are stated and proved. Finally, it is shown how invariants can be incorporated into all the simulations. Even though many resu...
Formal methods for specifying, analyzing, and manipulating the behavior of concurrent systems become...
In the literature, the conditions on history variables or forward simulations that are related to li...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
A unified, comprehensive presentation of simulation techniques for verification of concurrent system...
Abstract. A general automaton model for timing-based systems is presented and is used as the context...
AbstractA general automaton model for timing-based systems is presented and is used as the context f...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...
We describe an approach to verifying concurrent data structures based on simulation between two Inpu...
Abstract. The technique of forward/backward simulations has been applied successfuly in many distrib...
AbstractWe describe an approach to verifying concurrent data structures based on simulation between ...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
AbstractRewriting logic is a flexible and general logic to specify concurrent systems. To prove prop...
Invited contribution at FORMATS'22International audienceTimed automata have been introduced by Rajee...
In this paper we present a unifying approach for deciding various bisimulations, simulation equiv-al...
This thesis is about mathematical structures and techniques related to formal specification and veri...
Formal methods for specifying, analyzing, and manipulating the behavior of concurrent systems become...
In the literature, the conditions on history variables or forward simulations that are related to li...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...
A unified, comprehensive presentation of simulation techniques for verification of concurrent system...
Abstract. A general automaton model for timing-based systems is presented and is used as the context...
AbstractA general automaton model for timing-based systems is presented and is used as the context f...
Abstract. Simulation-based assertional techniques and process algebraic tech-niques are two of the m...
We describe an approach to verifying concurrent data structures based on simulation between two Inpu...
Abstract. The technique of forward/backward simulations has been applied successfuly in many distrib...
AbstractWe describe an approach to verifying concurrent data structures based on simulation between ...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
AbstractRewriting logic is a flexible and general logic to specify concurrent systems. To prove prop...
Invited contribution at FORMATS'22International audienceTimed automata have been introduced by Rajee...
In this paper we present a unifying approach for deciding various bisimulations, simulation equiv-al...
This thesis is about mathematical structures and techniques related to formal specification and veri...
Formal methods for specifying, analyzing, and manipulating the behavior of concurrent systems become...
In the literature, the conditions on history variables or forward simulations that are related to li...
AbstractWhen proving the correctness of algorithms in distributed systems, one generally considerssa...