The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
Abstract. This paper explores a way to apply model checking techniques to parallel programs that use the nonblocking primitives of the Message Passing Interface (MPI). The method h...
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...