Specifying generic Java programs: two case studies

Authors:
Alain Giorgetti;Claude Marché;Elena Tushkanova;Olga Kouchnarenko
Affiliations:
Univ. of Franche-Comté, INRIA Nancy - Grand Est, Villers-lès-Nancy;Univ. Paris-Sud, Orsay;Univ. of Franche-Comté, INRIA Nancy - Grand Est, Villers-lès-Nancy;Univ. of Franche-Comté, INRIA Nancy - Grand Est, Villers-lès-Nancy
Venue:
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Year:
2010

Citing 7
Cited 0

An extension of standard ML modules with subtyping and inheritance

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular verification of higher-order methods with mandatory calls specified by model programs

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Verification of Java Programs with Generics

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Who: a verifier for effectful higher-order programs

Proceedings of the 2009 ACM SIGPLAN workshop on ML
The Why/Krakatoa/Caduceus platform for deductive program verification

CAV'07 Proceedings of the 19th international conference on Computer aided verification
A refinement methodology for object-oriented programs

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Towards modular algebraic specifications for pointer programs: a case study

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work investigates the question of modular specification of generic Java classes and methods. We propose extensions to the Krakatoa Modeling Language, a part of the Why platform for proving that a Java or C program is a correct implementation of some specification. The new constructs we propose for the specification of generic Java programs are presented through two significant examples: the specification of the generic method for sorting arrays which comes from the java.util.Arrays class in the Java API, and the specification of the java.util.HashMap class defining a generic hash map and its use for memoization. The key features are the introduction of parametricity both for types and for theories and an instantiation relation between theories. We discuss soundness conditions and their verification.