Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2009
Modelling Java requires state
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 10, Pages 1–3https://doi.org/10.1145/1557898.1557908Interesting questions concerning Java-like languages are often studied in the context of smaller programming calculi such as Featherweight Java. The simplicity of the syntax, and small number of features, and in particular the lack of state, make it ...
- research-articleJuly 2009
A mechanism for flexible dynamic trait replacement
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 9, Pages 1–7https://doi.org/10.1145/1557898.1557907Dynamic trait replacement is a programming language feature for changing the objects' behavior at runtime by replacing some of the objects' methods. In previous work on dynamic trait replacement for JAVA-like languages, the object's methods that may be ...
- research-articleJuly 2009
On the interplay between the semantics of Java's finally clauses and the JML run-time checker
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 8, Pages 1–6https://doi.org/10.1145/1557898.1557906This paper discusses how a subtle interaction between the semantics of Java and the implementation of the JML runtime checker can cause the latter to fail to report errors. This problem is due to the well-known capability of finally clauses to ...
- research-articleJuly 2009
CPA beats ∞-CFA
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 7, Pages 1–6https://doi.org/10.1145/1557898.1557905Context-sensitive points-to analysis is the current most scalable technology for constructing a precise control-flow graph for large object-oriented programs. One appealing feature of this framework is that it is parametric thus allowing to trade time ...
- research-articleJuly 2009
Preliminary design of a unified JML representation and software infrastructure
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 5, Pages 1–7https://doi.org/10.1145/1557898.1557903As a Behavioral Interface Specification Language (BISL) for Java, the Java Modeling Language (JML) is tightly coupled to the base language it enhances. Up until Java 1.4, JML kept apace with the evolution of its base language. Java 5 and subsequent ...
- research-articleJuly 2009
On subtyping, wildcards, and existential types
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 4, Pages 1–7https://doi.org/10.1145/1557898.1557902Wildcards are an often confusing part of the Java type system: the behaviour of wildcard types is not fully specified by subtyping, due to wildcard capture, and the rules for type checking are often misunderstood. Their very formulation seems somehow '...
- research-articleJuly 2009
Semantic predicate types and approximation for class-based object oriented programming
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 3, Pages 1–7https://doi.org/10.1145/1557898.1557901We apply the principles of the intersection type discipline to the study of class-based object oriented programs and; our work follows from a similar approach (in the context of Abadi and Cardelli's ς-object calculus) taken by van Bakel and de'Liguoro. ...
- research-articleJuly 2009
Range parameterized types: use-site variance without the existential questions
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 2, Pages 1–6https://doi.org/10.1145/1557898.1557900Use-site variance approaches such as Java wildcards allows to flexibly derive many co- and contravariant types from one generic class definition. Safety is achieved by restricting the access to members of the parameterized types, but the definition of ...
- research-articleJuly 2009
A typed intermediate language for supporting interfaces
FTfJP '09: Proceedings of the 11th International Workshop on Formal Techniques for Java-like ProgramsArticle No.: 1, Pages 1–6https://doi.org/10.1145/1557898.1557899Object-oriented languages such as Java and C# provide interfaces to support a restricted form of multiple inheritance. Existing low-level typed intermediate languages for object-oriented languages, however, either do not support interfaces or require ...