skip to main content
10.1145/1924520acmotherconferencesBook PagePublication PagesecoopConference Proceedingsconference-collections
FTFJP '10: Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
ACM2010 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ECOOP '10: European Conference on Object-Oriented Programming Maribor Slovenia 22 June 2010
ISBN:
978-1-4503-0540-2
Published:
22 June 2010
Sponsors:
CEKTRA, University of Maribor, AITO
In-Cooperation:

Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
research-article
Complete coinductive subtyping for abstract compilation of object-oriented languages

Coinductive abstract compilation is a novel technique, which has been recently introduced, for defining precise type systems for object-oriented languages. In this approach, type inference consists in translating the program to be analyzed into a Horn ...

research-article
Towards a semantic model for Java wildcards

Wildcard types enrich the types expressible in Java, and extend the set of typeable Java programs. Syntactic models and proofs of soundness for type systems related to Java wildcards have been suggested in the past, however, the semantics of wildcards ...

research-article
Strong exception-safety for Java-like languages

"Exception-safety strong guarantee: The operation has either completed successfully or thrown an exception, leaving the program state exactly as it was before the operation started." David Abrahams [1] The above definition of strong exception-safety ...

research-article
Modular verification of linked lists with views via separation logic

We present a separation logic specification and verification of linked lists with views, a data structure from the C5 collection library for C#. A view is a generalization of the well-known concept of an iterator. Linked lists with views form an ...

research-article
Procedure-modular verification of control flow safety properties

This paper describes a novel technique for fully automated procedure-modular verification of Java programs equipped with method-local and global assertions that specify safety properties of sequences of method invocations. Modularity of verification is ...

research-article
Prototyping a tool environment for run-time assertion checking in JML with communication histories

In this paper we present prototype tool-support for the runtime assertion checking of the Java Modeling Language (JML) extended with communication histories specified by attribute grammars. Our tool suite integrates Rascal, a meta programming language ...

research-article
Aliasing control with view-based typestate

Tracking the state of an object (in the sense of how a File can be in an Open or Closed state) is difficult not just because of the problem of managing state transitions but also due to the complexity introduced by aliasing. Unchecked duplication of ...

extended-abstract
Refactoring and representation independence for class hierarchies: extended abstract

Refactoring transformations are important for productivity and quality in software evolution. Modular reasoning about semantics preserving transformations is difficult even in typed class-based languages because transformations can change the internal ...

research-article
A theory of typestate-oriented programming

Engineers in many disciplines use state machines to reason about system changes, and many object-oriented libraries require their clients to follow state machine protocols. No existing language, however, has native support for state machines, and ...

Recommendations

Acceptance Rates

Overall Acceptance Rate51of75submissions,68%
YearSubmittedAcceptedRate
FTFJP'17121083%
FTfJP'16121083%
FTfJP '1514964%
FTfJP'148563%
FTfJP '1314750%
FTfJP '09151067%
Overall755168%