FLATA

swMATH4142MaRDI QIDQ16326FDOQ16326

Author name not available (Why is that?)

Cited In (24)

• Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
• 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
• Title not available (Why is that?)
• Applying abstract acceleration to (co-)reachability analysis of reactive programs
• Guiding Craig interpolation with domain-specific abstractions
• Taming Past LTL and Flat Counter Systems
• A versatile concept for the analysis of loops
• Fast Acceleration of Ultimately Periodic Relations
• Automatic Generation of Invariants for Circular Derivations in SUP(LA)
• Quantitative Robustness Analysis of Flat Timed Automata
• A New Acceleration-Based Combination Framework for Array Properties
• Accelerating worst case execution time analysis of timed automata models with cyclic behaviour
• Petri Net Reachability Graphs: Decidability Status of First Order Properties
• Learning inductive invariants by sampling from frequency distributions
• On selective unboundedness of VASS
• Taming past LTL and flat counter systems
• Title not available (Why is that?)
• A Calculus for Modular Loop Acceleration
• Deciding conditional termination

This page was built for software: FLATA