scientific article; zbMATH DE number 1903380
From MaRDI portal
Publication:4804925
zbMath1010.68087MaRDI QIDQ4804925
Pritha Mahata, Julien d'Orso, Parosh Aziz Abdulla, Bengt Jonsson
Publication date: 1 May 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2404/24040555.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (12)
Controlled Term Rewriting ⋮ Backward and forward bisimulation minimization of tree automata ⋮ Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies ⋮ Model checking, synthesis, and learning ⋮ Regular model checking: evolution and perspectives ⋮ Regular model checking revisited ⋮ A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata ⋮ Verifying Multithreaded Recursive Programs with Integer Variables ⋮ Tree regular model checking: a simulation-based approach ⋮ Simulations of Weighted Tree Automata ⋮ Handling Left-Quadratic Rules When Completing Tree Automata ⋮ Iterating transducers
This page was built for publication:
