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