2291 search results - page 157 / 459 » Logic Programming and Model Checking |
128
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
131
click to vote
ILP
2000
Springer
15 years 8 months ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
133
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
150
click to vote
CHARME
2003
Springer
15 years 10 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
259
click to vote
POPL
2007
ACM
16 years 5 months ago
2007
ACM
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...