Horn Clause Solvers for Program Verification

Bjørner, Nikolaj; Gurfinkel, Arie; McMillan, Kenneth L.; Rybalchenko, Andrey

doi:10.1007/978-3-319-23534-9_2

Cited by 187 publications

(173 citation statements)

References 57 publications

Supporting

Mentioning

173

Contrasting

Order By: Relevance

“…Then, the property that a read operation is allowed in the current state can be expressed by a formula of the form read ϕ, which says that the current state has a read-transition, after which ϕ is satisfied. Thus, the program read(x); close(x) being valid is expressed as read close true, 2 which is indeed satisfied by the initial state q 0 of the transition system in Fig. 1.…”

Section: Introductionmentioning

confidence: 83%

Higher-Order Program Verification via HFL Model Checking

Kobayashi

Tsukada

Watanabe

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those program properties. Compared with the previous approaches based on HORS model checking, our approach provides a more uniform, streamlined method for higher-order program verification.

show abstract

Section: Introductionmentioning

confidence: 83%

Higher-Order Program Verification via HFL Model Checking

Kobayashi

Tsukada

Watanabe

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…For example, tools such as Impact [33] and SeaHorn [26] harness the strength of SMT solvers with the theory of integers (and linear inequalities in particular) to offer scalable solutions for reachability analysis of software (cf. [7] for a presentation of additional related tools). Such tools have also been harnessed for model-checking efforts that consider temporal-logic model checking [14][15][16][17].…”

Section: Underapproximating Integer Programsmentioning

confidence: 99%

Advances in verification presented in TACAS’13

Piterman

2017

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Computers are becoming increasingly ubiquitous in all aspects of our life. It is becoming more and more important to ensure that the software (and hardware) that drives them performs as expected. Verification is one approach to improve quality of software and hardware. Verification attempts to formally prove that programs or systems fulfill desired properties and lack undesirable properties. This is a thriving area of research, and much resources are invested in extending it both in academia and in industry. In this special issue, we introduce four papers on verification selected from the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'13).

show abstract

“…In this work, we investigate the problem of verifying heap-manipulating programs in the framework of SMT. We reduce this problem to solving verification conditions representing precise program semantics [44,10,9,22].…”

Section: Introductionmentioning

confidence: 99%

Satisfiability Modulo Heap-Based Programs

Sun

Chin

2016

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. In this work, we present a semi-decision procedure for a fragment of separation logic with user-defined predicates and Presburger arithmetic. To check the satisfiability of a formula, our procedure iteratively unfolds the formula and examines the derived disjuncts. In each iteration, it searches for a proof of either satisfiability or unsatisfiability. Our procedure is further enhanced with automatically inferred invariants as well as detection of cyclic proof. We also identify a syntactically restricted fragment of the logic for which our procedure is terminating and thus complete. This decidable fragment is relatively expressive as it can capture a range of sophisticated data structures with non-trivial pure properties, such as size, sortedness and near-balanced. We have implemented the proposed solver and a new system for verifying heap-based programs. We have evaluated our system on benchmark programs from a software verification competition.

show abstract

Horn Clause Solvers for Program Verification

Cited by 187 publications

References 57 publications

Higher-Order Program Verification via HFL Model Checking

Higher-Order Program Verification via HFL Model Checking

Advances in verification presented in TACAS’13

Satisfiability Modulo Heap-Based Programs

Contact Info

Product

Resources

About