More dynamic object reclassification

Drossopoulou, Sophia; Damiani, Ferruccio; Dezani‐Ciancaglini, Mariangiola; Giannini, Paola

doi:10.1145/514952.514955

Cited by 63 publications

(30 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a rule of thumb, reclassification may be unsafe for objects pointed by references. Some programming languages bound the classes an object may be retyped to, and forbid references to such classes [9]. Instead, we allow more flexibility, and provide an analysis mechanism to detect unsafe typings.…”

Section: A Analysing Dynamic Type Safetymentioning

confidence: 99%

“…Dynamic reclassification has been more studied in objectoriented languages. In [9], objects can change its type among several state classes, subtypes of a given root class. To ensure type-safety, state classes are not allowed to receive references.…”

Section: Dynamic Typingmentioning

confidence: 99%

“…Hence, interfaces decouple classification from the creation type, permit several classifiers for an object, and enable reusability. Dynamic reclassification has also been realized in some object-oriented languages [9] to allow objects to change their class membership at runtime, which decouples even further classification from creation. In contrast, most MDE approaches use static constructive typing, which results in more restricted possibilities for modelling and reuse.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A-posteriori typing for Model-Driven Engineering

Lara

Guerra

Cuadrado

2015

2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)

View full text Add to dashboard Cite

Esta es la versión de autor de la comunicación de congreso publicada en: This is an author produced version of a paper published in: Abstract-Model-Driven Engineering is founded on the ability to create and process models conformant to a meta-model. Hence, meta-model classes are used in two ways: as templates to create objects, and as classifiers for them. While these two aspects are inherently tied in most meta-modelling approaches, in this paper, we discuss the benefits of their decoupling. Thus, we rely on standard mechanisms for object creation and propose a-posteriori typing as a means to reclassify objects and enable multiple, partial, dynamic typings. This approach enhances flexibility, permitting unanticipated reutilization (as existing model management operations defined for a meta-model can be reused with other models once they get reclassified), as well as model transformation by reclassification. We show the underlying theory behind the introduced concepts, and illustrate its applicability using our METADEPTH meta-modelling tool.

show abstract

Section: A Analysing Dynamic Type Safetymentioning

confidence: 99%

Section: Dynamic Typingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A-posteriori typing for Model-Driven Engineering

Lara

Guerra

Cuadrado

2015

2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)

View full text Add to dashboard Cite

show abstract

“…Typestate systems track the conceptual states that each object goes through during its lifetime in the computation [Strom and Yemini 1986;Fink et al 2006;Drossopoulou et al 2002]. They generalize standard type systems by allowing the typestate of an object to change during the computation.…”

Section: Typestatementioning

confidence: 99%

Partially Evaluating Finite-State Runtime Monitors Ahead of Time

Bodden

Lam

Hendren

2012

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Finite-state properties account for an important class of program properties, typically related to the order of operations invoked on objects. Many library implementations therefore include manually-written finite-state monitors to detect violations of finite-state properties at runtime. Researchers have recently proposed the explicit specification of finite-state properties and automatic generation of monitors from the specification. However, runtime monitoring only shows the presence of violations, and typically cannot prove their absence. Moreover, inserting a runtime monitor into a program under test can slow down the program by several orders of magnitude.In this work, we therefore present a set of four static whole-program analyses that partially evaluate runtime monitors at compile time, with increasing cost and precision. As we show, ahead-of-time evaluation can often evaluate the monitor completely statically. This may prove that the program cannot violate the property on any execution or may prove that violations do exist. In the remaining cases, the partial evaluation converts the runtime monitor into a residual monitor. This monitor only receives events from program locations that the analyses failed to prove irrelevant. This makes the residual monitor much more efficient than a full monitor, while still capturing all property violations at runtime.We implemented the analyses in Clara, a novel framework for the partial evaluation of AspectJ-based runtime monitors, and validated our approach by applying Clara to finite-state properties over several large-scale Java programs. Clara proved that most of the programs never violate our example properties. Some programs required monitoring, but in those cases Clara could often reduce the monitoring overhead to below 10%. We observed that several programs did violate the stated properties.

show abstract

“…Fickle [13] implements a dynamic object reclassification (i.e., objects can change class membership at run-time) in order to represent object evolutions and changes. For example, an instance of class Student can change class at run-time becoming an instance of class Employee.…”

mentioning

confidence: 99%

Featherweight Wrap Java: wrapping objects and methods.

Bettini¹,

Capecchi²,

Giachino³

2008

JOT

View full text Add to dashboard Cite

We present a language extension, which integrates in a Java like language a mechanism for dynamically extending object behaviors without changing their type. Our approach consists in moving the addition of new features from class (static) level to object (dynamic) level: the basic features of entities (representing their structure) are separated from the additional ones (wrapper classes whose instances represent run-time added behaviors). At run-time, these entities can be dynamically composed by instantiating wrapper objects which are attached to basic entities. Wrappers permit specializing (wrapping) methods at run-time: the method of the wrapper will be automatically executed after the method of the wrapped objects, using a delegation mechanism. Furthermore, wrapped methods can return values and values returned by the wrapped methods are transparently made available in the wrapper methods. We formalize our extension by adding the new constructs to Featherweight Java and we prove that the core language so extended (Featherweight Wrap Java) is type safe.

show abstract

More dynamic object reclassification

Cited by 63 publications

References 23 publications

A-posteriori typing for Model-Driven Engineering

A-posteriori typing for Model-Driven Engineering

Partially Evaluating Finite-State Runtime Monitors Ahead of Time

Featherweight Wrap Java: wrapping objects and methods.

Contact Info

Product

Resources

About