Sciweavers

1486 search results - page 39 / 298
» A Logically Saturated Extension of
Sort
View
LFCS
2009
Springer
14 years 1 months ago
ATL with Strategy Contexts and Bounded Memory
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
Thomas Brihaye, Arnaud Da Costa Lopes, Franç...
JSYML
2008
86views more  JSYML 2008»
13 years 9 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
FUIN
2010
172views more  FUIN 2010»
13 years 6 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...
CSL
2009
Springer
14 years 3 months ago
Craig Interpolation for Linear Temporal Languages
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...
Amélie Gheerbrant, Balder ten Cate
EATCS
2000
108views more  EATCS 2000»
13 years 8 months ago
The Underlying Logic of Hoare Logic
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
Andreas Blass, Yuri Gurevich