1283 search results - page 60 / 257 » A Survey on Temporal Logics |
199
click to vote
OPODIS
2003
15 years 7 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
152
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
208
click to vote
HYBRID
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
245
click to vote
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
158
click to vote
FROCOS
2007
Springer
16 years 10 days ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...