@inproceedings{498, abstract = {{Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space.}}, author = {{Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}}, booktitle = {{Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}}, pages = {{912--927}}, title = {{{Programs from Proofs – A PCC Alternative}}}, doi = {{10.1007/978-3-642-39799-8_65}}, year = {{2013}}, } @inproceedings{499, abstract = {{We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's competitiveness.Our results generalize and improve upon work by \citet{Chan:2010}, which considers a single speed-scalable processor.Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.In our scheduling problem, jobs arrive over time and are preemptable.They have different workloads, values, and deadlines.The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value.However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy.The cost of a schedule is the sum of lost values and invested energy.In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly.A processor's energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$ is the power consumption when running at speed $s$.Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs.This problem was introduced by~\citet{Chan:2010} for the case of a single processor.They presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We provide an online algorithm for the case of multiple processors with an improved competitive ratio of $\alpha^{\alpha}$.}}, author = {{Kling, Peter and Pietrzyk, Peter}}, booktitle = {{Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{251--260 }}, title = {{{Profitable Scheduling on Multiple Speed-Scalable Processors}}}, doi = {{10.1145/2486159.2486183}}, year = {{2013}}, } @article{7271, author = {{de Lemos, Rogrio and Giese, Holger and A. Müller, Hausi and Shaw, Mary and Andersson, Jesper and Litoiu, Marin and Schmerl, Bradley and Tamura, Gabriel and M. Villegas, Norha and Vogel, Thomas and Weyns, Danny and Baresi, Luciano and Becker, Basil and Bencomo, Nelly and Brun, Yuriy and Cukic, Bojan and Desmarais, Ron and Dustdar, Schahram and Engels, Gregor and Geihs, Kurt and M. Göschka, Karl and Gorla, Alessandra and Grassi, Vincenzo and Inverardi, Paola and Karsai, Gabor and Kramer, Jeff and Lopes, Antonia and Magee, Jeff and Malek, Sam and Mankovskii, Serge and Mirandola, Raffaela and Mylopoulos, John and Nierstrasz, Oscar and Pezzè, Mauro and Prehofer, Christian and Schäfer, Wilhelm and Schlichting, Rick and B. Smith, Dennis and Pedro Sousa, Joao and Tahvildari, Ladan and Wong, Kenny and Wuttke, Jochen}}, journal = {{Software Engineering for Self-Adaptive Systems II}}, pages = {{1--32}}, title = {{{Software Engineering for Self-Adaptive Systems: A Second Research Roadmap}}}, doi = {{10.1007/978-3-642-35813-5_1}}, year = {{2013}}, } @article{7272, author = {{Bouillon, Elke and Güldali, Baris and Herrmann, Andrea and Keuler, Thorsten and Moldt, Daniel and Riebisch, Matthias}}, journal = {{Softwaretechnik-Trends}}, number = {{1}}, pages = {{29--30}}, title = {{{Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum}}}, volume = {{33}}, year = {{2013}}, } @article{7273, author = {{Grieger, Marvin and Güldali, Baris and Sauer, Stefan and Mlynarski, Michael}}, journal = {{OBJEKTspektrum (Online Themenspecials)}}, pages = {{1--4}}, title = {{{Testen bei Migrationsprojekten}}}, year = {{2013}}, } @article{7274, author = {{Fazal-Baqaie, Masud and Güldali, Baris and Luckey, Markus and Sauer, Stefan and Spijkerman, Michael}}, journal = {{OBJEKTspektrum (Online Themenspecials)}}, number = {{RE/2013}}, pages = {{1--5}}, title = {{{Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden}}}, year = {{2013}}, } @article{7275, author = {{Engels, Gregor and Luckey, Markus}}, journal = {{Computer Science - Research and Development}}, number = {{1}}, pages = {{1--2}}, title = {{{Editorial}}}, volume = {{28}}, year = {{2013}}, } @article{7276, author = {{Engels, Gregor and Gerth, Christian and Kleinjohann, Bernd and Kleinjohann, Lisa and Müller, Wolfgang and Sauer, Stefan}}, journal = {{Forschungsforum Paderborn}}, pages = {{54--61}}, title = {{{Informationstechnik spart Ressourcen}}}, volume = {{16/2013}}, year = {{2013}}, } @article{7277, author = {{Gerth, Christian and Küster, Jochen and Luckey, Markus and Engels, Gregor}}, journal = {{Software and Systems Modeling}}, number = {{3}}, pages = {{517--535}}, title = {{{Detection and Resolution of Conflicting Change Operations in Version Management of Process Models}}}, volume = {{12}}, year = {{2013}}, } @article{7278, abstract = {{Modellbasiertes Testen verspricht potenziell eine höhere Effizienz und Effektivität im Testprozess. Ob im eigenen Kontext der Einsatz wirtschaftlich ist, ist jedoch häufig unklar. Dieser Beitrag analysiert systematisch Kosten- und Nutzenfaktoren und stellt ein Verfahren zur Abschätzung der Wirtschaftlichkeit des modellbasierten Testens vor. Anhand eines Beispiels wird der Ablauf veranschaulicht.}}, author = {{Faragó, David and Törsel, Arne-Michael and Mlynarski, Michael and Weißleder, Stephan and Güldali, Baris and Brandes, Christian}}, journal = {{OBJEKTspektrum}}, pages = {{32--38}}, title = {{{Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt}}}, volume = {{4}}, year = {{2013}}, } @inbook{7523, author = {{Engels, Gregor and Sauer, Stefan}}, booktitle = {{Handbook of Software Engineering and Knowledge Engineering}}, editor = {{Chang, S K}}, isbn = {{9789810245146}}, pages = {{21----53}}, publisher = {{World Scientific Publishing Company}}, title = {{{Object-oriented Modeling of Multimedia Applications}}}, doi = {{https://doi.org/10.1142/4603}}, volume = {{2}}, year = {{2013}}, } @phdthesis{7569, abstract = {{Dynamic Meta Modeling (DMM) is a semantics specification technique targeted at MOF-based modeling languages, where a language's behavior is defined by means of graphical operational rules which change runtime models. The DMM approach has first been suggested by Engels et al. in 2000; Hausmann has then defined the DMM language on a conceptual level within his PhD thesis in 2006. Consequently, the next step was to bring the existing DMM concepts alive, and then to apply them to different modeling languages, making use of the lessons learned to improve the DMM concepts as well as the DMM tooling. The result of this process is the DMM++ method, which is presented within this thesis. Our contributions are three-fold: First, and according to our experiences with the DMM language, we have introduced new concepts such as refinement by means of rule overriding, and we have strengthened existing concepts such as the dealing with universally quantified structures or attributes. Second, we have developed a test-driven process for semantics specification: A set of test models is created, and their expected behavior is fixed. Then, the DMM rules are created incrementally, finally resulting in a DMM ruleset realizing at least the expected behavior of the test models. Additionally, we have defined a set of coverage criteria for DMM rulesets which allow to measure the quality of a set of test models. Third, we have shown how functional as well as non-functional requirements can be formulated against models and their DMM specifications. The former is achieved by providing a visual language for formulating temporal logic properties, which are then verified with model checking techniques, and by allowing for visual debugging of models failing a requirement. For the latter, the modeler can add performance information to models and analyze their performance properties, e.g. average throughput.}}, author = {{Soltenborn, Christian}}, publisher = {{Universität Paderborn}}, title = {{{Quality Assurance with Dynamic Meta Modeling}}}, doi = {{http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420}}, year = {{2013}}, } @phdthesis{7571, abstract = {{Driven by the need for a closer alignment of business and IT requirements, the role of business process models in the development of enterprise software systems has increased continuously. Similar to other software artifacts, process models are developed and refined in team environments by several stakeholders, resulting in different versions. These versions need to be merged in order to obtain an integrated process model. Existing solutions to this basic problem in the field of software configuration management are mainly limited to textual documents, e.g., source code. This monograph presents a generally applicable framework for process model change management, which provides easy-to-use comparison and merging capabilities for the integration of different process model versions. The framework supports popular modeling languages such as BPMN, BPEL, or UML Activity Diagrams. Differences between process models are represented in terms of intuitive, high-level change operations. Equipped with a sophisticated analysis of dependencies and a semantic-aware computation of conflicts between differences, the framework constitutes a comprehensive and practically usable solution for process model change management in the model-driven development of enterprise software systems.}}, author = {{Gerth, Christian}}, title = {{{Business Process Models - Change Management}}}, year = {{2013}}, } @article{769, author = {{Biermann, Thorsten and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger}}, journal = {{{IEEE} Communications Magazine}}, number = {{8}}, title = {{{How backhaul networks influence the feasibility of coordinated multipoint in cellular networks}}}, doi = {{10.1109/MCOM.2013.6576356}}, year = {{2013}}, } @inproceedings{8485, author = {{Spijkerman, Michael }}, booktitle = {{Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium) SE 2013 (to appear)}}, pages = {{425----434}}, publisher = {{GI}}, title = {{{Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden}}}, volume = {{215}}, year = {{2013}}, } @inproceedings{8486, author = {{Nagel , Benjamin and Gerth , Christian and Post, Jennifer and Engels, Gregor}}, booktitle = {{Proceedings of the CAiSE'13 Forum at the 25th International Conference on Advanced Information Systems Engineering (CAiSE'13)}}, pages = {{9----16}}, publisher = {{CEUR-WS.org}}, title = {{{Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies}}}, volume = {{998}}, year = {{2013}}, } @inproceedings{8487, author = {{Kehrer , Timo and Gerth, Christian }}, booktitle = {{Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM'13)}}, number = {{2}}, pages = {{32--34}}, publisher = {{FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI)}}, title = {{{CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models.}}}, volume = {{33}}, year = {{2013}}, } @inproceedings{8488, author = {{Grieger , Marvin and Sauer, Stefan}}, booktitle = {{Software Engineering 2013 Workshopband}}, pages = {{189--200}}, publisher = {{GI, Köllen Druck+Verlag GmbH, Bonn}}, title = {{{Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen Softwareentwicklung}}}, year = {{2013}}, } @inproceedings{8489, author = {{Nagel , Benjamin and Gerth , Christian and Engels, Gregor}}, booktitle = {{Proceedings of the 9th Workshop on Engineering Service-Oriented Applications (WESOA 2013) (accepted for application)}}, title = {{{Goal-driven Composition of Business Process Models}}}, year = {{2013}}, } @inproceedings{8490, author = {{Fazal-Baqaie , Masud and Luckey , Markus and Engels, Gregor}}, booktitle = {{Software Engineering 2013 Workshopband}}, pages = {{435--444}}, publisher = {{GI, Köllen Druck+Verlag GmbH, Bonn}}, title = {{{Assembly-based Method Engineering with Method Patterns}}}, year = {{2013}}, }