10 search results - page 2 / 2 » The Common Fragment of CTL and LTL |
CADE
2007
Springer
15 years 10 months ago
2007
Springer
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...
ICDT
2007
ACM
15 years 3 months ago
2007
ACM
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
60
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
LICS
2005
IEEE
15 years 3 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 ...
169
click to vote
CONCUR
2011
Springer
13 years 9 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...