LASH
From MaRDI portal
Software:33079
swMATH21269MaRDI QIDQ33079FDOQ33079
Author name not available (Why is that?)
Cited In (20)
- Title not available (Why is that?)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers
- Forward analysis and model checking for trace bounded WSTS
- On iterating linear transformations over recognizable sets of integers
- Forward analysis and model checking for trace bounded WSTS
- Title not available (Why is that?)
- Iterating transducers in the large (extended abstract)
- The Power of Hybrid Acceleration
- Don't care words with an application to the automata-based approach for real addition
- A type checking algorithm for concurrent object protocols
- Structural Presburger digit vector automata
- Hybrid acceleration using real vector automata (extended abstract)
- Counting the solutions of Presburger equations without enumerating them.
- Learning to verify branching time properties
- Observations on determinization of Büchi automata
- Verification of programs with half-duplex communication
- Title not available (Why is that?)
- Automated Technology for Verification and Analysis
- Implementation and Application of Automata
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for software: LASH
