swMATH4142MaRDI QIDQ16326FDOQ16326
Author name not available (Why is that?)
Official website: http://nts.imag.fr/index.php/Flata
Cited In (45)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- Diffy
- Fast acceleration of ultimately periodic relations
- Algebraic program analysis
- \textsc{Diffy}: inductive reasoning of array programs using difference invariants
- Porous invariants
- Iterating Octagons
- ICE-based refinement type discovery for higher-order functional programs
- Verification of Flat FIFO Systems
- Taming past LTL and flat counter systems
- Quantitative robustness analysis of flat timed automata
- Verification of flat FIFO systems
- A new acceleration-based combination framework for array properties
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- A calculus for modular loop acceleration
- Guiding Craig interpolation with domain-specific abstractions
- Petri net reachability graphs: decidability status of first order properties
- A versatile concept for the analysis of loops
- Automatic Generation of Invariants for Circular Derivations in SUP(LA)
- TREX
- Aspic
- PURRS
- Princess
- ABC
- Aligators
- Eldarica
- HMC
- HSF
- TPDB
- LOOPUS
- opaal
- FAST
- c2i
- Spacer
- MoCHi
- LoAT
- RAHFT
- JayHorn
- Accelerating worst case execution time analysis of timed automata models with cyclic behaviour
- Solving non-linear Horn clauses using a linear Horn clause solver
- Learning inductive invariants by sampling from frequency distributions
- On selective unboundedness of VASS
- Taming past LTL and flat counter systems
- TreeAutomizer
- Deciding conditional termination
This page was built for software: FLATA
