Flexible alias protection

Noble, James; Vítek, Jan; Potter, John

doi:10.1007/bfb0054091

Cited by 189 publications

(204 citation statements)

References 25 publications

Supporting

Mentioning

204

Contrasting

Order By: Relevance

“…A similar notion and analysis could be used in Cgc to identify library methods that do not retain permanent references to their arguments, in order to improve the precision of the LibraryPointsTo set. In addition to the analysis that infers the confinement property, there is a large body of work on type systems that enforce encapsulation by restricting reference aliasing [8,10,12,25].…”

Section: Related Workmentioning

confidence: 99%

Application-Only Call Graph Construction

Ali

Lhoták

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Since call graphs are an essential starting point for all interprocedural analyses, many tools and frameworks have been developed to generate the call graph of a given program. The majority of these tools focus on generating the call graph of the whole program (i.e., both the application and the libraries that the application depends on). A popular compromise to the excessive cost of building a call graph for the whole program is to ignore all the effects of the library code and any calls the library makes back into the application. This results in potential unsoundness in the generated call graph and therefore in any analysis that uses it. In this paper, we present Cgc, a tool that generates a sound call graph for the application part of a program without analyzing the code of the library.

show abstract

Section: Related Workmentioning

confidence: 99%

Application-Only Call Graph Construction

Ali

Lhoták

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…First, Scoped Types enforce a per-owner relation [10,18] via techniques based on Confined Types [9,22]. The type system described here refines the system described in [21] which includes a proof of correctness, but no implementation.…”

Section: Fig 1 Overview Of Stars Application Logic Is Written Accomentioning

confidence: 99%

“…8 shows both the RTSJ version and the STARS version. In the RTSJ version, the runner is a NoHeapRealtimeThread which has in its run() method code to create a new scoped memory (lines [11][12] and a run loop which repeatedly enters the scope passing a detector as argument (lines [17][18].…”

Section: Patterns and Idiomsmentioning

confidence: 99%

Scoped Types and Aspects for Real-Time Java

Andreae

Coady

Gibbs

et al. 2006

ECOOP 2006 – Object-Oriented Programming

Self Cite

View full text Add to dashboard Cite

Abstract. Real-time systems are notoriously difficult to design and implement, and, as many real-time problems are safety-critical, their solutions must be reliable as well as efficient and correct. While higher-level programming models (such as the Real-Time Specification for Java) permit real-time programmers to use language features that most programmers take for granted (objects, type checking, dynamic dispatch, and memory safety) the compromises required for real-time execution, especially concerning memory allocation, can create as many problems as they solve. This paper presents Scoped Types and Aspects for Real-Time Systems (STARS) a novel programming model for real-time systems. Scoped Types give programmers a clear model of their programs' memory use, and, being statically checkable, prevent the run-time memory errors that bedevil models such as RTSJ. Our Aspects build on Scoped Types guarantees so that Real-Time concerns can be completely separated from applications' base code. Adopting the integrated Scoped Types and Aspects approach can significantly improve both the quality and performance of a real-time Java systems, resulting in simpler systems that are reliable, efficient, and correct.

show abstract

“…Mechanisms that achieve information hiding by restricting the visibility of names, e.g., private/protected annotations, are useful but insufficient. They prevent the name of an entity from being used outside a class or package, but do not prevent a reference to an entity from being leaked out of a structure [26].…”

Section: Types For Hierarchic Shapesmentioning

confidence: 99%

Types for Hierarchic Shapes

Drossopoulou

Clarke

Noble

2006

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Heap entities tend to contain complex references to each other. To manage this complexity, types which express shapes and hierarchies have been suggested. We survey type systems which describe such hierarchic shapes, how these types are used for reasoning about programs, and applications in concurrent programming.Most imperative programs create and manipulate heap entities (objects, or records) which contain references to each other forming intricate topologies. This creates complexity, and makes programs difficult to understand and manipulate. Programmers, on the other hand, tend to think in terms of shapes, categorizations and hierarchies.Thus, in the last decade, types describing shapes and hierarchies have been proposed to express programming intuitions, to support verification, and for synchronization and optimizations. We will discuss types for hierarchic shapes in terms of object oriented programming, because, even though the ideas are applicable to any imperative language, most of the related research was conducted in the context of object oriented languages.

show abstract

Flexible alias protection

Cited by 189 publications

References 25 publications

Application-Only Call Graph Construction

Application-Only Call Graph Construction

Scoped Types and Aspects for Real-Time Java

Types for Hierarchic Shapes

Contact Info

Product

Resources

About