407 search results - page 45 / 82 » Malleable Proof Systems and Applications |
158
click to vote
LPNMR
2001
Springer
15 years 10 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...
144
click to vote
FORMATS
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
172
click to vote
FCS
2006
15 years 7 months ago
2006
The application of the principles of quantum mechanics to cryptography has led to a respectable new dimension in confidential communication. As a result of these developments, it i...
143
Voted
IPL
2006
15 years 5 months ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
189
click to vote
LFCS
2007
Springer
15 years 12 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...