[{"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1252","file_name":"601-Kempkes-PhD.pdf","file_size":3805310,"creator":"florida","date_created":"2018-03-15T08:16:44Z","date_updated":"2018-03-15T08:16:44Z"}],"abstract":[{"text":"Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\\\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\\\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\\\"o}nnen. Daf{\\\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\\\"u}r die ben{\\\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\\\"a}llen wird außerdem die ben{\\\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\\\"o}tigen w{\\\"u}rde. So werden kompetititve Faktoren hergeleitet.","lang":"eng"}],"title":"Local strategies for robot formation problems","date_created":"2017-10-17T12:42:49Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","year":"2012","file_date_updated":"2018-03-15T08:16:44Z","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"601","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"dissertation","volume":302,"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"author":[{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"}],"date_updated":"2022-01-06T07:02:50Z","intvolume":"       302","citation":{"ama":"Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012.","ieee":"B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","chicago":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","bibtex":"@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local strategies for robot formation problems}, volume={302}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes, Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","apa":"Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"has_accepted_license":"1","publication_identifier":{"isbn":["978-3-942647-21-2"]}},{"citation":{"ieee":"P. Wette and H. Karl, <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn, 2012.","chicago":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012.","apa":"Wette, P., &#38; Karl, H. (2012). <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn.","bibtex":"@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }","short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.","mla":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012."},"year":"2012","has_accepted_license":"1","title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-10-17T12:42:49Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-09T09:57:26Z","creator":"hkarl","date_created":"2018-03-09T09:57:26Z","file_size":717326,"access_level":"closed","file_name":"underlayMod2.pdf","file_id":"1205"}],"abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths."}],"type":"report","file_date_updated":"2018-03-09T09:57:26Z","ddc":["000"],"department":[{"_id":"75"}],"user_id":"126","_id":"603","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"type":"bachelorsthesis","status":"public","_id":"606","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"13703","language":[{"iso":"ger"}],"year":"2012","citation":{"apa":"Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn.","short":"N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012.","bibtex":"@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }","mla":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","ama":"Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn; 2012.","chicago":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","ieee":"N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012."},"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:50Z","author":[{"first_name":"Nils","id":"13703","full_name":"Löken, Nils","last_name":"Löken"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas"},{"title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","date_created":"2017-10-17T12:42:50Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"full_name":"Haarhoff, Thomas","last_name":"Haarhoff","first_name":"Thomas"}],"year":"2012","citation":{"ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.","chicago":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","ieee":"T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","mla":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","bibtex":"@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }","apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn."},"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"607","user_id":"477","department":[{"_id":"64"}],"status":"public","type":"bachelorsthesis"},{"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"file_id":"1250","file_name":"608-Timm2013-0main.pdf","access_level":"closed","file_size":396337,"date_created":"2018-03-15T08:15:33Z","creator":"florida","date_updated":"2018-03-15T08:15:33Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement."}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","date_created":"2017-10-17T12:42:50Z","year":"2012","file_date_updated":"2018-03-15T08:15:33Z","department":[{"_id":"77"}],"series_title":"LNCS","user_id":"477","_id":"608","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","type":"conference","doi":"10.1007/978-3-642-34281-3_25","author":[{"first_name":"Nils","last_name":"Timm","full_name":"Timm, Nils"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"},{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"}],"date_updated":"2022-01-06T07:02:52Z","page":"348-363","citation":{"ama":"Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>. LNCS. ; 2012:348-363. doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>","ieee":"N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–363.","chicago":"Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 348–63. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">https://doi.org/10.1007/978-3-642-34281-3_25</a>.","apa":"Timm, N., Wehrheim, H., &#38; Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i> (pp. 348–363). <a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">https://doi.org/10.1007/978-3-642-34281-3_25</a>","bibtex":"@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012}, pages={348–363}, collection={LNCS} }","short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","mla":"Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>."},"has_accepted_license":"1"},{"file_date_updated":"2018-03-15T06:47:15Z","ddc":["040"],"series_title":"ICPS","user_id":"15504","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"619","file":[{"date_created":"2018-03-15T06:47:15Z","creator":"florida","date_updated":"2018-03-15T06:47:15Z","access_level":"closed","file_id":"1244","file_name":"619-Brandes_MadHTADDS12_01.pdf","file_size":346044,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)","doi":"10.1145/2414815.2414818","title":"Distributed Computing in Fault-Prone Dynamic Networks","author":[{"first_name":"Philipp","full_name":"Brandes, Philipp","last_name":"Brandes"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2017-10-17T12:42:52Z","date_updated":"2022-01-06T07:02:56Z","citation":{"bibtex":"@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }","mla":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14, doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>.","short":"P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.","apa":"Brandes, P., &#38; Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i> (pp. 9–14). <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>","ieee":"P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14.","chicago":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 9–14. ICPS, 2012. <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>.","ama":"Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>. ICPS. ; 2012:9-14. doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>"},"page":"9-14","year":"2012","has_accepted_license":"1"},{"series_title":"Electronic Communications of the EASST","user_id":"14955","department":[{"_id":"66"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"622","file_date_updated":"2018-03-15T06:46:40Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"conference","publication":"Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)","file":[{"date_updated":"2018-03-15T06:46:40Z","creator":"florida","date_created":"2018-03-15T06:46:40Z","file_size":301602,"file_name":"622-gtvmt2012-Arifulina_01.pdf","access_level":"closed","file_id":"1243","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite."}],"date_created":"2017-10-17T12:42:53Z","author":[{"first_name":"Svetlana","full_name":"Arifulina, Svetlana","last_name":"Arifulina"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"},{"id":"1737","full_name":"Soltenborn, Christian","orcid":"0000-0002-0342-8227","last_name":"Soltenborn","first_name":"Christian"}],"date_updated":"2022-01-06T07:02:57Z","doi":"10.14279/tuj.eceasst.47.718","title":"Coverage Criteria for Testing DMM Specifications","has_accepted_license":"1","citation":{"ama":"Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications. In: <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the EASST. ; 2012. doi:<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>","chicago":"Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage Criteria for Testing DMM Specifications.” In <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the EASST, 2012. <a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">https://doi.org/10.14279/tuj.eceasst.47.718</a>.","ieee":"S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing DMM Specifications,” in <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012.","apa":"Arifulina, S., Engels, G., &#38; Soltenborn, C. (2012). Coverage Criteria for Testing DMM Specifications. In <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. <a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">https://doi.org/10.14279/tuj.eceasst.47.718</a>","bibtex":"@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>}, booktitle={Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications of the EASST} }","mla":"Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.” <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012, doi:<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>.","short":"S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012."},"year":"2012"},{"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"623","file_date_updated":"2018-03-15T06:45:25Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","file":[{"file_name":"623-PODC-2012_01.pdf","access_level":"closed","file_id":"1241","file_size":210382,"creator":"florida","date_created":"2018-03-15T06:45:25Z","date_updated":"2018-03-15T06:45:25Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed."}],"author":[{"first_name":"Andrea W.","last_name":"Richa","full_name":"Richa, Andrea W."},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin ","first_name":"Jin "}],"date_created":"2017-10-17T12:42:53Z","date_updated":"2022-01-06T07:02:58Z","doi":"10.1145/2332432.2332488","title":"Competitive and fair throughput for co-existing networks under adversarial interference","has_accepted_license":"1","citation":{"chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 291–300, 2012. <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>. ; 2012:291-300. doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>","apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i> (pp. 291–300). <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300, doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>.","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300."},"page":"291-300","year":"2012"},{"department":[{"_id":"79"}],"user_id":"15504","series_title":"LNCS","_id":"625","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T06:44:09Z","ddc":["040"],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","status":"public","file":[{"date_updated":"2018-03-15T06:44:09Z","creator":"florida","date_created":"2018-03-15T06:44:09Z","file_size":717284,"access_level":"closed","file_id":"1240","file_name":"625-disc12adjBAshort.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.","lang":"eng"}],"author":[{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"full_name":"Avin, Chen","last_name":"Avin","first_name":"Chen"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"full_name":"Häupler, Bernhard","last_name":"Häupler","first_name":"Bernhard"},{"last_name":"Lotker","full_name":"Lotker, Zvi","first_name":"Zvi"}],"date_created":"2017-10-17T12:42:53Z","date_updated":"2022-01-06T07:02:58Z","doi":"10.1007/978-3-642-33651-5_47","title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","has_accepted_license":"1","page":"439-440","citation":{"apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 439–440). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–440.","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 439–40. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>.","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>"},"year":"2012"},{"department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","_id":"6250","language":[{"iso":"eng"}],"publication":"ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences","type":"journal_article","status":"public","volume":"XXXIX-B8","author":[{"last_name":"Paelke","full_name":"Paelke, Volker","first_name":"Volker"},{"last_name":"Nebe","full_name":"Nebe, Karsten","first_name":"Karsten"},{"first_name":"Christian","last_name":"Geiger","full_name":"Geiger, Christian"},{"last_name":"Klompmaker","full_name":"Klompmaker, Florian","first_name":"Florian"},{"last_name":"Fischer","id":"30457","full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard"}],"date_created":"2018-12-18T10:18:13Z","date_updated":"2022-01-06T07:02:58Z","publisher":"Copernicus GmbH","doi":"10.5194/isprsarchives-xxxix-b8-55-2012","title":"Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications","publication_identifier":{"issn":["1682-1777"]},"publication_status":"published","page":"55-60","citation":{"chicago":"Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i> XXXIX-B8 (2012): 55–60. <a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012</a>.","ieee":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications,” <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>, vol. XXXIX-B8, pp. 55–60, 2012.","ama":"Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>. 2012;XXXIX-B8:55-60. doi:<a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">10.5194/isprsarchives-xxxix-b8-55-2012</a>","bibtex":"@article{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications}, volume={XXXIX-B8}, DOI={<a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">10.5194/isprsarchives-xxxix-b8-55-2012</a>}, journal={ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences}, publisher={Copernicus GmbH}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={55–60} }","short":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012) 55–60.","mla":"Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>, vol. XXXIX-B8, Copernicus GmbH, 2012, pp. 55–60, doi:<a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">10.5194/isprsarchives-xxxix-b8-55-2012</a>.","apa":"Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., &#38; Fischer, H. G. (2012). Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>, <i>XXXIX</i>-<i>B8</i>, 55–60. <a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012</a>"},"year":"2012"},{"abstract":[{"lang":"eng","text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT)."}],"status":"public","file":[{"file_size":184095,"access_level":"closed","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","file_id":"1239","date_updated":"2018-03-15T06:42:40Z","date_created":"2018-03-15T06:42:40Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-15T06:42:40Z","_id":"626","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"15504","series_title":"LNCS","year":"2012","page":"435-436","citation":{"ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>.","ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–436.","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>.","apa":"Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 435–436). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>"},"has_accepted_license":"1","title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","doi":"10.1007/978-3-642-33651-5_45","date_updated":"2022-01-06T07:02:59Z","date_created":"2017-10-17T12:42:54Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"627","user_id":"477","series_title":"LNCS","department":[{"_id":"77"}],"file_date_updated":"2018-03-15T06:46:05Z","type":"conference","status":"public","date_updated":"2022-01-06T07:02:59Z","author":[{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"}],"doi":"10.1007/978-3-642-28756-5_41","has_accepted_license":"1","citation":{"chicago":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 531–33. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">https://doi.org/10.1007/978-3-642-28756-5_41</a>.","ieee":"D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 2012, pp. 531–533.","ama":"Wonisch D. Block Abstraction Memoization for CPAchecker. In: <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>. LNCS. ; 2012:531-533. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>","apa":"Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i> (pp. 531–533). <a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">https://doi.org/10.1007/978-3-642-28756-5_41</a>","short":"D. Wonisch, in: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533.","bibtex":"@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>}, booktitle={Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel}, year={2012}, pages={531–533}, collection={LNCS} }","mla":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 2012, pp. 531–33, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>."},"page":"531-533","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","abstract":[{"text":"Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":184000,"file_name":"627-WonischSV-Comp2012_01.pdf","access_level":"closed","file_id":"1242","date_updated":"2018-03-15T06:46:05Z","creator":"florida","date_created":"2018-03-15T06:46:05Z"}],"date_created":"2017-10-17T12:42:54Z","title":"Block Abstraction Memoization for CPAchecker","year":"2012"},{"abstract":[{"text":"Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers.","lang":"eng"}],"status":"public","file":[{"creator":"florida","date_created":"2018-03-15T06:42:01Z","date_updated":"2018-03-15T06:42:01Z","access_level":"closed","file_id":"1238","file_name":"628-FULL_paper_bncs_with_interests.pdf","file_size":300591,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-15T06:42:01Z","language":[{"iso":"eng"}],"_id":"628","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"477","series_title":"LNCS","year":"2012","page":"72--83","citation":{"apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., &#38; Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 72--83). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>","short":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>.","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }","ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 72--83. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>.","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:72--83. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>"},"has_accepted_license":"1","title":"Basic Network Creation Games with Communication Interests","doi":"10.1007/978-3-642-33996-7_7","date_updated":"2022-01-06T07:02:59Z","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"first_name":"Martina","last_name":"Huellmann (married name: Eikel)","full_name":"Huellmann (married name: Eikel), Martina"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"date_created":"2017-10-17T12:42:54Z"},{"publisher":"IARIA","date_updated":"2022-01-06T07:02:59Z","date_created":"2018-12-18T12:49:38Z","author":[{"full_name":"Paelke, Volker","last_name":"Paelke","first_name":"Volker"},{"full_name":"Nebe, Karsten","last_name":"Nebe","first_name":"Karsten"},{"first_name":"Christian","full_name":"Geiger, Christian","last_name":"Geiger"},{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"},{"first_name":"Holger Gerhard","last_name":"Fischer","id":"30457","full_name":"Fischer, Holger Gerhard"}],"title":"Designing Multi-Modal Map-Based Interfaces for Disaster Management","year":"2012","citation":{"short":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, in: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 95–100.","mla":"Paelke, Volker, et al. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, IARIA, 2012, pp. 95–100.","bibtex":"@inproceedings{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Designing Multi-Modal Map-Based Interfaces for Disaster Management}, booktitle={Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}, publisher={IARIA}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={95–100} }","apa":"Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., &#38; Fischer, H. G. (2012). Designing Multi-Modal Map-Based Interfaces for Disaster Management. In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i> (pp. 95–100). IARIA.","ieee":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Designing Multi-Modal Map-Based Interfaces for Disaster Management,” in <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 2012, pp. 95–100.","chicago":"Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 95–100. IARIA, 2012.","ama":"Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Designing Multi-Modal Map-Based Interfaces for Disaster Management. In: <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>. IARIA; 2012:95-100."},"page":"95-100","_id":"6285","user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)","status":"public"},{"title":"Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops","author":[{"last_name":"Klompmaker","full_name":"Klompmaker, Florian","first_name":"Florian"},{"first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer"},{"first_name":"Helge","last_name":"Jung","full_name":"Jung, Helge"}],"date_created":"2018-12-18T12:50:15Z","date_updated":"2022-01-06T07:02:59Z","publisher":"IARIA","citation":{"ama":"Klompmaker F, Fischer HG, Jung H. Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In: <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>. IARIA; 2012:141-144.","ieee":"F. Klompmaker, H. G. Fischer, and H. Jung, “Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops,” in <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 2012, pp. 141–144.","chicago":"Klompmaker, Florian, Holger Gerhard Fischer, and Helge Jung. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 141–44. IARIA, 2012.","bibtex":"@inproceedings{Klompmaker_Fischer_Jung_2012, title={Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops}, booktitle={Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}, publisher={IARIA}, author={Klompmaker, Florian and Fischer, Holger Gerhard and Jung, Helge}, year={2012}, pages={141–144} }","mla":"Klompmaker, Florian, et al. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, IARIA, 2012, pp. 141–44.","short":"F. Klompmaker, H.G. Fischer, H. Jung, in: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 141–144.","apa":"Klompmaker, F., Fischer, H. G., &#38; Jung, H. (2012). Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i> (pp. 141–144). IARIA."},"page":"141-144","year":"2012","language":[{"iso":"eng"}],"user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"_id":"6286","status":"public","type":"conference","publication":"Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)"},{"publication_identifier":{"isbn":["9781450311687"]},"publication_status":"published","citation":{"ieee":"H. G. Fischer, “Integrating usability engineering in the software development lifecycle based on international standards,” in <i>Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12</i>, 2012.","chicago":"Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” In <i>Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12</i>. ACM Press, 2012. <a href=\"https://doi.org/10.1145/2305484.2305541\">https://doi.org/10.1145/2305484.2305541</a>.","ama":"Fischer HG. Integrating usability engineering in the software development lifecycle based on international standards. In: <i>Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12</i>. ACM Press; 2012. doi:<a href=\"https://doi.org/10.1145/2305484.2305541\">10.1145/2305484.2305541</a>","mla":"Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” <i>Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12</i>, ACM Press, 2012, doi:<a href=\"https://doi.org/10.1145/2305484.2305541\">10.1145/2305484.2305541</a>.","short":"H.G. Fischer, in: Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12, ACM Press, 2012.","bibtex":"@inproceedings{Fischer_2012, title={Integrating usability engineering in the software development lifecycle based on international standards}, DOI={<a href=\"https://doi.org/10.1145/2305484.2305541\">10.1145/2305484.2305541</a>}, booktitle={Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12}, publisher={ACM Press}, author={Fischer, Holger Gerhard}, year={2012} }","apa":"Fischer, H. G. (2012). Integrating usability engineering in the software development lifecycle based on international standards. In <i>Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12</i>. ACM Press. <a href=\"https://doi.org/10.1145/2305484.2305541\">https://doi.org/10.1145/2305484.2305541</a>"},"year":"2012","date_created":"2018-12-18T12:52:11Z","author":[{"first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer"}],"publisher":"ACM Press","date_updated":"2022-01-06T07:03:00Z","doi":"10.1145/2305484.2305541","title":"Integrating usability engineering in the software development lifecycle based on international standards","publication":"Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12","type":"conference","status":"public","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","_id":"6288","language":[{"iso":"eng"}]},{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"629","language":[{"iso":"ger"}],"citation":{"short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012.","mla":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","bibtex":"@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }","apa":"Schleiter, P. (2012). <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn.","ama":"Schleiter P. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn; 2012.","chicago":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","ieee":"P. Schleiter, <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012."},"year":"2012","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"first_name":"Patrick","full_name":"Schleiter, Patrick","last_name":"Schleiter"}],"date_created":"2017-10-17T12:42:54Z","date_updated":"2022-01-06T07:03:00Z","publisher":"Universität Paderborn","title":"Attribute-basierte Verschlüsselung"},{"status":"public","publication":"Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","_id":"6290","citation":{"bibtex":"@inproceedings{Fischer_Klompmaker_2012, title={Enriching Disaster Control Management based on Human-Computer Design}, booktitle={Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)}, publisher={ISCRAM Digital Library}, author={Fischer, Holger Gerhard and Klompmaker, Florian}, year={2012} }","mla":"Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>, ISCRAM Digital Library, 2012.","short":"H.G. Fischer, F. Klompmaker, in: Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), ISCRAM Digital Library, 2012.","apa":"Fischer, H. G., &#38; Klompmaker, F. (2012). Enriching Disaster Control Management based on Human-Computer Design. In <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>. ISCRAM Digital Library.","ama":"Fischer HG, Klompmaker F. Enriching Disaster Control Management based on Human-Computer Design. In: <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>. ISCRAM Digital Library; 2012.","ieee":"H. G. Fischer and F. Klompmaker, “Enriching Disaster Control Management based on Human-Computer Design,” in <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>, 2012.","chicago":"Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” In <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>. ISCRAM Digital Library, 2012."},"year":"2012","title":"Enriching Disaster Control Management based on Human-Computer Design","author":[{"full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer","first_name":"Holger Gerhard"},{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"}],"date_created":"2018-12-18T12:52:45Z","date_updated":"2022-01-06T07:03:00Z","publisher":"ISCRAM Digital Library"},{"status":"public","publication":"Jahresband Usability Professionals","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","_id":"6291","page":"160-165","citation":{"ama":"Fischer HG, Geis T, Kluge O, Bogner C, Polkehn K. Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In: <i>Jahresband Usability Professionals</i>. German UPA; 2012:160-165.","chicago":"Fischer, Holger Gerhard, Thomas Geis, Oliver Kluge, Christian Bogner, and Knut Polkehn. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” In <i>Jahresband Usability Professionals</i>, 160–65. German UPA, 2012.","ieee":"H. G. Fischer, T. Geis, O. Kluge, C. Bogner, and K. Polkehn, “Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten,” in <i>Jahresband Usability Professionals</i>, 2012, pp. 160–165.","apa":"Fischer, H. G., Geis, T., Kluge, O., Bogner, C., &#38; Polkehn, K. (2012). Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In <i>Jahresband Usability Professionals</i> (pp. 160–165). German UPA.","mla":"Fischer, Holger Gerhard, et al. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” <i>Jahresband Usability Professionals</i>, German UPA, 2012, pp. 160–65.","bibtex":"@inproceedings{Fischer_Geis_Kluge_Bogner_Polkehn_2012, title={Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}, booktitle={Jahresband Usability Professionals}, publisher={German UPA}, author={Fischer, Holger Gerhard and Geis, Thomas and Kluge, Oliver and Bogner, Christian and Polkehn, Knut}, year={2012}, pages={160–165} }","short":"H.G. Fischer, T. Geis, O. Kluge, C. Bogner, K. Polkehn, in: Jahresband Usability Professionals, German UPA, 2012, pp. 160–165."},"year":"2012","title":"Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten","author":[{"first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457"},{"last_name":"Geis","full_name":"Geis, Thomas","first_name":"Thomas"},{"full_name":"Kluge, Oliver","last_name":"Kluge","first_name":"Oliver"},{"first_name":"Christian","full_name":"Bogner, Christian","last_name":"Bogner"},{"full_name":"Polkehn, Knut","last_name":"Polkehn","first_name":"Knut"}],"date_created":"2018-12-18T12:53:45Z","publisher":"German UPA","date_updated":"2022-01-06T07:03:00Z"},{"abstract":[{"lang":"eng","text":"Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist. Thus, a reverse engineering step is needed that recovers the system’s components, subsystems and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system’s code base, e.g., they lead to wrong component structures. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"630-CSMR2012-PlateniusDettenBecker.pdf","file_id":"1236","file_size":723739,"creator":"florida","date_created":"2018-03-15T06:37:13Z","date_updated":"2018-03-15T06:37:13Z"}],"status":"public","type":"conference","publication":"Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)","ddc":["040"],"file_date_updated":"2018-03-15T06:37:13Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"630","user_id":"477","department":[{"_id":"76"}],"year":"2012","citation":{"apa":"Platenius, M. C., von Detten, M., &#38; Becker, S. (2012). Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i> (pp. 255–264). <a href=\"https://doi.org/10.1109/CSMR.2012.33\">https://doi.org/10.1109/CSMR.2012.33</a>","mla":"Platenius, Marie Christin, et al. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–64, doi:<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>.","bibtex":"@inproceedings{Platenius_von Detten_Becker_2012, title={Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}, DOI={<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>}, booktitle={Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}, author={Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}, year={2012}, pages={255–264} }","short":"M.C. Platenius, M. von Detten, S. Becker, in: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264.","ama":"Platenius MC, von Detten M, Becker S. Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In: <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>. ; 2012:255-264. doi:<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>","chicago":"Platenius, Marie Christin, Markus von Detten, and Steffen Becker. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” In <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 255–64, 2012. <a href=\"https://doi.org/10.1109/CSMR.2012.33\">https://doi.org/10.1109/CSMR.2012.33</a>.","ieee":"M. C. Platenius, M. von Detten, and S. Becker, “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies,” in <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–264."},"page":"255-264","has_accepted_license":"1","title":"Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies","doi":"10.1109/CSMR.2012.33","date_updated":"2022-01-06T07:03:00Z","author":[{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"full_name":"von Detten, Markus","last_name":"von Detten","first_name":"Markus"},{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"}],"date_created":"2017-10-17T12:42:54Z"}]