Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

AMAST
2004
Springer

favoriteEmaildiscussreport

138views Software Engineering» more AMAST 2004»

A Formally Verified Calculus for Full Java Card

14 years 2 months ago

A Formally Verified Calculus for Full Java Card

Download www.informatik.uni-augsburg.de

We present a calculus for the verification of sequential Java programs. It supports all Java language constructs and has additional support for Java Card. The calculus is formally proved correct with respect to a natural semantics. It is implemented in the KIV system and used for smart card applications.

Kurt Stenzel

Real-time Traffic

AMAST 2004 | Java Language Constructs | Sequential Java Programs | Smart Card Applications | Software Engineering |

claim paper

Related Content

» A JMMFaithful Noninterference Calculus for Java

» Formal Development of an Embedded Verifier for Java Card Byte Code

» Formal Proof of Smart Card Applets Correctness

» Formal Specification and Verification of JavaCards Application Identifier Class

» cardTAP Automated Deduction on a Smart Card

» Provably correct Java implementations of Spi Calculus security protocols specifications

» A Hoare Calculus for Verifying Java Realizations of OCLConstrained Design Models

» System Description card TAP The First Theorem Prover on a Smart Card

» Verifying the Mondex Case Study

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	AMAST
Authors	Kurt Stenzel

Comments (0)