The following pages link to Stéphane Demri (Q213235):
Displaying 23 items.
- (Q5155678) (← links)
- The power of modal separation logics (Q5216335) (← links)
- On the complexity of modal separation logics (Q5224566) (← links)
- Reasoning about Data Repetitions with Counter Systems (Q5271038) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- Foundations of Software Science and Computation Structures (Q5308446) (← links)
- On the Complexity of Verifying Regular Properties on Flat Counter Systems, (Q5327431) (← links)
- (Q5419877) (← links)
- Reasoning About Sequences of Memory States (Q5434501) (← links)
- A Decidable Temporal Logic of Repeating Values (Q5434506) (← links)
- Model Checking Freeze LTL over One-Counter Automata (Q5458381) (← links)
- Automated Technology for Verification and Analysis (Q5491868) (← links)
- Internal Calculi for Separation Logic (Q5874205) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- Witness Runs for Counter Machines (Q5891189) (← links)
- Witness Runs for Counter Machines (Q5891236) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897505) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- On the complexity of resource-bounded logics (Q5915899) (← links)
- Incomplete information: Structure, inference, complexity (Q5948141) (← links)
- First steps towards taming description logics with strings (Q6545544) (← links)
- Reasoning about reversal-bounded counter machines (Q6599624) (← links)
- Why propositional quantification makes modal logics on trees robustly hard? (Q6654467) (← links)
