The following pages link to Jérôme Leroux (Q300415):
Displaying 50 items.
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- Verification of population protocols (Q523133) (← links)
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) (← links)
- On boundedness problems for pushdown vector addition systems (Q1675154) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states (Q2280187) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (Q2786139) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness (Q2842102) (← links)
- (Q2847416) (← links)
- Model Checking Vector Addition Systems with one zero-test (Q2895472) (← links)
- (Q2908849) (← links)
- Vector Addition System Reachability Problem: A Short Self-contained Proof (Q3004566) (← links)
- Vector Addition System Reversible Reachability Problem (Q3090839) (← links)
- On Functions Weakly Computable by Petri Nets and Vector Addition Systems (Q3447705) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems (Q3457800) (← links)
- Convex Hull of Arithmetic Automata (Q3522060) (← links)
- Accelerated Data-Flow Analysis (Q3612002) (← links)
- TaPAS: The Talence Presburger Arithmetic Suite (Q3617759) (← links)
- Polynomial Precise Interval Analysis Revisited (Q3644736) (← links)
- (Q4415251) (← links)
- (Q4601852) (← links)
- Hyper-Ackermannian bounds for pushdown vector addition systems (Q4635648) (← links)
- Demystifying Reachability in Vector Addition Systems (Q4635791) (← links)
- Model Checking Population Protocols (Q4636574) (← links)
- Vector Addition System Reversible Reachability Problem (Q4913768) (← links)
- Interpolating Quantifier-Free Presburger Arithmetic (Q4933327) (← links)
- (Q5002821) (← links)
- The Reachability Problem for Petri Nets Is Not Elementary (Q5056399) (← links)
- (Q5089304) (← links)
- (Q5089315) (← links)
- (Q5090970) (← links)
- (Q5092363) (← links)
- Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One (Q5111451) (← links)
- (Q5144611) (← links)
- When Reachability Meets Grzegorczyk (Q5145613) (← links)
- Efficient Analysis of VASS Termination Complexity (Q5145672) (← links)
- Acceleration for Petri Nets (Q5166672) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- (Q5207052) (← links)
- Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States (Q5212023) (← links)
- The reachability problem for Petri nets is not elementary (Q5212744) (← links)
- Presburger Vector Addition Systems (Q5271037) (← links)
- On the Context-Freeness Problem for Vector Addition Systems (Q5271039) (← links)
- Model Checking Software (Q5308376) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308435) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311488) (← links)
