The following pages link to FLATA (Q16326):
Displaying 24 items.
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Applying abstract acceleration to (co-)reachability analysis of reactive programs (Q435977) (← links)
- A versatile concept for the analysis of loops (Q444373) (← links)
- Algebraic program analysis (Q832153) (← links)
- Porous invariants (Q832262) (← links)
- \textsc{Diffy}: inductive reasoning of array programs using difference invariants (Q832320) (← links)
- Accelerating worst case execution time analysis of timed automata models with cyclic behaviour (Q903501) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Learning inductive invariants by sampling from frequency distributions (Q2225478) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- Automatic Generation of Invariants for Circular Derivations in SUP(LA) (Q2891451) (← links)
- Taming Past LTL and Flat Counter Systems (Q2908489) (← links)
- A New Acceleration-Based Combination Framework for Array Properties (Q2964461) (← links)
- Quantitative Robustness Analysis of Flat Timed Automata (Q3000612) (← links)
- Petri Net Reachability Graphs: Decidability Status of First Order Properties (Q3166230) (← links)
- Fast Acceleration of Ultimately Periodic Relations (Q3583851) (← links)
- Iterating Octagons (Q3617767) (← links)
- (Q5015369) (← links)
- A Calculus for Modular Loop Acceleration (Q5039502) (← links)
- (Q5129947) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- Deciding Conditional Termination (Q5891476) (← links)
- ICE-based refinement type discovery for higher-order functional programs (Q5919002) (← links)
