2014
DOI: 10.1007/978-3-319-12736-1_19
|View full text |Cite
|
Sign up to set email alerts
|

A ZDD-Based Efficient Higher-Order Model Checking Algorithm

Abstract: The model checking of higher-order recursion schemes, aka. higher-order model checking, has recently been applied to automated verification of higher-order programs. Despite its extremely high worstcase complexity, practical algorithms have been developed that work well for typical inputs that arise in program verification. Even the stateof-the-art algorithms are, however, not scalable enough for verification of thousands or millions of lines of programs. We, therefore, propose a new higher-order model checkin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Benchmarks We tested our implementation on a set of 40 programs that include a selection from the MoCHi benchmark [13]; a set of higher-order programs written in OCaml, originally used to test the higher-order model checking tool MoCHi [13], and subsequently used for benchmarking [23,4,22]. We added custom samples with references In this set we have of safe and unsafe programs denoted by the -e termination in their filename.…”
Section: Implementation and Experimentsmentioning
confidence: 99%
“…Benchmarks We tested our implementation on a set of 40 programs that include a selection from the MoCHi benchmark [13]; a set of higher-order programs written in OCaml, originally used to test the higher-order model checking tool MoCHi [13], and subsequently used for benchmarking [23,4,22]. We added custom samples with references In this set we have of safe and unsafe programs denoted by the -e termination in their filename.…”
Section: Implementation and Experimentsmentioning
confidence: 99%
“…Whereas the decidability of HFL model-checking against finite transition systems is rather simple, it took more time to understand the decidability of HORS model-checking against the ordinary (order 0) modal µ-calculus. This situation actually benefited to HORS: the intense research on HORS produced several optimized algorithms and implementations of HORS model-checking [2,9,19], whereas HFL model-checking remains a rather theoretical and unexplored topic. HORS can be thought as recursive formulas with no boolean connectives and least fixed points everywhere.…”
Section: Related Workmentioning
confidence: 99%