1894 search results - page 200 / 379 » A TLA Proof System |
150
click to vote
SAS
2009
Springer
16 years 5 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
162
click to vote
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
126
click to vote
ISW
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
145
click to vote
ENTCS
2008
15 years 4 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
237
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...