Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
el Nondeterministic Abstractions in C++ Laurent Michel1 , Andrew See1 , and Pascal Van Hentenryck2 1 University of Connecticut, Storrs, CT 06269-2155 2 Brown University, Box 1910, ...
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...