LASH
From MaRDI portal
Cited in
(27)- Don't care words with an application to the automata-based approach for real addition
- TREX
- Counting the solutions of Presburger equations without enumerating them.
- PNML
- A type checking algorithm for concurrent object protocols
- MONA
- On iterating linear transformations over recognizable sets of integers
- Structural Presburger digit vector automata
- Verification of programs with half-duplex communication
- Learning to verify branching time properties
- Forward analysis and model checking for trace bounded WSTS
- Forward analysis and model checking for trace bounded WSTS
- FAST
- LIRA
- Mungo
- Counting the solutions of Presburger equations without enumerating them
- session-ocaml
- On the use of weak automata for deciding linear arithmetic with integer and real variables
- Representing arithmetic constraints with finite automata: An overview
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- Tools and Algorithms for the Construction and Analysis of Systems
- A BDD-like implementation of an automata package
- Automated Technology for Verification and Analysis
- The Power of Hybrid Acceleration
- Hybrid acceleration using real vector automata (extended abstract)
- Iterating transducers in the large (extended abstract)
- Observations on determinization of Büchi automata
This page was built for software: LASH