Automata-based abstraction for automated verification of higher-order tree-processing programs

DOI10.1007/978-3-319-26529-2_16MaRDI QIDQ3459423zbMATH OpenOpenAlexFDO

Authors Y. Matsumoto, Naoki Kobayashi, Hiroshi Unno

Publication date 8 January 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26529-2_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Recommendations

• Verification of tree-processing programs via higher-order model checking
• Verifying higher-order functions with tree automata
• Model checking higher-order programs
• Automating relatively complete verification of higher-order functional programs
• Modular verification of higher-order functional programs

Cited in

(9)

• Automating relatively complete verification of higher-order functional programs
• Automata-based verification of programs with tree updates
• The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
• Verifying higher-order functional programs with pattern-matching algebraic data types
• Verifying higher-order functions with tree automata
• Verification of tree-processing programs via higher-order model checking
• Completeness of tree automata completion
• Verification by augmented abstraction: The automata-theoretic view
• Modular verification of higher-order functional programs

This page was built for publication: Automata-based abstraction for automated verification of higher-order tree-processing programs

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