Verifying higher-order programs with the dijkstra monad

@inproceedings{Swamy2013VerifyingHP,
  title={Verifying higher-order programs with the dijkstra monad},
  author={Nikhil Swamy and Joel Weinberger and Cole Schlesinger and Juan Chen and Benjamin Livshits},
  booktitle={PLDI '13},
  year={2013}
}
Modern programming languages, ranging from Haskell and ML, to JavaScript, C# and Java, all make extensive use of higher-order state. This paper advocates a new verification methodology for higher-order stateful programs, based on a new monad of predicate transformers called the Dijkstra monad. Using the Dijkstra monad has a number of benefits. First, the monad naturally yields a weakest pre-condition calculus. Second, the computed specifications are structurally simpler in several ways, e.g… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

52 Citations

01020'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…