Regular tree model checking

DOI10.1007/3-540-45657-0_47MaRDI QIDQ4804925zbMATH OpenFDO

Authors Pritha Mahata, Julien d'Orso, Parosh A. Abdulla, Bengt Jonsson

Publication date 1 May 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2404/24040555.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Regular model checking
• CONCUR 2004 - Concurrency Theory
• Tree regular model checking: a simulation-based approach
• Abstract regular tree model checking
• Algorithmic improvements in regular model checking.

Cited in

(21)

• Iterating transducers
• Property testing of regular tree languages
• Tree regular model checking: a simulation-based approach
• Regular model checking
• Abstract regular tree model checking
• Simulations of weighted tree automata
• Controlled term rewriting
• Term rewriting with prefix context constraints and bottom-up strategies
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Transitive closures of regular relations for verifying infinite-state systems
• Extrapolating tree transformations
• Handling left-quadratic rules when completing tree automata
• A uniform (bi-)simulation-based framework for reducing tree automata
• Verifying multithreaded recursive programs with integer variables
• CONCUR 2004 - Concurrency Theory
• A completion algorithm for lattice tree automata
• Model checking, synthesis, and learning
• Regular model checking: evolution and perspectives
• Regular model checking revisited
• Ramsey quantifiers over automatic structures: complexity and applications to verification
• Backward and forward bisimulation minimization of tree automata

This page was built for publication: Regular tree model checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804925)