A Formal Executable Semantics of the JavaCard Platform

Barthe, Gilles; Dufay, Guillaume; Jakubiec, Line; Serpette, Bernard; Sousa, Simão Melo de

doi:10.1007/3-540-45309-1_20

Cited by 41 publications

(28 citation statements)

References 18 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such inversion lemmas are of great help in reasoning about executable semantics (most clauses in such semantics yield to error states, see e.g. [3], and the inversion principle allows users to deal directly with states which do not go wrong). Due to space constraints, we do not discuss inversion principles further.…”

Section: A Critical Review Of Existing Methodsmentioning

confidence: 99%

Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant

Barthe

Forest

Pichardie

et al. 2006

Functional and Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the intended function as an inductive relation. Then it proves that the relation actually represents a function, which is by construction the function that we are trying to define. Then, we generate induction and inversion principles, and a fixpoint equation for proving other properties of the function. Our tool builds upon stateof-the-art techniques for defining recursive functions, and can also be used to generate executable functions from inductive descriptions of their graph. We illustrate the benefits of our tool on two case studies.

show abstract

Section: A Critical Review Of Existing Methodsmentioning

confidence: 99%

Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant

Barthe

Forest

Pichardie

et al. 2006

Functional and Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Earlier work on Java Cards was mainly related to the semantic and formal modelling of the JCVM [?, 84,201,202], Java Card rewall mechanism [191,203], and applets [204] [206]. The assurance for the JCRE reliability against ill-formed applications was based on bytecode veri cation [128,161] [163], which became a compulsory part of the Java Card speci cation version 3 [16].…”

Section: Related Workmentioning

confidence: 99%

User Centric Security Model for Tamper-Resistant Devices

Akram

Markantonakis

Mayes

2011

2011 IEEE 8th International Conference on E-Business Engineering

View full text Add to dashboard Cite

“…Mechanical verification of Java analysers have so far mainly dealt with the Java byte code verifier [2,9,4]. The first exception is the work reported in [3] on formalising an interprocedural data flow analyser for Java Card, on which part of the formalisation of the present analysis is based.…”

Section: Related Workmentioning

confidence: 99%

Certified Memory Usage Analysis

Cachera

Jensen

Pichardie

et al. 2005

FM 2005: Formal Methods

View full text Add to dashboard Cite

Abstract. We present a certified algorithm for resource usage analysis, applicable to languages in the style of Java byte code. The algorithm verifies that a program executes in bounded memory. The algorithm is destined to be used in the development process of applets and for enhanced byte code verification on embedded devices. We have therefore aimed at a low-complexity algorithm derived from a loop detection algorithm for control flow graphs. The expression of the algorithm as a constraint-based static analysis of the program over simple lattices provides a link with abstract interpretation that allows to state and prove formally the correctness of the analysis with respect to an operational semantics of the program. The certification is based on an abstract interpretation framework implemented in the Coq proof assistant which has been used to provide a complete formalisation and formal verification of all correctness proofs.

show abstract

A Formal Executable Semantics of the JavaCard Platform

Cited by 41 publications

References 18 publications

Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant

Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant

User Centric Security Model for Tamper-Resistant Devices

Certified Memory Usage Analysis

Contact Info

Product

Resources

About