499 search results - page 57 / 100 » LTL satisfiability checking |
188
click to vote
CASCON
2010
14 years 8 months ago
2010
For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. However, web services are dis...
108
click to vote
TOCL
2008
14 years 11 months ago
2008
State Machines Capture Parallel Algorithms: Correction and Extension ANDREAS BLASS University of Michigan and YURI GUREVICH Microsoft Research We consider parallel algorithms worki...
136
click to vote
DLT
2009
14 years 9 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
183
click to vote
POPL
2006
ACM
16 years 4 days ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...