Sciweavers

1076 search results - page 124 / 216
» Operations on proofs and labels
Sort
View
ARGMAS
2009
Springer
14 years 3 months ago
A Generative Dialogue System for Arguing about Plans in Situation Calculus
Abstract. This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between b...
Alexandros Belesiotis, Michael Rovatsos, Iyad Rahw...
APLAS
2009
ACM
14 years 3 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel
PRDC
2008
IEEE
14 years 3 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
FMCAD
2007
Springer
14 years 3 months ago
Verifying Correctness of Transactional Memories
—We show how to verify the correctness of transactional memory implementations with a model checker. We show how to specify transactional memory in terms of the admissible interc...
Ariel Cohen 0002, John W. O'Leary, Amir Pnueli, Ma...
FOSSACS
2007
Springer
14 years 3 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz