Nested antichains for WS1S

DOI10.1007/s00236-018-0331-zzbMath1417.68182arXiv1501.03849OpenAlexW2907969637MaRDI QIDQ1733101

Tomáš Fiedor, Tomáš Vojnar, Lukáš Holík, Ondřej Lengál

Publication date: 21 March 2019

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.03849

Mathematics Subject Classification ID

Uses Software

• MONA
• HIP
• VATA
• MTBDD
• Antichains
• Slide

Cites Work

• 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
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• MONA IMPLEMENTATION SECRETS
• 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
• The Tree Width of Separation Logic with Recursive Definitions
• Nested Antichains for WS1S
• An Efficient Decision Procedure for Imperative Tree Data Structures
• Minimization of symbolic automata
• Decidable logics combining heap structures and data
• Computing Simulations over Tree Automata
• Antichains: A New Algorithm for Checking Universality of Finite Automata

This page was built for publication: Nested antichains for WS1S