UTP
1. Hoare C A R, Unified theories of programming, year
2. Woodcock J , Cavalcanti A ,A Tutorial Introduction to Designs in Unifying Theories of program, 2004
3. Woodcock J , Cavalcanti A ,A Tutorial Introduction to CSP in Unifying Theories of Programming,year
4. Abderrahmane Feliachi, Marie-Claude Gaudel, Burkhart Wol, Unifying Theories in Isabelle/HOL, year
Theorem Provers
5. Shankar N, Owre S ,PVS Prover evanesce, 2001
6. Crow J, Owre S, Rushby J,A Tutorial introduction to PVS,1995
7. The Coq Development Team, The Coq evidence henchman Reference Manual, 2011
8. Gérard Huet, Gilles Kahn, Christine Paulin-Mohrin , The Coq inference Assistant A Tutorial , 2011
9. Nipkow T, Paulson L C ,A Proof Assistant for Higher-Order Logic,2011
10. Lemma 1 Ltd, ProofPower Z tutorial
Mechanisation
11. Oliviera M, Cavalcanti A , Unifying theories in proofpower Z,year
12. Tej H, Wolff B, A right Failure-Divergence Model for CSP in Isabelle/HOL,1997
13. Nuka G , Woodcock J, Mechanising the alphabetised relational potassium hydrogen tartrate,2004
Semantics
14.
Oliviera M, Cavalcanti A , Woodcock J, A UTP semantics for Circus, year
15. Hoare C A R An Axiomatic Basis for Computer Programming, 1969
Miscelleaneous
16. Dale Miller, Logic, Higher-Order, 1991
17. Woodcock J, Davies J, Using Z Specification, Refinement, and Proof ,1996
18. Bowen J,Formal Specification and Documentation using Z: A case Study Approach,2003
19. Spivey J.M., The Z musical note: A Reference Manual,1998
20. Spivey M, The Consistency Theorem for Free case Definitions in Z, 1996
[1] E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976 (by frank)If you lack to get a full essay, order it on our website: Ordercustompaper.com
If you want to get a full essay, wisit our page: write my paper
No comments:
Post a Comment