6978 search results - page 63 / 1396 » On Proofs in System P |
SIGOPSE
2004
ACM
14 years 3 months ago
2004
ACM
STACS
2001
Springer
14 years 2 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
FAC
1998
13 years 9 months ago
1998
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
FAC
2008
13 years 9 months ago
2008
A development of the Mondex system was undertaken using Event-B and its associated proof tools. mental approach was used whereby the refinement between the abstract specification o...
P2P
2008
IEEE
14 years 4 months ago
2008
IEEE
The ”tracker” of a P2P system is used to lookup which peers hold (or partially hold) a given object. There are various designs for the tracker function, from a single-server t...