100 views175 votes14 years 10 months ago JSC 2010»
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
157 views131 votes15 years 5 months ago FLAIRS 2010»
Intelligent software agents (agents) adhering to the action selection paradigm have only one primary task that they need accomplish at any given time: to choose their next action....
206 views120 votes15 years 6 months ago PLDI 2010»
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
77 views117 votes15 years 2 months ago JANCL 2002»
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
172 views120 votes15 years 1 months ago MFCS 2010»
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
217 views115 votes15 years 4 months ago AIML 2008»
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
217 views118 votes15 years 4 months ago ATVA 2010»
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
143 views134 votes15 years 4 months ago DLOG 2006»
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
172 views112 votes15 years 4 months ago AAAI 2010»
In this paper, we study the knowledge compilation task for propositional epistemic logic S5. We first extend many of the queries and transformations considered in the classical kn...
133 views123 votes15 years 8 months ago COCO 2004»
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...