swMATH21268MaRDI QIDQ33078FDOQ33078
Author name not available (Why is that?)
Official website: http://www.lsv.fr/Software//fast/
Cited In (53)
- Verification of Flat FIFO Systems
- Reachability in parameterized systems: all flavors of threshold automata
- A case study on parametric verification of failure detectors
- Flat Petri nets (invited talk)
- Title not available (Why is that?)
- Forward analysis and model checking for trace bounded WSTS
- Quantitative separation logic and programs with lists
- How to Tackle Integer Weighted Automata Positivity
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Automatic verification of counter systems with ranking function
- Verification of flat FIFO systems
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- Dense-choice counter machines revisited
- Verification of qualitative \(\mathbb Z\) constraints
- Forward analysis and model checking for trace bounded WSTS
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- A calculus for modular loop acceleration
- Guiding Craig interpolation with domain-specific abstractions
- The Power of Hybrid Acceleration
- Experimenting Formal Proofs of Petri Nets Refinements
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Programs with lists are counter automata
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Don't care words with an application to the automata-based approach for real addition
- Formal verification of real-time systems with preemptive scheduling
- Reachability in timed counter systems
- IMITATOR
- Aspic
- Dagger
- MONA
- Structural Presburger digit vector automata
- Verification and falsification of programs with loops using predicate abstraction
- PSync
- Antichains
- EUREKA
- LASH
- LIRA
- ByMC
- LoAT
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- Verification of programs with half-duplex communication
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
- Automatic Verification of Bossa Scheduler Properties
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Abstract fixpoint computations with numerical acceleration methods
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Some ways to reduce the space dimension in polyhedra computations
- Symbolic model checking in non-Boolean domains
- Automated Technology for Verification and Analysis
- Generalizing the template polyhedral domain
- Fair termination for parameterized probabilistic concurrent systems
This page was built for software: FAST
