On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-00596-1_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Primitive Recursion for Higher-Order Abstract Syntax

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Higher-Order Pushdown Trees Are Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Higher-Order Analysis of 2–3 Trees

International Journal of Foundations of Computer Science
Computer Science
1995English

Collapsible Pushdown Automata and Recursion Schemes

Proceedings - Symposium on Logic in Computer Science
MathematicsSoftware
2008English

Partial Order Reduction in Directed Model Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Branching-Time Model Checking Gap-Order Constraint Systems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2016English

Thermal Stress Analysis of Laminated Plates Using Global-Local Higher-Order Model

2015English

Global Model-Checking of Infinite-State Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy