535 search results - page 57 / 107 » Checking Computations in Polylogarithmic Time |
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
ICCS
2001
Springer
14 years 1 months ago
2001
Springer
This paper presents a tool that enables programmers to use cyclic debugging techniques for debugging non-deterministic parallel programs. The solution consists of a combination of ...
PODC
1997
ACM
14 years 1 months ago
1997
ACM
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
CCS
2011
ACM
12 years 9 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
HPCA
2009
IEEE
14 years 9 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...