Modular Verification of Higher-Order Functional Programs

Satô, Ryôsuke; Kobayashi, Naoki

doi:10.1007/978-3-662-54434-1_31

Cited by 3 publications

(1 citation statement)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One can extend the syntax as long as it can be interpreted in the model. They may be useful in the context of modular model-checking [34]. It would be interesting to extend the current work to linear constructs investigated recently by Clairambault, Grellois and Murawski [35].…”

Section: Discussionmentioning

confidence: 88%

Lambda Y-Calculus With Priorities

Walukiewicz

2019

2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

View full text Add to dashboard Cite

The lambdaY-calculus with priorities is a variant of the simplytyped lambda calculus designed for higher-order model-checking. The higher-order model-checking problem asks if a given parity tree automaton accepts the Böhm tree of a given term of the simply-typed lambda calculus with recursion. We show that this problem can be reduced to the same question but for terms of lambdaY-calculus with priorities and visibly parity automata; a subclass of parity automata. The latter question can be answered by evaluating terms in a simple powerset model with least and greatest fixpoints. We prove that the recognizing power of powerset models and visibly parity automata are the same. So, up to conversion to the lambdaY-calculus with priorities, powerset models with least and greatest fixpoints are indeed the right semantic framework for the model-checking problem. The reduction to lambdaY-calculus with priorities is also efficient algorithmically: it gives an algorithm of the same complexity as direct approaches to the higher-order model-checking problem. This indicates that the task of calculating the value of a term in a powerset model is a central algorithmic problem for higher-order model-checking.

show abstract

Section: Discussionmentioning

confidence: 88%

Lambda Y-Calculus With Priorities

Walukiewicz

2019

2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

View full text Add to dashboard Cite

show abstract

Combining higher-order model checking with refinement type inference

Satô

Iwayama

Kobayashi

2019

Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Symbolic Execution Game Semantics

Lin¹,

Tzevelekos²

2020

Preprint

View full text Add to dashboard Cite

We present a framework for symbolically executing and model checking higher-order programs with external (open) methods. We focus on the client-library paradigm and in particular we aim to check libraries with respect to any definable client. We combine traditional symbolic execution techniques with operational game semantics to build a symbolic execution semantics that captures arbitrary external behaviour. We prove the symbolic semantics to be sound and complete. This yields a bounded technique by imposing bounds on the depth of recursion and callbacks. We provide an implementation of our technique in the K framework and showcase its performance on a custom benchmark based on higher-order coding errors such as reentrancy bugs.

show abstract

Modular Verification of Higher-Order Functional Programs

Cited by 3 publications

References 33 publications

Lambda Y-Calculus With Priorities

Lambda Y-Calculus With Priorities

Combining higher-order model checking with refinement type inference

Symbolic Execution Game Semantics

Contact Info

Product

Resources

About