Higher-Order Bounded Model Checking

04/05/2018
by   Yu-Yang Lin, et al.
0

We present a Bounded Model Checking technique for higher-order programs. The vehicle of our study is a higher-order calculus with general references. Our technique is a symbolic state syntactical translation based on SMT solvers, adapted to a setting where the values passed and stored during computation can be functions of arbitrary order. We prove that our algorithm is sound, and devise an optimisation based on points-to analysis to improve scalability. We moreover provide a prototype implementation of the algorithm with experimental results showcasing its performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2019

A Type-Based HFL Model Checking Algorithm

Higher-order modal fixpoint logic (HFL) is a higher-order extension of t...
research
02/21/2020

Symbolic Execution Game Semantics

We present a framework for symbolically executing and model checking hig...
research
09/23/2020

Local Higher-Order Fixpoint Iteration

Local fixpoint iteration describes a technique that restricts fixpoint i...
research
06/20/2020

Dynamic Symbolic Execution of Higher-Order Functions

The effectiveness of concolic testing deteriorates as the size of progra...
research
12/24/2020

Verifying Liveness Properties of ML Programs

Higher-order recursion schemes are a higher-order analogue of Boolean Pr...
research
05/05/2021

Higher-Order Model Checking Step by Step

We show a new simple algorithm that solves the model-checking problem fo...
research
03/30/2021

Higher-Order Neighborhood Truss Decomposition

k-truss model is a typical cohesive subgraph model and has been received...

Please sign up or login with your details

Forgot password? Click here to reset