884 search results - page 39 / 177 » A Proof Theory for DL-Lite |
191
click to vote
POPL
2007
ACM
16 years 4 days ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
100
click to vote
CADE
2003
Springer
16 years 4 days ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
TASE
2009
IEEE
15 years 6 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
137
click to vote
ASIAN
2009
Springer
15 years 29 days ago
2009
Springer
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
BIRTHDAY
2010
Springer
15 years 1 days ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...