ECOOP POSTER SESSION
ECOOP 2008 is pleased to offer a number of opportunities for posters presenting research projects and ongoing work. Posters are especially useful for advertising new national or international projects (e.g. EU networks) and for presenting new ideas that have not yet been developed to the point of a regular paper. PhD students in particular are encouraged to submit a poster proposal describing their work.
Each submission will be evaluated based on its relevance to ECOOP and its significance (see the Call for Papers for an open list of topics).
Poster sessions will take place during the main three days of the conference (Wednesday 9th - Friday 11th July).
A poster submission should include a short description of the poster content suitable for evaluation and a one paragraph summary (from 70 to 150 words) of the poster suitable for inclusion in the conference guide. It should be written in English, and be not longer than 2 pages. It should be submitted as a pdf or postscript file via email to the following address: Anna Philippou
The deadline for poster proposals is June 6th. Requests received by that date will be responded to June 13th.<-->
Demonstration and poster chair:
Anna Philippou, University of Cyprus
Poster sessions will take place in the foyer of the conference site on Wednesday and Thursday during the morning coffee breaks.
P1 An Exception Handling Framework
Nikolas Nehmer, University of Kaiserslautern, Germany
Today’s exception handling mechanisms are insufficient for meeting the dependability requirements of large and complex software systems. In this poster session a novel exception handling framework is presented. The framework includes a tool supporting developers in reasoning about exception flow. Based on the exception flow analysis a novel fault containment approach is proposed restricting the impact of uncaught exceptions on the overall system. System parts affected by uncaught exceptions are identified, isolated and gracefully degraded.
P2 Group Communication Abstractions for Distributed Reactive Systems
Andoni Lombide Carreton, Stijn Mostinckx and Wolfgang De Meuter
Vrije Universiteit Brussel, Belgium
Pervasive computing in mobile ad hoc networks requires that applications react to a plethora of events read by other devices in the mobile ad hoc network. Current context-aware and event-driven architectures require the programmer to react to these events via a carefully-crafted network of observers and event handlers, around which the whole application is structured. The object-oriented, distributed and concurrent language AmbientTalk offers Reactive Programming as an alternative paradigm to be able to write such pervasive applications while retaining a conventional programming style. However, due to the asynchronous communication between remote objects, event handlers are still required to capture and process results computed in parallel. We claim that, by exploiting the Reactive Programming mechanisms and the first class messages offered by AmbientTalk, it is possible to implement group communication abstractions that allow connecting asynchronous group communication with Reactive Programming without resorting to event handlers. We have identified a number of criteria to which such an abstraction must adhere to to make this possible.
P3 A Pattern Language for Metadata Based Components
Eduardo Martins Guerra, Aeronautical Institute of Technology, São José dos Campos, Brazil
A metadata-based component is a component or a framework that processes its logic based on the metadata of the class whose instance it is working with. Metadata can be defined using code conventions, code annotations, external files, databases or programmatically. There are no documented best practices or design patterns about this kind of components. This poster is going to present a pattern language for metadata-based components, addressing solutions about metadata-based components structure, metadata reading, logic processing based on metadata and metadata applicability.
P4 SASyLF: An Educational Proof Assistant for Language Theory
Jonathan Aldrich, Robert J. Simmons, Key Shin - Carnegie Mellon University
Teaching and learning formal programming language theory is hard, in part because it's easy to make mistakes and hard to find them. Proof assistants can help check proofs, but their learning curve is too steep to use in most classes, and is a barrier to researchers too. In this poster we present SASyLF, an LF-based proof assistant specialized to checking theorems about programming languages and logics. SASyLF has a simple design philosophy: language and logic syntax, semantics, and meta-theory should be written as closely as possible to the way it is done on paper. We include an example showing how to use SASyLF to formalize languages and their semantics, and how to prove meta-theorems about them. We also share our experience using SASyLF in a CMU course in Spring 2008.
P5 CZ: Multiple Inheritance Without Diamonds
Donna Malayeri, Jonathan Aldrich - Carnegie Mellon University
Multiple inheritance has long been plagued with the “diamond” inheritance problem, spurring a variety of solutions, such as virtual inheritance, mixins and traits. We offer a different solution: a language that supports multiple inheritance but forbids diamond inheritance. We maintain expressiveness through a ``requires'' construct (inspired by Scala), which provides subtyping without inheritance diamonds, and a virtual super call similar to that found in traits. Our novel no-diamond restriction offers two benefits: it allows multiple inheritance to coexist neatly with fields, without the problem of initializing multiply-inherited fields. Second, it allow multiple inheritance to be compatible with modular typechecking of multiple dispatch; previous work disallowed multiple inheritance across module boundaries. We believe our language strikes the proper balance between expressiveness and modularity.