Model checking higher-order programs
From MaRDI portal
Recommendations
Cited in
(62)- Automating relatively complete verification of higher-order functional programs
- Automata, Logic and Games for the $$\lambda $$ -Calculus
- Recursion schemes and the WMSO+U logic
- Types and trace effects of higher order programs
- Exact bounds for acyclic higher-order recursion schemes
- scientific article; zbMATH DE number 7199579 (Why is no real title available?)
- Model-checking higher-order programs with recursive types
- Tools and Algorithms for the Construction and Analysis of Systems
- Using models to model-check recursive schemes
- Compositional higher-order model checking via -regular games over Böhm trees
- Higher-order program verification via HFL model checking
- Using models to model-check recursive schemes
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
- Complexity of model checking recursion schemes for fragments of the modal mu-calculus
- Cost Automata, Safe Schemes, and Downward Closures
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- On the termination problem for probabilistic higher-order recursive programs
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Verifying higher-order functions with tree automata
- Temporal verification of higher-order functional programs
- Verifying termination and reduction properties about higher-order logic programs
- Complexity of model-checking call-by-value programs
- A ZDD-Based Efficient Higher-Order Model Checking Algorithm
- Automata-based abstraction for automated verification of higher-order tree-processing programs
- Verification of tree-processing programs via higher-order model checking
- Higher-order program verification and language-based security (extended abstract)
- Reachability analysis of innermost rewriting
- Higher-order model checking: an overview
- Higher-order model checking step by step
- Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
- Cost automata, safe schemes, and downward closures
- Types and higher-order recursion schemes for verification of higher-order programs
- Size-preserving translations from order-(n+1) word grammars to order-n tree grammars
- On average-case hardness of higher-order model checking
- Model Checking Via ΓCFA
- Syntactically and semantically regular languages of -terms coincide through logical relations
- Extending the WMSO+U logic with quantification over tuples
- scientific article; zbMATH DE number 7526052 (Why is no real title available?)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- Verification of Higher-Order Computation: A Game-Semantic Approach
- A Nonstandard Functional Programming Language
- Modular verification of higher-order functional programs
- An overview of the HFL model checking project
- Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses
- Termination criteria for tree automata completion
- Verification of higher-order concurrent programs with dynamic resource creation
- scientific article; zbMATH DE number 7297868 (Why is no real title available?)
- Model checking and functional program transformations
- Executing and verifying higher-order functional-imperative programs in Maude
- A traversal-based algorithm for higher-order model checking
- A model for behavioural properties of higher-order programs
- Pairwise reachability analysis for higher order concurrent programs by higher-order model checking
- Higher-order model checking in direct style
- From bounded checking to verification of equivalence via symbolic up-to techniques
- A bounded model checking technique for higher-order programs
- A temporal logic for higher-order functional programs
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- Slice closures of indexed languages and word equations with counting constraints
- Programming Languages and Systems
- Functional programs as compressed data
This page was built for publication: Model checking higher-order programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395718)
