Sciweavers

562 search results - page 39 / 113
» A Concurrent Model for Linear Logic
Sort
View
LPAR
2001
Springer
14 years 1 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
POPL
2005
ACM
14 years 9 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
CADE
2007
Springer
14 years 9 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
IPPS
2002
IEEE
14 years 1 months ago
Detecting Temporal Logic Predicates on the Happened-Before Model
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicat...
Alper Sen, Vijay K. Garg
CSL
2010
Springer
13 years 10 months ago
Two-Variable Logic with Two Order Relations - (Extended Abstract)
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
Thomas Schwentick, Thomas Zeume