Refine
Year of publication
Document Type
- Monograph/Edited Volume (1221) (remove)
Language
- English (1221) (remove)
Keywords
Institute
- Institut für Mathematik (353)
- Wirtschaftswissenschaften (191)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (89)
- Institut für Informatik und Computational Science (82)
- Department Linguistik (47)
- Institut für Anglistik und Amerikanistik (46)
- Sozialwissenschaften (39)
- Institut für Physik und Astronomie (35)
- Hasso-Plattner-Institut für Digital Engineering GmbH (34)
- Department Psychologie (25)
Constraints allow developers to specify desired properties of systems in a number of domains, and have those properties be maintained automatically. This results in compact, declarative code, avoiding scattered code to check and imperatively re-satisfy invariants. Despite these advantages, constraint programming is not yet widespread, with standard imperative programming still the norm. There is a long history of research on integrating constraint programming with the imperative paradigm. However, this integration typically does not unify the constructs for encapsulation and abstraction from both paradigms. This impedes re-use of modules, as client code written in one paradigm can only use modules written to support that paradigm. Modules require redundant definitions if they are to be used in both paradigms. We present a language – Babelsberg – that unifies the constructs for en- capsulation and abstraction by using only object-oriented method definitions for both declarative and imperative code. Our prototype – Babelsberg/R – is an extension to Ruby, and continues to support Ruby’s object-oriented se- mantics. It allows programmers to add constraints to existing Ruby programs in incremental steps by placing them on the results of normal object-oriented message sends. It is implemented by modifying a state-of-the-art Ruby virtual machine. The performance of standard object-oriented code without con- straints is only modestly impacted, with typically less than 10% overhead compared with the unmodified virtual machine. Furthermore, our architec- ture for adding multiple constraint solvers allows Babelsberg to deal with constraints in a variety of domains. We argue that our approach provides a useful step toward making con- straint solving a generic tool for object-oriented programmers. We also provide example applications, written in our Ruby-based implementation, which use constraints in a variety of application domains, including interactive graphics, circuit simulations, data streaming with both hard and soft constraints on performance, and configuration file Management.
The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of behavioral equivalence or refinement between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation.
In this report, we extend our results presented in [27] and outline a new sophisticated approach for the automatic verification of behavior preservation captured by bisimulation resp. simulation for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation and that the resulting checking problem can be addressed by our own invariant checker even for a complex example where a sequence chart is transformed into communicating automata. We further discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.
Asymptotic algebras
(2001)
Aspects of Boundary Problems in Analysis and Geometry : advances in partial differential equations
(2004)
I. Human Rights and Democratic Movements in Armenia - Human Rights as an “Attractor” of Europeanization Processes of Transcaucasian “Neither War nor Peace Societies” (Artur Mkrtichyan) - Human Rights Defender’s Office Armenia (Larisa Alaverdyan) - The Factor of Human Rights Protection as Criteria for the Development in the Social System (Hovhannes Hovhannisyan) - Two Priorities and Two Suggestions in Leading the Way to Human Rights Protection (Gevork Manoukian) - Intrastate Mechanisms of the Protection of Human Political Rights and Freedoms in Armenia (Ashot A. Alexanyan) - The Future of Democracy in Armenia: Institutional and Mass Beliefs Perspectives (Alexander Markarov) II. Human Rights and Education in Armenia - Human Rights in the System of Civic Education Values (Valery Poghosyan) - The Role of Academic Knowledge in Maintaining Tolerance (Ani Muradyan) - Rights of a Child or Duties of Adults...? (Mira Antonyan) - The Right to Education for Children with Special Needs: Inclusive Education in Armenia (Marina Hovhannissyan) - Human Rights Awareness and UNDP Evaluation in Armenia (Kristina Henschen) - Human Rights Education in Armenia – A Base Line Study (Litit Umroyan; Lucig Danielian) III. Human Rights and Minorities in Armenia - Human Rights, Minorities and Human Rights Education in Armenia: An External Perspective (Claudia Mahler; Anja Mihr; Reetta Toivanen) - Minorities and Identity in Armenia (Tatevik Margaryan) - Legal and Real Opportunities for the National Minorities Residing on the Territory of the Republic of Armenia (Hranush Kharatyan)