D. Basin, S. Friedrich, and M. Gawkowski. Verified bytecode model checkers. In Theorem Proving in Higher Order Logics (TPHOLs'02), volume 2410 of Lect. Notes in Comp. Sci., pages 47--66, Virginia, USA, August 2002. Springer. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Hoare Logic for Monitors in Java - Abraham, de Boer, de Roever, Steffen (Correct)
....an axiomatic semantics for object oriented languages in a weakest liberal precondition style are [15] and [26] 37, 36] use (a modification of) the object constraint language OCL as assertional language to annotate UML class diagrams and to generate proof conditions for Java programs. The work [12] presents a model checking algorithm and its implementation in Isabelle HOL to check type correctness of Java bytecode. The work [41] formalizes a large subset of JavaCard, including exception handling, in Isabelle HOL, and its soundness and completeness is shown within the theorem prover. The ....
D. Basin, S. Friedrich, and M. Gawkowski. Verified bytecode model checkers. In V. A. Carreno, C. A. Munoz, and S. Tahar, editors, Theorem Proving in Higher Order Logics (TPHOLs'02), pages 47--66, August 2002.
Bytecode Verification by Model Checking - Basin, Friedrich, Gawkowski (2003) (1 citation) Self-citation (Basin Friedrich Gawkowski) (Correct)
No context found.
Basin, D., S. Friedrich, and M. Gawkowski: 2002a, `Verified Bytecode Model Checkers'. In: V. A. Carreno, C. A. Munoz, and S. Tahar (eds.): Theorem Proving in Higher Order Logics (TPHOLs'02), Vol. 2410 of LNCS. pp. 47--66.
Verified Bytecode Subroutines - Klein, Wildmoser (2003) (5 citations) (Correct)
No context found.
D. Basin, S. Friedrich, and M. Gawkowski. Verified bytecode model checkers. In Theorem Proving in Higher Order Logics (TPHOLs'02), volume 2410 of Lect. Notes in Comp. Sci., pages 47--66, Virginia, USA, August 2002. Springer.
Verified Bytecode Verification and Type-Certifying Compilation - Klein, Strecker (2003) (1 citation) (Correct)
No context found.
David Basin, Stefan Friedrich, and Marek Gawkowski. Verified bytecode model checkers. In Theorem Proving in Higher Order Logics (TPHOLs'02), volume 2410 of Lecture Notes in Computer Science, pages 47--66, Virginia, USA, August 2002. Springer-Verlag.
Verified Bytecode Subroutines - Klein, Wildmoser (2003) (5 citations) (Correct)
No context found.
Basin, D., S. Friedrich, and M. Gawkowski: 2002, `Verified Bytecode Model Checkers'. In: Theorem Proving in Higher Order Logics (TPHOLs'02), Vol. 2410 of Lect. Notes in Comp. Sci. Virginia, USA, pp. 47--66.
Trail-directed Java Program Verification - Mehler, Edelkamp (Correct)
No context found.
D. Basin, S. Friedrich, and M. Gawkowski. Verified Bytecode Model Checkers. In Theorem Proving in Higher Order Logics (TPHOLs), pages 47--66. SpringerVerlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC