971 search results - page 167 / 195 » Approximate Satisfiability and Equivalence |
FOSSACS
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
104
click to vote
WG
1994
Springer
15 years 3 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
121
click to vote
CTRSA
2009
Springer
15 years 3 months ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
122
click to vote
CAV
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
105
click to vote
IANDC
2006
14 years 11 months ago
2006
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...