Verification of Abstract state Machines
暂无分享,去创建一个
[1] Egon Börger,et al. Abstract State Machines 1988-1998: Commented ASM Bibliography , 1998, Bull. EATCS.
[2] I. V. Ramakrishnan,et al. Term Indexing , 1995, Lecture Notes in Computer Science.
[3] Egon Börger,et al. A Practical Method for Rigorously Controllable Hardware Design , 1997, ZUM.
[4] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .
[5] Andrew S. Tanenbaum,et al. Using Peephole Optimization on Intermediate Code , 1982, TOPL.
[6] Donald E. Knuth,et al. fundamental algorithms , 1969 .
[7] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[8] Kurt Stenzel,et al. Structured Specifications and Interactive Proofs with KIV , 1998 .
[9] Egon Brger,et al. Modelling and Analysis of Distributed and Reactive Systems using Evolving Algebras , 1995 .
[10] Egon Börger,et al. Correctness of Compiling Occam to Transputer Code , 1996, Comput. J..
[11] Jeffrey S. Moore. Piton: a verified assembly level language , 1988 .
[12] Arno Schonegge,et al. Extending Dynamic Logic for Reasoning about Evolving Algebras , 1995 .
[13] Yuri Gurevich,et al. The Semantics of the C Programming Language , 1992, CSL.
[14] D. Stott Parker,et al. Towards computer-verified proofs of correctness of logic-programming interpreters using derivations , 1997 .
[15] Peter H. Schmitt. Proving WAM compiler correctness , 1994 .
[16] Wolf Zimmermann,et al. On the Construction of Correct Compiler Back-Ends: An ASM-Approach , 1997, J. Univers. Comput. Sci..
[17] Axel Dold,et al. Formal Verification of Transformations for Peephole Optimization , 1997, FME.
[18] Robert S. Boyer,et al. A verified code generator for a subset of gypsy , 1988 .
[19] Egon Börger,et al. The WAM - Definition and Compiler Correctness , 1995, Logic Programming: Formal Methods and Practical Applications.
[20] M. Gordon. HOL: A Proof Generating System for Higher-Order Logic , 1988 .
[21] Robert Goldblatt,et al. Axiomatising the Logic of Computer Programming , 1982, Lecture Notes in Computer Science.
[22] Mitchell Wand,et al. VLISP: A verified implementation of Scheme , 1995, LISP Symb. Comput..
[23] Wolfgang Reif,et al. Interactive correctness proofs for software modules using KIV , 1995, COMPASS '95 Proceedings of the Tenth Annual Conference on Computer Assurance Systems Integrity, Software Safety and Process Security'.
[24] Cornelia Pusch,et al. Verification of Compiler Correctness for the WAM , 1996, TPHOLs.
[25] Yuri Gurevich,et al. Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.
[26] Gerard Renardel de Lavalette,et al. A formalization of evolving algebras , 1995 .
[27] Wolfgang Ahrendt,et al. Reasoning about Abstract State Machines: The WAM Case Study , 1997, J. Univers. Comput. Sci..
[28] David M. Russinoff. A Verified Prolog Compiler for the Warren Abstract Machine , 1992, J. Log. Program..
[29] Jeffrey J. Joyce,et al. Totally Verified Systems: Linking Verified Software to Verified Hardware , 1989, Hardware Specification, Verification and Synthesis.
[30] Hassan Aït-Kaci,et al. Warren's Abstract Machine: A Tutorial Reconstruction , 1991 .
[31] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[32] Yuri Gurevich,et al. Recursive Abstract State Machines , 2017, J. Univers. Comput. Sci..
[33] Wolfgang Ahrendt,et al. The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV , 1998 .
[34] Cliff B. Jones,et al. Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.
[35] Martin Wirsing,et al. Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[36] E. Allen Emerson,et al. Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[37] Egon Börger,et al. A Mathematical Definition of Full Prolog , 1995, Sci. Comput. Program..
[38] Egon Börger,et al. A Programmer Friendly Modular Definition of the Semantics of Java , 1999, Formal Syntax and Semantics of Java.
[39] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.
[40] Egon Börger,et al. The bakery algorithm: yet another specification and verification , 1993, Specification and validation methods.
[41] C. A. R. Hoare,et al. Proof of correctness of data representation , 1975, Language Hierarchies and Interfaces.
[42] Gerard R. Renardel de Lavalette,et al. Reasoning About Dynamic Features in Specification Languages - A Modal View on Creation and Modification , 1993, Semantics of Specification Languages.
[43] Martín Abadi,et al. The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[44] David Cyrluk,et al. Microprocessor Verification in PVS - A Methodology and Simple Example , 1993 .
[45] Wolfgang Reif,et al. The KIV-Approach to Software Verification , 1995, KORSO Book.