756 search results - page 89 / 152 » Using Logic Programs to Reason about Infinite Sets |
142
click to vote
TPHOL
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
166
click to vote
FORTE
2009
15 years 1 months ago
2009
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
128
click to vote
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
132
click to vote
CCS
2008
ACM
15 years 5 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
105
click to vote
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...