1179 search results - page 212 / 236 » Programming in Hybrid Constraint Languages |
136
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
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....
111
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
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, ...
139
click to vote
ATVA
2008
Springer
15 years 5 months ago
2008
Springer
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...
119
click to vote
JAR
2008
15 years 3 months ago
2008
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...
156
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...