Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
From MaRDI portal
Publication:5918382
DOI10.1007/s10817-021-09597-wOpenAlexW3197146039MaRDI QIDQ5918382
Tomáš Vojnar, Lukáš Holík, Ondřej Lengál, Vojtěch Havlena
Publication date: 24 November 2021
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-021-09597-w
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic
- Array theory of bounded elements and its applications
- Forest automata for verification of heap manipulation
- Automated logical verification based on trace abstractions
- MONA IMPLEMENTATION SECRETS
- Lazy Automata Techniques for WS1S
- Antichain Algorithms for Finite Automata
- When Simulation Meets Antichains
- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Nested Antichains for WS1S
- An Efficient Decision Procedure for Imperative Tree Data Structures
- Minimization of symbolic automata
- Decidable logics combining heap structures and data
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Hybrid Systems: Computation and Control
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
This page was built for publication: Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure