The following pages link to Stéphane Demri (Q213235):
Displaying 50 items.
- (Q3425576) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- The Complexity of Temporal Logic with Until and Since over Ordinals (Q3498491) (← links)
- Towards a Model-Checker for Counter Systems (Q3522931) (← links)
- On the Almighty Wand (Q3540188) (← links)
- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable (Q3557850) (← links)
- Presburger Modal Logic Is PSPACE-Complete (Q3613433) (← links)
- Linear-time temporal logics with Presburger constraints: an overview ★ (Q3647243) (← links)
- The Effects of Bounding Syntactic Resources on Presburger LTL (Q3656780) (← links)
- (Q4246974) (← links)
- (Q4250056) (← links)
- (Q4250246) (← links)
- (Q4263012) (← links)
- (Q4263013) (← links)
- (Q4263154) (← links)
- (Q4264704) (← links)
- (Q4329271) (← links)
- (Q4345015) (← links)
- (Q4354885) (← links)
- (Q4375809) (← links)
- (Q4381382) (← links)
- (Q4415249) (← links)
- (Q4430396) (← links)
- (Q4503908) (← links)
- (Q4507858) (← links)
- The Complexity of Regularity in Grammar Logics and Related Modal Logics (Q4529491) (← links)
- (Q4537437) (← links)
- (Q4542619) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Expressive completeness of separation logic with two variables and no separating conjunction (Q4635622) (← links)
- (Q4636289) (← links)
- A simple tableau system for the logic of elsewhere (Q4645235) (← links)
- (Q4736876) (← links)
- Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics (Q4779590) (← links)
- Display Calculi for Nominal Tense Logics (Q4796460) (← links)
- (Q4796537) (← links)
- A Modal Perspective on Path Constraints (Q4812322) (← links)
- Uniform and non uniform strategies for tableaux calculi for modal logics (Q4835516) (← links)
- (Q4881681) (← links)
- Specification and Verification using Temporal Logics (Q4907867) (← links)
- Automata-Based Computation of Temporal Equilibrium Models (Q4909313) (← links)
- Model-Checking Bounded Multi-Pushdown Systems (Q4928504) (← links)
- (Q4944959) (← links)
- Separation Logic with One Quantified Variable (Q4981154) (← links)
- (Q4999260) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- (Q5101338) (← links)
- On Symbolic Heaps Modulo Permission Theories (Q5136317) (← links)
- Modal Logics with Composition on Finite Forests (Q5145629) (← links)
