The following pages link to Stéphane P. Demri (Q213235):
Displaying 50 items.
- (Q355512) (redirect page) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- On the almighty wand (Q418137) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- Logical analysis of demonic nondeterministic programs (Q671651) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- A completeness proof for a logic with an alternative necessity operator (Q677080) (← links)
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics (Q687153) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- A class of decidable information logics (Q1128479) (← links)
- A logic with relative knowledge operators (Q1288174) (← links)
- Every finitely reducible logic has the finite model property with respect to the class of \(\lozenge\)-formulae (Q1288962) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- On modal logics characterized by models with relative accessibility relations. I (Q1591337) (← links)
- On modal logics characterized by models with relative accessibility relations. II (Q1595920) (← links)
- (Q1623284) (redirect page) (← links)
- The effects of adding reachability predicates in propositional separation logic (Q1653010) (← links)
- (Q1708654) (redirect page) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Towards reasoning about Hoare relations (Q1924753) (← links)
- The covering and boundedness problems for branching vector addition systems (Q1936244) (← links)
- Display calculi for logics with relative accessibility relations (Q1973930) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Axiomatising logics with separating conjunction and modalities (Q2296754) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- (Q2708314) (← links)
- (Q2721196) (← links)
- Temporal Logics in Computer Science (Q2805273) (← links)
- Reasoning about Data Repetitions with Counter Systems (Q2818761) (← links)
- Temporal logics on strings with prefix relation (Q2826034) (← links)
- Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
- Taming Past LTL and Flat Counter Systems (Q2908489) (← links)
- (Q2911619) (← links)
- (Q2920125) (← links)
- LTL with the freeze quantifier and register automata (Q2946574) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- The complexity of linear-time temporal logic over the class of ordinals (Q3081444) (← links)
- Temporal Logics of Repeating Values (Q3165752) (← links)
- Petri Net Reachability Graphs: Decidability Status of First Order Properties (Q3166230) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- A Reduction from DLP to PDL (Q3374102) (← links)
- Internal proof calculi for modal logics with separating conjunction (Q3382809) (← links)
