Ynot, dependent types for imperative programs. We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. Coq already includes a powerful functional language that supports dependent types, but that language is limited to pure, total functions. The key contribution of our extension, which we call Ynot, is the added support for computations that may have effects such as non-termination, accessing a mutable store, and throwing/catching exceptions.The axioms of Ynot form a small trusted computing base which has been formally justified in our previous work on Hoare Type Theory (HTT). We show how these axioms can be combined with the powerful type and abstraction mechanisms of Coq to build higher-level reasoning mechanisms which in turn can be used to build realistic, verified software components. To substantiate this claim, we describe here a representative series of modules that implement imperative finite maps, including support for a higher-order (effectful) iterator. The implementations range from simple (e.g., association lists) to complex (e.g., hash tables) but share a common interface which abstracts the implementation details and ensures that the modules properly implement the finite map abstraction.

References in zbMATH (referenced in 23 articles , 1 standard article )

Showing results 1 to 20 of 23.
Sorted by year (citations)

1 2 next

  1. Jacobs, Bart: Dijkstra and Hoare monads in monadic computation (2015)
  2. Barthe, Gilles; Fournet, Cédric; Grégoire, Benjamin; Strub, Pierre-Yves; Swamy, Nikhil; Zanella-Béguelin, Santiago: Probabilistic relational verification for cryptographic implementations (2014)
  3. Casinghino, Chris; Sjöberg, Vilhelm; Weirich, Stephanie: Combining proofs and programs in a dependently typed language (2014)
  4. Armstrong, Alasdair; Struth, Georg; Weber, Tjark: Program analysis and verification based on Kleene algebra in Isabelle/HOL (2013)
  5. Benton, Nick: The proof assistant as an integrated development environment (2013)
  6. Brady, Edwin: Programming and reasoning with algebraic effects and dependent types (2013)
  7. Charlton, Nathaniel; Reus, Bernhard: Specification patterns for reasoning about recursion through the store (2013)
  8. Li, Zhao-Peng; Zhang, Yu; Chen, Yi-Yun: A shape graph logic and a shape system (2013)
  9. Crolard, T.; Polonowski, E.: Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (2012)
  10. Thamsborg, Jacob; Birkedal, Lars; Yang, Hongseok: Two for the price of one: lifting separation logic assertions (2012)
  11. Gibbons, Jeremy; Hinze, Ralf: Just do it: simple monadic equational reasoning (2011)
  12. Liu, Yu David; Skalka, Christian; Smith, Scott F.: Type-specialized staged programming with process separation (2011)
  13. Malecha, Gregory; Morrisett, Greg; Wisnesky, Ryan: Trace-based verification of imperative programs with I/O (2011)
  14. Schwinghammer, Jan; Birkedal, Lars; Reus, Bernhard; Yang, Hongseok: Nested Hoare triples and frame rules for higher-order store (2011)
  15. Brady, Edwin; Hammond, Kevin: Correct-by-construction concurrency: using dependent types to verify implementations of effectful resource usage protocols (2010)
  16. Malecha, Gregory; Morrisett, Greg; Shinnar, Avraham; Wisnesky, Ryan: Toward a verified relational database management system (2010)
  17. Morgenstern, Jamie; Licata, Daniel R.: Security-typed programming within dependently typed programming (2010)
  18. Nanevski, Aleksandar; Vafeiadis, Viktor; Berdine, Josh: Structuring the verification of heap-manipulating programs (2010)
  19. Boudol, Gérard: A deadlock-free semantics for shared memory concurrency (2009)
  20. Chlipala, Adam; Malecha, Gregory; Morrisett, Greg; Shinnar, Avraham; Wisnesky, Ryan: Effective interactive proofs for higher-order imperative programs (2009)

1 2 next