Verifiable functional purity in java

Finifter, Matthew; Mettler, Adrian; Sastry, Naveen; Wagner, David

doi:10.1145/1455770.1455793

Cited by 34 publications

(33 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Joe-E is a subset of Java based on an object-capability model supporting purely functional methods and type checking [FMSW08]. In Joe-E, a purely functional method does not have side-effects and its behavior only depends on its arguments.…”

Section: Related Workmentioning

confidence: 99%

“…In our example of contracts, ensuring functional purity would be too strong: a pre-condition can perfectly rely on internal non state related side-effects. Functional purity is also difficult to ensure in the presence of both late binding and imperative code, without resorting to an entirely different programming style [FMSW08,MWC10].…”

Section: Related Workmentioning

confidence: 99%

“…Several works use the object capability model as a way to control references [Lev84,MS03,Mil06,FMSW08]. The idea behind capabilities-as-objects is that the reference itself is a capability that is a key to access a resource or behavior ; without this key the resources are not accessible.…”

Section: Introductionmentioning

confidence: 99%

“…The programmer thus must follow idioms and patterns to make sure that there is no reference leaked with the full interface, or the safety would be compromised. Capability-based implementations such as Joe-E are again based on a static type system [FMSW08]. Such approaches do not fully address our needs since some properties should propagate through all the objects reached during a particular execution and this only from the perspective of a given reference.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Handles: Behavior-propagating first class references for dynamically-typed languages

Arnaud

Ducasse

Denker

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

Controlling object graphs and giving specific semantics to references (such as read-only, ownership, scoped sharing) has been the focus of a large body of research in the context of static type systems. Controlling references to single objects and to graphs of objects is essential to build more secure systems, but is notoriously hard to achieve in absence of static type systems. In this article we embrace this challenge by proposing a solution to the following question: What is an underlying mechanism that can support the definition of properties (such as revocable, read-only, lent) at the reference level in the absence of a static type system? We present handles: first-class references that propagate behavioral change dynamically to the object subgraph during program execution. In this article we describe handles and show how handles support the implementation of read-only references and revocable references. Handles have been fully implemented by modifying an existing virtual machine and we report their costs.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Handles: Behavior-propagating first class references for dynamically-typed languages

Arnaud

Ducasse

Denker

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…However, no mechanism for checking their purity was given, and instead the authors assume an existing analysis that annotates methods appropriately. Finifter et al adopt a stricter notion of purity, called functional purity, within the context of Joe-E -a subset of Java [12]. A method is considered functionally pure if it is both side-effect free, and deterministic.…”

Section: Related Workmentioning

confidence: 99%

JPure: A Modular Purity System for Java

Pearce

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Purity Analysis is the problem of determining whether or not a method may have side-effects. This has applications in automatic parallelisation, extended static checking, and more. We present a novel purity system for Java that employs purity annotations which can be checked modularly. This is done using a flow-sensitive, intraprocedural analysis. The system exploits two properties, called freshness and locality, to increase the range of methods that can be considered pure. JPure also includes an inference engine for annotating legacy code. We evaluate our system against several packages from the Java Standard Library. Our results indicate it is possible to uncover significant amounts of purity efficiently.

show abstract

Purity analysis for JavaScript through abstract interpretation

Nicolay

Stiévenart

Meuter

et al. 2017

J Software Evolu Process

View full text Add to dashboard Cite

We present a static analysis for determining whether and to what extent functions in JavaScript programs are pure. To this end, the analysis classifies functions as pure functions, observers, or procedures. A function is pure if none of its executions generate or depend upon externally observable side effects. A function is an observer as soon as one of its executions depends on an external side effect, but none of its executions generate observable side effects. Otherwise, the function is classified as a procedure. Function executions and associated callers are found by traversing all reachable function execution contexts on the call stack at the point where an effect occurs. Our approach is based on a flow analysis that, in addition to computing traditional control and value flow, keeps track of read and write effects. To increase the precision of our purity analysis, we combine it with an intraprocedural analysis that determines freshness of variables and objects. We formalize the core aspects of our technique and discuss its implementation and results on common JavaScript benchmarks. Results show that our approach is capable of determining function purity in the presence of higher‐order functions, dynamic property expressions, and prototypal inheritance. When compared with existing purity analyses, we find that our approach is as precise or more precise than the existing analyses.

show abstract

Verifiable functional purity in java

Cited by 34 publications

References 13 publications

Handles: Behavior-propagating first class references for dynamically-typed languages

Handles: Behavior-propagating first class references for dynamically-typed languages

JPure: A Modular Purity System for Java

Purity analysis for JavaScript through abstract interpretation

Contact Info

Product

Resources

About