Automata-based verification of programs with tree updates
From MaRDI portal
Publication:845236
DOI10.1007/S00236-009-0108-5zbMATH Open1185.68414OpenAlexW1604924060MaRDI QIDQ845236FDOQ845236
Authors: Peter Habermehl, Radu Iosif, Tomáš Vojnar 
Publication date: 5 February 2010
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-009-0108-5
Recommendations
- Tools and Algorithms for the Construction and Analysis of Systems
- Automata-based abstraction for automated verification of higher-order tree-processing programs
- Verifying higher-order functions with tree automata
- Certifying a Tree Automata Completion Checker
- Tree automata-based refinement with application to Horn clause verification
- Verification of tree-processing programs via higher-order model checking
- scientific article; zbMATH DE number 2040893
- Verification of concurrent programs: The automata-theoretic framework
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Visibly pushdown languages
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Automated Verification of Shape and Size Properties Via Separation Logic
- Tree automata with one memory set constraints and cryptographic protocols
- Context logic as modal logic, completeness and parametric inexpressivity
- Static Analysis
- Tree Automata with Memory, Visibility and Structural Constraints
- Automata, Languages and Programming
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Title not available (Why is that?)
- Verifying Balanced Trees
Cited In (9)
- Computer Aided Verification
- Verifying Balanced Trees
- An efficient decision procedure for imperative tree data structures
- Verification of heap manipulating programs with ordered data by extended forest automata
- Verification of heap manipulating programs with ordered data by extended forest automata
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
- Forest automata for verification of heap manipulation
Uses Software
This page was built for publication: Automata-based verification of programs with tree updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845236)
