426 search results - page 62 / 86 » Specification, Abduction, and Proof |
DATE
2004
IEEE
14 years 1 months ago
2004
IEEE
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
FROCOS
2000
Springer
14 years 1 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
EUROPKI
2009
Springer
13 years 7 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...