skip to main content
10.1145/2786536acmotherconferencesBook PagePublication PagesecoopConference Proceedingsconference-collections
FTfJP '15: Proceedings of the 17th Workshop on Formal Techniques for Java-like Programs
ACM2015 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ECOOP '15: European Conference on Object-Oriented Programming ECOOP 2015 Prague Czech Republic 7 July 2015
ISBN:
978-1-4503-3656-7
Published:
07 July 2015
In-Cooperation:

Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
research-article
A three-valued type system for true positives detection in Java-like languages

Soundness of type systems is an important property to guarantee the absence of certain kinds of runtime errors, that is, no false negatives can occur.

Unfortunately, for well-known theoretical limits, there are many programs that cannot be typed ...

research-article
Imperative objects with dependent types

Index refinements (or dependent types over a restricted domain) enable the expression of many desirable invariants that can be verified at compile time. We propose to incorporate a system of index refinements in a small, class-based, imperative, object-...

research-article
Fᴏᴏ: a minimal modern OO calculus

We present the Flyweight Object-Oriented (Fᴏᴏ) calculus for the modeling of object-oriented languages. Fᴏᴏ is a simple, minimal class-based calculus, modeling only essential computational aspects and emphasizing larger-scale features (e.g., inheritance ...

research-article
Automatic verification of Dafny programs with traits

This paper describes the design of traits, abstract superclasses, in the verification-aware programming language Dafny. Although there is no inheritance among classes in Dafny, the traits make it possible to describe behavior common to several classes ...

research-article
Conditional effects in fine-grained region logic

Specification languages have long featured ways to describe what does not change when an imperative procedure is executed: the so-called frame problem. Solutions to the frame problem are needed for formal verification in imperative programming, as ...

research-article
Regression verification for Java using a secure information flow calculus

Regression verification and checking for illicit information flow in programs are probably the two most prominent instances of so-called relational program reasoning. Regression verification is concerned with proving that two programs behave either ...

research-article
Provably live exception handling

Writing concurrent Java programs that provably terminate, i.e. that terminate in all executions allowed by the language specification, is difficult, because of the combination of two language "features": firstly, the virtual machine is allowed to throw ...

research-article
Run-time assertion checking of JML annotations in multithreaded applications with e-OpenJML

Run-time assertion checking of multithreaded programs is challenging, as assertion evaluation should not interfere with the execution of other threads. This paper describes the prototype implementation of a run-time assertion checker that achieves this ...

Contributors
  • Maynooth University
Index terms have been assigned to the content through auto-classification.

Recommendations

Acceptance Rates

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