3228 search results - page 95 / 646 » Computationally Sound Proofs |
188
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
154
click to vote
APAL
2010
15 years 6 months ago
2010
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...
199
click to vote
MSCS
2006
15 years 6 months ago
2006
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...
212
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
152
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness pr...