Extracting a data flow analyser in constructive logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2986, Issue , 2004, Pages 385-400

  Cacheral, David ^a   Jensen, Thomas ^a   Pichardie, David ^a   Rusu, Vlad ^a,b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; MODULAR CONSTRUCTION; SEMANTICS; SPECIFICATION LANGUAGES; THEOREM PROVING;

CONSTRAINT RESOLUTIONS; CONSTRUCTIVE LOGIC; COQ PROOF ASSISTANT; CORRECTNESS PROOFS; EXTRACTION MECHANISMS; GENERIC FRAMEWORKS; INTERMEDIATE REPRESENTATIONS; OPERATIONAL SEMANTICS;

DATA FLOW ANALYSIS;

EID: 35048859291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (17)

1. [BDHdS0l] Gilles Barthe, Guillaume Dufay, Marieke Huisman, and Simão Melo de Sousa. Jakarta: A Toolset for Reasoning about JavaCard. Lecture Notes in Computer Science, 2140, 2001.
2. [BDJ+01] Gilles Barthe, Guillaume Dufay, Line Jakubiec, Bernard Serpette, and Simão Melo de Sousa. A Formal Executable Semantics of the JavaCard Platform. Lecture Notes in Computer Science, 2028, 2001.
3. [Ber0l] Yves Bertot. Formalizing a JVML Verifier for Initialization in a Theorem Prover. Lecture Notes in Computer Science, 2102, 2001.
4. [CBR02] Ludovic Casset, Lilian Burdy, and Antoine Requet. Formal Development of an embedded verifier for Java Card Byte Code. In Proc. of IEEE Int. Conference on Dependable Systems & Networks (DSN), 2002.
5. [CC77] Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints. In Proc. of 4th ACM Symposium on Principles of Programming Languages, pages 238-252. ACM Press, New York, 1977.
6. [CGQ98] Alessandro Coglio, Allen Goldberg, and Zhenyu Qian. Towards a Provably-Correct Implementation of the JVM Bytecode Verifier. In Proc. OOPSLA '98 Workshop on Formal Underpinnings of Java, 1998.
7. [Den0l] Ewen Denney. The synthesis of a Java Card tokenisation algorithm. In Proc. of 16th Int. Conf. on Automated Software Engineering (ASE 2001), pages 43-50. IEEE Press, 2001.
8. [GJKP03] Thomas Genet, Thomas Jensen, Vikash Kodati, and David Pichardie. A Java Card CAP converter in PVS. In Proc. of 2nd International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2003), 2003.
9. [Han02] René Rydhof Hansen. Flow Logic for Carmel. Technical Report SECSAFE-IMM-001, Danish Technical University, 2002.
10. [KN02] Gerwin Klein and Tobias Nipkow. Verified Bytecode Verifiers. Theoretical Computer Science, 298(3):583-626, 2002.
11. [LMC03] Sorin Lerner, Todd Millstein, and Craig Chambers. Automatically proving the correctness of compiler optimizations. In Proc. of the ACM SICPLAN 2003 conference on Programming language design and implementation, pages 220-231. ACM Press, 2003.
12. [Mar0l] Renaud Marlet. Syntax of the JCVM language to be studied in the SecSafe project. Technical Report SECSAFE-TL-005, Trusted Logic SA, May 2001.
13. [Mon98] David Monniaux. Réalisation mécanisée d'interpréteurs abstraits. Rapport de DEA, Université Paris VII, 1998. In French.
14. [NN98] Hanne Riis Nielson and Flemming Nielson. Flow Logics for Constraint Based Analysis. In Proc. CC'98, number 1383 in Lecture Notes in Computer Science, pages 109-127. Springer-Verlag, 1998.
15. [OG98] Chris Okasaki and Andrew Gill. Fast mergeable integer maps. In Workshop on ML, pages 77-86, 1998.
16. [Pro99] Frédéric Prost. Interprétation de l'analyse statique en théorie des types. PhD thesis, École normale supérieure de Lyon, 1999. In French.
17. [Siv04] Igor Siveroni. Operational semantics of the Java Card Virtual Machine. J. Logic and Automated Reasoning, 2004. To appear.