150 search results - page 6 / 30 » Parameterized Modal Satisfiability |
JSC
2010
13 years 2 months ago
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...
FLAIRS
2010
13 years 9 months ago
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....
PLDI
2010
ACM
13 years 10 months ago
2010
ACM
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
JANCL
2002
13 years 7 months ago
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...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
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...