Pages that link to "Item:Q6044119"
From MaRDI portal
The following pages link to Proving safety properties of infinite state systems by compilation into Presburger arithmetic (Q6044119):
Displaying 10 items.
- Applying abstract acceleration to (co-)reachability analysis of reactive programs (Q435977) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Counting the solutions of Presburger equations without enumerating them. (Q1426156) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- A modular static analysis approach to affine loop invariants detection (Q2814096) (← links)
- Extending abstract acceleration methods to data-flow programs with numerical inputs (Q2814110) (← links)
- Tarski’s Influence on Computer Science (Q4611682) (← links)
- (Q5089315) (← links)
- Reasoning about reversal-bounded counter machines (Q6599624) (← links)