A uniform and certified approach for two static analyses

Authors:
Solange Coupet-Grimal;William Delobel
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille (UMR 6166), CMI-Université de Provence, Marseille, France;Laboratoire d'Informatique Fondamentale de Marseille (UMR 6166), CMI-Université de Provence, Marseille, France
Venue:
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Year:
2004

Citing 9
Cited 3

A specification of Java loading and bytecode verification

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Formal Correspondence between Offensive and Defensive JavaCard Virtual Machines

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Verified Bytecode Verifiers

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
A Formal Executable Semantics of the JavaCard Platform

ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Verified bytecode verifiers

Theoretical Computer Science - Foundations of software science and computation structures
Java Bytecode Verification: Algorithms and Formalizations

Journal of Automated Reasoning
Extracting a data flow analyser in constructive logic

Theoretical Computer Science - Applied semantics: Selected topics
A structured approach to proving compiler optimizations based on dataflow analysis

TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs

Building Certified Static Analysers by Modular Construction of Well-founded Lattices

Electronic Notes in Theoretical Computer Science (ENTCS)
A Formally Verified Compiler Back-end

Journal of Automated Reasoning
Verifying a local generic solver in coq

SAS'10 Proceedings of the 17th international conference on Static analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a formal model for a first order functional language to be executed on a stack machine and for a bytecode verifier that performs two kinds of static verifications : a type analysis and a shape analysis, that are part of a system used to ensure resource bounds. Both are instances of a general data flow analyzer due to Kildall. The generic algorithm and both of its instances are certified with the Coq proof assistant.