Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Library of Numerical Abstract Domains for Static Analysis Bertrand Jeannet1 and Antoine Min?e2 1 INRIA Rh^one-Alpes, Grenoble, France, Bertrand.Jeannet@inrialpes.fr 2 CNRS, ?Ecole ...
Abstract. Almost 20 years after the original conception, we revisit several fundamental questions about modal transition systems. First, we demonstrate the incompleteness of the st...
Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasows...
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...