A Monad-Based Modeling and Verification Toolbox with Application to Security Protocols
Authors:
- 22 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 302-318
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Axiomatic Constructor Classes in Isabelle/HOLCFLecture Notes in Computer Science, 2005
- Simple relational correctness proofs for static analyses and program transformations2004
- Weakest pre-condition reasoning for Java programs with JML annotationsThe Journal of Logic and Algebraic Programming, 2004
- Coalgebras and monads in the semantics of JavaTheoretical Computer Science, 2003
- Verifying BDD Algorithms through Monadic Interpretation2002
- Java Program Verification via a Hoare Logic with Abrupt TerminationLecture Notes in Computer Science, 2000
- Proof of Imperative Programs in Type TheoryLecture Notes in Computer Science, 1999
- A HOL formalisation of the Temporal Logic of ActionsLecture Notes in Computer Science, 1994
- Notions of computation and monadsInformation and Computation, 1991
- Completing the temporal pictureTheoretical Computer Science, 1991