2137 search results - page 166 / 428 » Proving Abstract Non-interference |
127
click to vote
CAV
2004
Springer
15 years 7 months ago
2004
Springer
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
CAV
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
131
click to vote
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
121
click to vote
APN
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Petri nets are widely used for modeling and analyzing workflows. Using the token-game semantics, Petri net-based workflow models can be analyzed before the model is actua...
107
click to vote
CHARME
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...