Verifying higher-order programs with the dijkstra monad

SwamyNikhil,; WeinbergerJoel,; SchlesingerCole,; ChenJuan,; LivshitsBenjamin,

doi:10.1145/2499370.2491978

Cited by 47 publications

(68 citation statements)

References 48 publications

(36 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hoare reasoning through dependent types Related systems that employ Hoare-style specification via types are HTT [30] and F * [44]. HTT is a direct precursor of HTTcc, but does not include the control operators.…”

Section: Discussion and Related Workmentioning

confidence: 99%

Hoare-style reasoning with (algebraic) continuations

Delbianco

Nanevski

2013

SIGPLAN Not.

View full text Add to dashboard Cite

Continuations are programming abstractions that allow for manipulating the "future" of a computation. Amongst their many applications, they enable implementing unstructured program flow through higher-order control operators such as callcc. In this paper we develop a Hoare-style logic for the verification of programs with higher-order control, in the presence of dynamic state. This is done by designing a dependent type theory with first class callcc and abort operators, where pre-and postconditions of programs are tracked through types. Our operators are algebraic in the sense of Plotkin and Power, and Jaskelioff, to reduce the annotation burden and enable verification by symbolic evaluation. We illustrate working with the logic by verifying a number of characteristic examples.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Hoare-style reasoning with (algebraic) continuations

Delbianco

Nanevski

2013

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…In [30] the 'Dijkstra' monad is introduced, as a variant of the 'Hoare' monad from [27]. It captures weakest precondition computations for the state monad X → (S × X) S , where S is a fixed collection of states (the heap).…”

Section: Dijkstra Monad Examplesmentioning

confidence: 99%

“…For the powerset monad P, a first version of the Dijkstra monad, following the description in [30], yields D P : Sets → Sets defined as:…”

Section: Dijkstra Monad Examplesmentioning

confidence: 99%

“…So-called Hoare monads [27,31] and Dijkstra monads [30] have been defined in a systematic approach to program verification. Via these monads one describes not only a program but also the associated correctness assertions.…”

Section: Introductionmentioning

confidence: 99%

“…Here we do so not only for the Dijkstra monad (like in [16]), but also for the Hoare monad. We generalise the original definition from [30,27,31] and show that 'Dijkstra' and 'Hoare' monads D T and H T can be associated with various well-known monads T that are used for modeling computations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dijkstra and Hoare monads in monadic computation

Jacobs

2015

Theoretical Computer Science

View full text Add to dashboard Cite

The Dijkstra and Hoare monads have been introduced recently for capturing weakest precondition computations and computations with pre-and post-conditions, within the context of program verification, supported by a theorem prover. Here we give a more general description of such monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and predicate transformers. Instantiating this triangle for different computational monads T shows how to define the Dijkstra monad associated with T , via the logic involved.Subsequently we give abstract definitions of the Dijkstra and Hoare monad, parametrised by a computational monad. These definitions presuppose a suitable (categorical) predicate logic, defined on the Kleisli category of the underlying monad. When all this structure exists, we show that there are maps of monads (Hoare) ⇒ (State) ⇒ (Dijkstra), all parametrised by a monad T .

show abstract

Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms

Martínez

Ahman

Dumitrescu³

et al. 2019

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

We introduce Meta-F , a tactics and metaprogramming framework for the F program verifier. The main novelty of Meta-F is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-behaved SMT fragments. Plus, Meta-F can be used to generate verified code automatically. Meta-F is implemented as an F effect, which, given the powerful effect system of F , heavily increases code reuse and even enables the lightweight verification of metaprograms. Metaprograms can be either interpreted, or compiled to efficient native code that can be dynamically loaded into the F type-checker and can interoperate with interpreted code. Evaluation on realistic case studies shows that Meta-F provides substantial gains in proof development, efficiency, and robustness.

show abstract

Verifying higher-order programs with the dijkstra monad

Cited by 47 publications

References 48 publications

Hoare-style reasoning with (algebraic) continuations

Hoare-style reasoning with (algebraic) continuations

Dijkstra and Hoare monads in monadic computation

Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms

Contact Info

Product

Resources

About