A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
Formal Techniques for Java-Like Programs (FTfJP)
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
This report gives an overview of the sixth Workshop on Formal Techniques for Java-like Programs at ECOOP 2004. ...
It explains the motivation for the a workshop and summarises the presentations and discussions. ...
This workshop aims to bring together those people working on the formal underpinnings of, and those working on the formal techniques and tools for, programming Java-like languages. ...
doi:10.1007/978-3-540-30554-5_8
fatcat:6gvl2ijsdzg55o2ehousppesqu
A Mechanical Soundness Proof for Subtyping Over Recursive Types
2016
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs - FTfJP'16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Towards deductive verification of C11 programs with Event-B and ProB
2019
Proceedings of the 21st Workshop on Formal Techniques for Java-like Programs - FTfJP '19
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper introduces a technique for modelling and verifying weak memory C11 programs in the Event-B framework. ...
In our technique, a concrete C11 program can be modelled by refining this abstract model of the semantics. ...
The authors thank Lindsay Groves for his comments and suggestions. ...
doi:10.1145/3340672.3341117
fatcat:yfikgsio7vbijhcoma6mp2gmx4
Permission and Authority Revisited towards a formalisation
2016
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs - FTfJP'16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose precise definitions for permissions and authority, based on a small object-oriented calculus. ...
Miller's notions of permissions and authority are foundational to the analysis of object-capability programming. Informal definitions of these concepts were given in Miller's thesis. ...
We thank the anonymous referees for their comments. This work is partially supported by a James Cook Fellowship and Royal Society of New Zealand Marsden Fund, and by the EU FP7 project Upscale. ...
doi:10.1145/2955811.2955821
fatcat:rd5t2aqsu5au5nnxsexjbocgja
Partial Solutions to VerifyThis 2016 Challenges 2 and 3 with VeriFast
2016
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs - FTfJP'16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We describe our partial solutions, using our VeriFast separationlogic based tool for modular formal verification of C and Java programs, to Challenges 2 and 3 of the VerifyThis 2016 Verification Competition ...
CCS Concepts •Theory of computation → Program verification; / * @ typedef lemma void get_op(predicate(boolean) inv, predicate() pre, predicate(boolean) post)(); typedef lemma void set_op(predicate(boolean ...
INTRODUCTION VeriFast 1 is a research prototype being developed in our group of a tool for modular formal verification of correctness properties of single-threaded and multithreaded C and Java programs ...
doi:10.1145/2955811.2955818
fatcat:ukytwrmzdrbitfeynysdvcwlcq
An Extended Buffered Memory Model With Full Reorderings
2016
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs - FTfJP'16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This Buffered Memory Model (BMM) targets the Java programming language. It is strictly less relaxed than the Java Memory Model. ...
These models come in different formalization styles (axiomatic, operational) and have their own advantages and disadvantages. ...
9 In our future work we would like to use the reordering model in soundness proofs. We believe we could find elegant proof techniques for the RMO ro model. ...
doi:10.1145/2955811.2955816
fatcat:d62vy6tm2zcoxhs3443qi7a6wa
Specifying I/O using abstract nested hoare triples in separation logic
2019
Proceedings of the 21st Workshop on Formal Techniques for Java-like Programs - FTfJP '19
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We propose a separation logic-based approach for modular specification and verification of the I/O behavior of a program. ...
The approach supports verifying higher-level I/O actions built on top of lower-level ones (e.g. the I/O abstractions offered by the programming language's standard library, implemented on top of system ...
The technical report accompanying this paper [8] offers a formal definition of the syntax and semantics of a programming language with I/O, a formal definition and soundness proof of the proposed logic ...
doi:10.1145/3340672.3341118
fatcat:z44kpf2pirhqbd4d5od4u52o74
Parametric Trace Expressions for Runtime Verification of Java-Like Programs
2017
Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs - FTFJP'17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we show how trace expressions can be used for conveniently specifying the expected behavior of a Java-like program to be monitored at runtime. ...
reasoning about equivalence of trace expressions and for adopting useful optimization techniques to speed up runtime verification. ...
In this paper we provide some examples showing how trace expressions can be suitably employed for specifying the expected behavior of a Java-like program, and for monitoring it at runtime. ...
doi:10.1145/3103111.3104037
dblp:conf/ecoop/AnconaFFM17
fatcat:k3kyd6rqcndolkfmscrh57eada
Modelling Java requires state
2009
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs - FTfJP '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Interesting questions concerning Java-like languages are often studied in the context of smaller programming calculi such as Featherweight Java. ...
Although the programming languages are imperative, Featherweight Java and various similar calculi are functional. ...
Acknowledgements We are extremely grateful to Nicholas Cameron, Mariangiola Dezani and especially Sophia Drossopoulou for encouragement, generous discussions and invaluable input to this paper. ...
doi:10.1145/1557898.1557908
dblp:conf/ecoop/Summers09
fatcat:vactstp4u5e37hrdoita5rfc44
Featherweight X10
2012
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs - FTfJP '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Our calculus forms a convenient basis for type systems and static analyses for languages with async-finish parallelism, and for tractable proofs of correctness. ...
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. ...
We thank Christian Grothoff, Shu-Yu Guo, Riyaz Haque, and the anonymous reviewers for helpful comments on a draft the paper. ...
doi:10.1145/2318202.2318203
dblp:conf/ecoop/Palsberg12
fatcat:nzzybxpvzvcyvfs76ssfz4xrzi
Tinygrace
2014
Proceedings of 16th Workshop on Formal Techniques for Java-like Programs - FTfJP'14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
: Dog → dog } case { person : Person → person.bestFriend } } gracelang.org tim@ecs.vuw.ac.nz Progress
Subject Substitution
Variant Subtraction
Subject Reduction
Type Soundness
Featherweight Java ...
An FJ program has:
A class table
An expression
We also want to replicate:
Constructors
Fields
(Safe) Casts
type Person = { bestFriend → Person }
object {
}.main
type Person = { bestFriend ...
doi:10.1145/2635631.2635848
dblp:conf/ecoop/JonesN14
fatcat:lqbaaei7pze4fjcdrcvjgeduvm
Semi-automatic controller design of Java-like models
2013
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs - FTfJP '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Existing synthesis tools for discrete event systems mainly solve the problem for systems described in low-level formalisms. ...
To provide a high-level environment, our approach is implemented in VeriJ, a Java-like language, and illustrated on a significant example taken from automated transport systems. ...
Users can 1) easily model the system, specification and controller in a Java-like program, 2) use quality-control techniques and tools of mature IDEs, 3) use partial controllability and synthesis as described ...
doi:10.1145/2489804.2489806
dblp:conf/ecoop/ZhangBHT13
fatcat:67sxf467yjbczcn2ucpwg5waru
Foo
2015
Proceedings of the 17th Workshop on Formal Techniques for Java-like Programs - FTfJP '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
• A lemma still holds for substitution of this • Intuitively, lack of a substitution lemma for formals is not a problem • Values are passed/returned by rules T-I/T-M, which accept subtypes • Formally, ...
still captured by rules: T-I "you can use a subtype for formal arguments" T-M "you can use a subtype for method bodies" • Without subsumption, the familiar substitution lemma plays different role in the ...
doi:10.1145/2786536.2786540
dblp:conf/ecoop/GerakiosFS15
fatcat:n3zu4iboabh2hexoghik35cw6m
CPA beats ∞-CFA
2009
Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs - FTfJP '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Context-sensitive points-to analysis is the current most scalable technology for constructing a precise control-flow graph for large object-oriented programs. ...
For a core object-oriented language, we formally compare the precision of ∞-CFA and CPA. We prove that CPA is indeed strictly more precise than ∞-CFA. ...
For Cecil and Java programs, Grove et al., [3, 2] have explored the algorithmic design space of contexts for benchmarks of significant size. ...
doi:10.1145/1557898.1557905
dblp:conf/ecoop/Besson09
fatcat:k2ai3srqhrci5nhqynhd6f2wwi
Mutable WadlerFest DOT
2017
Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs - FTFJP'17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mutation in DOT is needed not only to model e ectful computation and mutation in Scala programs, but even to precisely specify how Scala initializes immutable variables and elds (vals). ...
We present the key features of our extended calculus and its soundness proof, and discuss the challenges that we encountered in our search for a sound design and the alternative solutions that we considered ...
Mackay et al. (2012) developed a version of Featherweight Java (Igarashi et al. 2001) with mutable and immutable objects and formalized it in Coq. ...
doi:10.1145/3103111.3104036
dblp:conf/ecoop/RapoportL17
fatcat:fyholpkg6fd2fbde2ks5euwueu
« Previous
Showing results 1 — 15 out of 86 results