The Verifying Compiler: A Grand Challenge for Computing Research

Hoare, Tony

doi:10.1007/3-540-36579-6_19

Cited by 13 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We would like to stress that this problem is a benchmark, as opposed to a grand challenge (Hoare, 2003), with the aim of providing a common ground for comparison between current proof assistants while pushing the baseline further than the original POPLMark challenge. We consider this problem as a first step in evaluating the capabilities of different proof assistants for mechanizing proofs by LRs; there is certainly potential for follow-up problems to be formulated by which to emphasize other categories of LRs proofs and related issues.…”

Section: Motivationmentioning

confidence: 99%

POPLMark reloaded: Mechanizing proofs by logical relations

et al. 2019

View full text Add to dashboard Cite

We propose a new collection of benchmark problems in mechanizing the metatheory of programming languages, in order to compare and push the state of the art of proof assistants. In particular, we focus on proofs using logical relations (LRs) and propose establishing strong normalization of a simply typed calculus with a proof by Kripke-style LRs as a benchmark. We give a modern view of this well-understood problem by formulating our LR on well-typed terms. Using this case study, we share some of the lessons learned tackling this problem in different dependently typed proof environments. In particular, we consider the mechanization in Beluga, a proof environment that supports higher-order abstract syntax encodings and contrast it to the development and strategies used in general-purpose proof assistants such as Coq and Agda. The goal of this paper is to engage the community in discussions on what support in proof environments is needed to truly bring mechanized metatheory to the masses and engage said community in the crafting of future benchmarks.

show abstract

Section: Motivationmentioning

confidence: 99%

POPLMark reloaded: Mechanizing proofs by logical relations

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Hátrány viszont, hogy a bizonyítási eljárás során felderített programhibák javítása megváltoztatja a programot, így a bizonyítás egyes részeit vagy egészét elölről kell kezdeni. A verifikációs módszerről szól a Hoare által 2003-ban meghirdetett "Nagy kihívás" [50], amely egy verifikációra képes fordítóprogram megalkotását tűzte ki célul. A kategória egyik klasszikus eszköze a Spark [10], amely az Ada nyelv egy részhalmazával dolgozik.…”

Section: Kapcsolódó Munkák 1formális Szoftverfejlesztésunclassified

Programhelyesség- bizonyítás fordítási időben

Dévai¹

2017

View full text Add to dashboard Cite

show abstract

“…The idea of verifying that a program meets a given specification for all possible inputs has been studied for a long time. According to Hoare's vision, a verifying compiler "uses automated mathematical and logical reasoning to check the correctness of the programs that it compiles" [15]. A variety of tools have blossomed in this space, including ESC/Java [14], Spec# [4], Dafny [18], Why3 [13], VeriFast [16], SPARK Ada [20], and Whiley [26,30].…”

Section: Introductionmentioning

confidence: 99%

Making Whiley Boogie!

Utting

Pearce

Groves

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The quest to develop increasingly sophisticated verification systems continues unabated. Tools such as Dafny, Spec#, ESC/Java, SPARK Ada, and Whiley attempt to seamlessly integrate specification and verification into a programming language, in a similar way to type checking. A common integration approach is to generate verification conditions that are handed off to an automated theorem prover. This provides a nice separation of concerns, and allows different theorem provers to be used interchangeably. However, generating verification conditions is still a difficult undertaking and the use of more "high-level" intermediate verification languages has become common-place. In particular, Boogie provides a widely used and understood intermediate verification language. A common difficulty is the potential for an impedance mismatch between the source language and the intermediate verification language. In this paper, we explore the use of Boogie as an intermediate verification language for verifying programs in Whiley. This is noteworthy because the Whiley language has (amongst other things) a rich type system with considerable potential for an impedance mismatch. We report that, whilst a naive translation to Boogie is unsatisfactory, a more abstract encoding is surprisingly effective.

show abstract

The Verifying Compiler: A Grand Challenge for Computing Research

Cited by 13 publications

References 31 publications

POPLMark reloaded: Mechanizing proofs by logical relations

POPLMark reloaded: Mechanizing proofs by logical relations

Programhelyesség- bizonyítás fordítási időben

Making Whiley Boogie!

Contact Info

Product

Resources

About