[{"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":518982,"file_name":"572-MODELS2012-Huma_Gerth_Engels_Juwig.pdf","file_id":"1270","access_level":"closed","date_updated":"2018-03-15T09:38:22Z","date_created":"2018-03-15T09:38:22Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers.However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners."}],"publication":"Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)","type":"conference","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T09:38:22Z","ddc":["040"],"department":[{"_id":"66"}],"series_title":"LNCS","user_id":"477","_id":"572","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"page":"709--725","citation":{"apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2012). Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i> (pp. 709--725). <a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">https://doi.org/10.1007/978-3-642-33666-9_45</a>","mla":"Huma, Zille, et al. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>, 2012, pp. 709--725, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">10.1007/978-3-642-33666-9_45</a>.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={LNCS}, title={Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">10.1007/978-3-642-33666-9_45</a>}, booktitle={Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={709--725}, collection={LNCS} }","short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS), 2012, pp. 709--725.","ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Towards an Automatic Service Discovery for UML-based Rich Service Descriptions,” in <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>, 2012, pp. 709--725.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” In <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>, 709--725. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">https://doi.org/10.1007/978-3-642-33666-9_45</a>.","ama":"Huma Z, Gerth C, Engels G, Juwig O. Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In: <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>. LNCS. ; 2012:709--725. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">10.1007/978-3-642-33666-9_45</a>"},"year":"2012","has_accepted_license":"1","doi":"10.1007/978-3-642-33666-9_45","title":"Towards an Automatic Service Discovery for UML-based Rich Service Descriptions","date_created":"2017-10-17T12:42:43Z","author":[{"last_name":"Huma","full_name":"Huma, Zille","first_name":"Zille"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"},{"first_name":"Oliver","full_name":"Juwig, Oliver","last_name":"Juwig"}],"date_updated":"2022-01-06T07:02:37Z"},{"date_updated":"2022-01-06T07:02:37Z","author":[{"first_name":"Svetlana","full_name":"Arifulina, Svetlana","last_name":"Arifulina"}],"has_accepted_license":"1","citation":{"apa":"Arifulina, S. (2012). Towards a Framework for the Integration of Modeling Languages. In U. W. Eisenecker &#38; C. Bucholdt (Eds.), <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i> (pp. 23--26).","short":"S. Arifulina, in: U. W. Eisenecker, C. Bucholdt (Eds.), Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)), 2012, pp. 23--26.","mla":"Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.” <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>, edited by Ulrich W. Eisenecker and Christian Bucholdt, 2012, pp. 23--26.","bibtex":"@inproceedings{Arifulina_2012, series={CEUR Workshop Proceedings}, title={Towards a Framework for the Integration of Modeling Languages}, booktitle={Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}, author={Arifulina, Svetlana}, editor={W. Eisenecker, Ulrich and Bucholdt, ChristianEditors}, year={2012}, pages={23--26}, collection={CEUR Workshop Proceedings} }","ieee":"S. Arifulina, “Towards a Framework for the Integration of Modeling Languages,” in <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>, 2012, pp. 23--26.","chicago":"Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.” In <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>, edited by Ulrich W. Eisenecker and Christian Bucholdt, 23--26. CEUR Workshop Proceedings, 2012.","ama":"Arifulina S. Towards a Framework for the Integration of Modeling Languages. In: W. Eisenecker U, Bucholdt C, eds. <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>. CEUR Workshop Proceedings. ; 2012:23--26."},"page":"23--26","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"573","series_title":"CEUR Workshop Proceedings","user_id":"477","department":[{"_id":"66"}],"file_date_updated":"2018-03-15T09:37:48Z","type":"conference","editor":[{"last_name":"W. Eisenecker","full_name":"W. Eisenecker, Ulrich","first_name":"Ulrich"},{"first_name":"Christian","full_name":"Bucholdt, Christian","last_name":"Bucholdt"}],"status":"public","date_created":"2017-10-17T12:42:43Z","title":"Towards a Framework for the Integration of Modeling Languages","year":"2012","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))","abstract":[{"lang":"eng","text":"In software markets of the future, customer-specific software will be developed on demand from distributed software and hardware services available on world-wide markets. Having a request, services have to be automatically discovered and composed. For that purpose, services have to be matched based on their specifications. For the accurate matching, services have to be described comprehensively that requires the integration of different domain-specific languages (DSLs) used for functional, non-functional, and infrastructural properties. Since different service providers use plenty of language dialects to model the same service property, their integration is needed for the matching. In this paper, we propose a framework for integration of DSLs. It is based on a parameterized abstract core language that integrates key concepts needed to describe a service. Parts of the core language can be substituted with concrete DSLs. Thus, the framework serves as a basis for the comprehensive specification and automatic matching of services."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1269","access_level":"closed","file_name":"573-Framework_for_Integration_of_Modeling_Languages.pdf","file_size":321930,"date_created":"2018-03-15T09:37:48Z","creator":"florida","date_updated":"2018-03-15T09:37:48Z"}]},{"file_date_updated":"2018-03-15T09:09:29Z","ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"574","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T09:09:29Z","creator":"florida","date_created":"2018-03-15T09:09:29Z","file_size":315843,"file_id":"1268","file_name":"574-tiara.pdf","access_level":"closed"}],"status":"public","abstract":[{"lang":"eng","text":"We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization."}],"type":"journal_article","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2011.12.079","title":"Tiara: A self-stabilizing deterministic skip list and skip graph","date_created":"2017-10-17T12:42:44Z","author":[{"last_name":"Clouser","full_name":"Clouser, Thomas","first_name":"Thomas"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"publisher":"Elsevier","date_updated":"2022-01-06T07:02:38Z","citation":{"short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.","bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, Elsevier, 2012, pp. 18–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>.","apa":"Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” <i>Theoretical Computer Science</i>, pp. 18–35, 2012.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, 2012, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>. 2012:18-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>"},"page":"18-35","year":"2012","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"user_id":"8447","department":[{"_id":"66"}],"_id":"5753","status":"public","type":"conference","publication":"Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012","doi":"10.1145/2446224.2446228","title":"Model-driven specification of adaptive cloud-based systems","date_created":"2018-11-19T15:18:29Z","author":[{"first_name":"Benjamin","last_name":"Nagel","full_name":"Nagel, Benjamin"},{"first_name":"Christian","last_name":"Gerth","full_name":"Gerth, Christian"},{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"full_name":"Christ, Fabian","last_name":"Christ","first_name":"Fabian"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"date_updated":"2022-01-06T07:02:38Z","citation":{"ama":"Nagel B, Gerth C, Yigitbas E, Christ F, Engels G. Model-driven specification of adaptive cloud-based systems. In: <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>. ; 2012:4. doi:<a href=\"https://doi.org/10.1145/2446224.2446228\">10.1145/2446224.2446228</a>","ieee":"B. Nagel, C. Gerth, E. Yigitbas, F. Christ, and G. Engels, “Model-driven specification of adaptive cloud-based systems,” in <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>, 2012, p. 4.","chicago":"Nagel, Benjamin, Christian Gerth, Enes Yigitbas, Fabian Christ, and Gregor Engels. “Model-Driven Specification of Adaptive Cloud-Based Systems.” In <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>, 4, 2012. <a href=\"https://doi.org/10.1145/2446224.2446228\">https://doi.org/10.1145/2446224.2446228</a>.","apa":"Nagel, B., Gerth, C., Yigitbas, E., Christ, F., &#38; Engels, G. (2012). Model-driven specification of adaptive cloud-based systems. In <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i> (p. 4). <a href=\"https://doi.org/10.1145/2446224.2446228\">https://doi.org/10.1145/2446224.2446228</a>","short":"B. Nagel, C. Gerth, E. Yigitbas, F. Christ, G. Engels, in: Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 2012, p. 4.","bibtex":"@inproceedings{Nagel_Gerth_Yigitbas_Christ_Engels_2012, title={Model-driven specification of adaptive cloud-based systems}, DOI={<a href=\"https://doi.org/10.1145/2446224.2446228\">10.1145/2446224.2446228</a>}, booktitle={Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012}, author={Nagel, Benjamin and Gerth, Christian and Yigitbas, Enes and Christ, Fabian and Engels, Gregor}, year={2012}, pages={4} }","mla":"Nagel, Benjamin, et al. “Model-Driven Specification of Adaptive Cloud-Based Systems.” <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>, 2012, p. 4, doi:<a href=\"https://doi.org/10.1145/2446224.2446228\">10.1145/2446224.2446228</a>."},"page":"4","year":"2012"},{"type":"mastersthesis","year":"2012","citation":{"apa":"Yigitbas, E. (2012). <i>Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen</i>.","bibtex":"@book{Yigitbas_2012, title={Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen}, author={Yigitbas, Enes}, year={2012} }","mla":"Yigitbas, Enes. <i>Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen</i>. 2012.","short":"E. Yigitbas, Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen, 2012.","ama":"Yigitbas E. <i>Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen</i>.; 2012.","ieee":"E. Yigitbas, <i>Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen</i>. 2012.","chicago":"Yigitbas, Enes. <i>Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen</i>, 2012."},"status":"public","date_updated":"2022-01-06T07:02:38Z","_id":"5760","user_id":"8447","author":[{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"}],"date_created":"2018-11-19T15:29:59Z","department":[{"_id":"66"}],"title":"Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen","language":[{"iso":"eng"}]},{"_id":"577","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-21T13:09:19Z","type":"conference_editor","editor":[{"first_name":"Andrea W.","last_name":"Richa","full_name":"Richa, Andrea W."},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"abstract":[{"lang":"eng","text":"SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems."}],"status":"public","file":[{"file_id":"1569","file_name":"577-SSS2012Richa-Scheideler.pdf","access_level":"closed","file_size":169564,"creator":"florida","date_created":"2018-03-21T13:09:19Z","date_updated":"2018-03-21T13:09:19Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T07:02:39Z","date_created":"2017-10-17T12:42:44Z","title":"Stabilization, Safety, and Security of Distributed Systems","conference":{"end_date":"2012-10-04","location":"Paderborn, Germany","name":"Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2012-10-01"},"doi":"10.1007/978-3-642-33536-5","has_accepted_license":"1","year":"2012","citation":{"ieee":"A. W. Richa and C. Scheideler, Eds., <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012.","chicago":"Richa, Andrea W., and Christian Scheideler, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>.","ama":"Richa AW, Scheideler C, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>.; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>","short":"A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012.","bibtex":"@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>}, year={2012} }","mla":"Richa, Andrea W., and Christian Scheideler, editors. <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>.","apa":"Richa, A. W., &#38; Scheideler, C. (Eds.). (2012). <i>Stabilization, Safety, and Security of Distributed Systems</i>. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>"}},{"ddc":["040"],"file_date_updated":"2018-03-15T09:04:58Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"579","user_id":"477","department":[{"_id":"79"},{"_id":"63"}],"abstract":[{"lang":"eng","text":"A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space."}],"file":[{"access_level":"closed","file_id":"1266","file_name":"579-a30-damerow.pdf","file_size":329282,"creator":"florida","date_created":"2018-03-15T09:04:58Z","date_updated":"2018-03-15T09:04:58Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"journal_article","publication":"Transactions on Algorithms","title":"Smoothed analysis of left-to-right maxima with applications","doi":"10.1145/2229163.2229174","date_updated":"2022-01-06T07:02:41Z","publisher":"ACM","author":[{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"full_name":"Manthey, Bodo","last_name":"Manthey","first_name":"Bodo"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"full_name":"Tantau, Till","last_name":"Tantau","first_name":"Till"}],"date_created":"2017-10-17T12:42:45Z","year":"2012","citation":{"apa":"Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., &#38; Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>, (3), 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>","bibtex":"@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }","short":"V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.","mla":"Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3, ACM, 2012, p. 30, doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>.","ama":"Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>. 2012;(3):30. doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>","chicago":"Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3 (2012): 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>.","ieee":"V. Damerow <i>et al.</i>, “Smoothed analysis of left-to-right maxima with applications,” <i>Transactions on Algorithms</i>, no. 3, p. 30, 2012."},"page":"30","has_accepted_license":"1","issue":"3"},{"type":"conference","publication":"Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)","file":[{"date_created":"2018-03-15T09:03:39Z","creator":"florida","date_updated":"2018-03-15T09:03:39Z","access_level":"closed","file_id":"1265","file_name":"580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf","file_size":325939,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\\alpha}+\\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \\emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\\alpha^{\\alpha}+2e\\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \\cite{Chan:2010} we transfer our results to processors with a fixed maximum speed.","lang":"eng"}],"editor":[{"full_name":"Even, Guy","last_name":"Even","first_name":"Guy"},{"first_name":"Dror","full_name":"Rawitz, Dror","last_name":"Rawitz"}],"series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"580","file_date_updated":"2018-03-15T09:03:39Z","language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"short":"A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.","bibtex":"@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS}, title={Slow Down &#38; Sleep for Profit in Online Deadline Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>}, booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}, author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}, editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS} }","mla":"Cord-Landwehr, Andreas, et al. “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling.” <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>.","apa":"Cord-Landwehr, A., Kling, P., &#38; Mallmann Trenn, F. (2012). Slow Down &#38; Sleep for Profit in Online Deadline Scheduling. In G. Even &#38; D. Rawitz (Eds.), <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i> (pp. 218–231). <a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">https://doi.org/10.1007/978-3-642-34862-4_17</a>","ama":"Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down &#38; Sleep for Profit in Online Deadline Scheduling. In: Even G, Rawitz D, eds. <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>. LNCS. ; 2012:218-231. doi:<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>","chicago":"Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling.” In <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 218–31. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">https://doi.org/10.1007/978-3-642-34862-4_17</a>.","ieee":"A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling,” in <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, 2012, pp. 218–231."},"page":"218-231","year":"2012","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"first_name":"Fredrik","last_name":"Mallmann Trenn","full_name":"Mallmann Trenn, Fredrik"}],"date_created":"2017-10-17T12:42:45Z","date_updated":"2022-01-06T07:02:42Z","doi":"10.1007/978-3-642-34862-4_17","title":"Slow Down & Sleep for Profit in Online Deadline Scheduling"},{"title":"Self-Organizing Particle Systems","doi":"10.1109/IPDPS.2012.116","date_updated":"2022-01-06T07:02:42Z","date_created":"2017-10-17T12:42:45Z","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"first_name":"Martina","last_name":"Hüllmann (married name: Eikel)","full_name":"Hüllmann (married name: Eikel), Martina"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"year":"2012","citation":{"apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &#38; Scheideler, C. (2012). Self-Organizing Particle Systems. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1272–1283). <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>","short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–83, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>.","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }","ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1272-1283. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>","ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–1283.","chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1272–83, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>."},"page":"1272-1283","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T08:39:33Z","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"581","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"abstract":[{"lang":"eng","text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf","access_level":"closed","file_id":"1263","file_size":373131,"creator":"florida","date_created":"2018-03-15T08:39:33Z","date_updated":"2018-03-15T08:39:33Z"}],"status":"public","type":"conference","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"582","citation":{"chicago":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ieee":"T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ama":"Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn; 2012.","apa":"Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn.","short":"T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012.","bibtex":"@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }","mla":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012."},"year":"2012","title":"Self-Optimizing Binary Search Trees - A Game Theoretic Approach","author":[{"full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_created":"2017-10-17T12:42:45Z","date_updated":"2022-01-06T07:02:42Z","publisher":"Universität Paderborn"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"75"}],"user_id":"15504","_id":"584","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Hohenberger T. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn; 2012.","chicago":"Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","ieee":"T. Hohenberger, <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","short":"T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität Paderborn, 2012.","mla":"Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","bibtex":"@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations}, publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }","apa":"Hohenberger, T. (2012). <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn."},"year":"2012","author":[{"last_name":"Hohenberger","full_name":"Hohenberger, Till","first_name":"Till"}],"date_created":"2017-10-17T12:42:46Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:43Z","title":"Queuing Latency at Cooperative Base Stations"},{"main_file_link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423","open_access":"1"}],"supervisor":[{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"}],"author":[{"full_name":"Drzevitzky, Stephanie","last_name":"Drzevitzky","first_name":"Stephanie"}],"oa":"1","date_updated":"2022-01-06T07:02:44Z","citation":{"short":"S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security, Universität Paderborn, 2012.","bibtex":"@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky, Stephanie}, year={2012} }","mla":"Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","apa":"Drzevitzky, S. (2012). <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn.","ama":"Drzevitzky S. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn; 2012.","ieee":"S. Drzevitzky, <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","chicago":"Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012."},"page":"114","publication_status":"published","has_accepted_license":"1","file_date_updated":"2018-03-15T08:38:19Z","user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"586","status":"public","type":"dissertation","title":"Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security","date_created":"2017-10-17T12:42:46Z","publisher":"Universität Paderborn","year":"2012","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1438436,"file_id":"1261","file_name":"586-Drzevitzky-PhD_01.pdf","access_level":"closed","date_updated":"2018-03-15T08:38:19Z","creator":"florida","date_created":"2018-03-15T08:38:19Z"}],"abstract":[{"lang":"eng","text":"FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety."},{"text":"FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor. Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten, einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen zur Speichersicherheit.","lang":"ger"}]},{"type":"misc","file":[{"date_created":"2018-03-15T08:37:02Z","creator":"florida","date_updated":"2018-03-15T08:37:02Z","access_level":"closed","file_name":"587-2012_plessl_awareness_magazine.pdf","file_id":"1260","file_size":353057,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","user_id":"398","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"587","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:37:02Z","ddc":["040"],"has_accepted_license":"1","citation":{"apa":"Plessl, C., Platzner, M., Agne, A., Happe, M., &#38; Lübbers, E. (2012). <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine.","mla":"Plessl, Christian, et al. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","bibtex":"@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine}, author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}, year={2012} }","short":"C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012.","ama":"Plessl C, Platzner M, Agne A, Happe M, Lübbers E. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine; 2012.","chicago":"Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","ieee":"C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine, 2012."},"year":"2012","author":[{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"first_name":"Enno","last_name":"Lübbers","full_name":"Lübbers, Enno"}],"date_created":"2017-10-17T12:42:46Z","publisher":"Awareness Magazine","date_updated":"2022-01-06T07:02:44Z","title":"Programming models for reconfigurable heterogeneous multi-cores"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:33:56Z","_id":"590","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","series_title":"LNCS","abstract":[{"text":"Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”.","lang":"eng"}],"status":"public","file":[{"date_updated":"2018-03-15T08:33:56Z","creator":"florida","date_created":"2018-03-15T08:33:56Z","file_size":320901,"file_name":"590-WonischWehrheim2012.pdf","access_level":"closed","file_id":"1258","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","type":"conference","title":"Predicate Analysis with Block-Abstraction Memoization","doi":"10.1007/978-3-642-34281-3_24","date_updated":"2022-01-06T07:02:46Z","date_created":"2017-10-17T12:42:47Z","author":[{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"year":"2012","page":"332-347","citation":{"ama":"Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization. In: <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>. LNCS. ; 2012:332-347. doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">10.1007/978-3-642-34281-3_24</a>","chicago":"Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 332–47. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">https://doi.org/10.1007/978-3-642-34281-3_24</a>.","ieee":"D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,” in <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 332–347.","bibtex":"@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis with Block-Abstraction Memoization}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">10.1007/978-3-642-34281-3_24</a>}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347}, collection={LNCS} }","short":"D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.","mla":"Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 332–47, doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">10.1007/978-3-642-34281-3_24</a>.","apa":"Wonisch, D., &#38; Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction Memoization. In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i> (pp. 332–347). <a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">https://doi.org/10.1007/978-3-642-34281-3_24</a>"},"has_accepted_license":"1"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"593","user_id":"477","department":[{"_id":"75"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T07:02:47Z","publisher":"Universität Paderborn","author":[{"full_name":"Rojahn, Tobias","last_name":"Rojahn","first_name":"Tobias"}],"date_created":"2017-10-17T12:42:47Z","title":"Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten","year":"2012","citation":{"apa":"Rojahn, T. (2012). <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn.","mla":"Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","short":"T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten, Universität Paderborn, 2012.","bibtex":"@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2012} }","ama":"Rojahn T. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn; 2012.","ieee":"T. Rojahn, <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","chicago":"Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012."}},{"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"date_updated":"2018-03-15T08:16:44Z","date_created":"2018-03-15T08:16:44Z","creator":"florida","file_size":3805310,"file_name":"601-Kempkes-PhD.pdf","file_id":"1252","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","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."}],"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"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_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":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, 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.","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.","ieee":"B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302. 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.","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."},"publication_identifier":{"isbn":["978-3-942647-21-2"]},"has_accepted_license":"1"},{"has_accepted_license":"1","citation":{"ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012.","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.","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} }","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.","short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, 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."},"year":"2012","date_created":"2017-10-17T12:42:49Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","type":"report","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":717326,"access_level":"closed","file_name":"underlayMod2.pdf","file_id":"1205","date_updated":"2018-03-09T09:57:26Z","date_created":"2018-03-09T09:57:26Z","creator":"hkarl"}],"status":"public","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."}],"user_id":"126","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"603","file_date_updated":"2018-03-09T09:57:26Z","ddc":["000"]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"606","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"13703","year":"2012","citation":{"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.","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.","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.","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} }","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.","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.","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."},"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","date_updated":"2022-01-06T07:02:51Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:42:50Z","author":[{"full_name":"Löken, Nils","id":"13703","last_name":"Löken","first_name":"Nils"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"607","citation":{"ama":"Haarhoff T. <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.","chicago":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. 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} }","short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn."},"year":"2012","title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","author":[{"last_name":"Haarhoff","full_name":"Haarhoff, Thomas","first_name":"Thomas"}],"date_created":"2017-10-17T12:42:50Z","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn"},{"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T08:15:33Z","date_updated":"2018-03-15T08:15:33Z","file_id":"1250","file_name":"608-Timm2013-0main.pdf","access_level":"closed","file_size":396337}],"date_created":"2017-10-17T12:42:50Z","title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","year":"2012","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"608","user_id":"477","series_title":"LNCS","department":[{"_id":"77"}],"file_date_updated":"2018-03-15T08:15:33Z","type":"conference","status":"public","date_updated":"2022-01-06T07:02:52Z","author":[{"last_name":"Timm","full_name":"Timm, Nils","first_name":"Nils"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"},{"first_name":"Mike","full_name":"Czech, Mike","last_name":"Czech"}],"doi":"10.1007/978-3-642-34281-3_25","has_accepted_license":"1","citation":{"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>.","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>.","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>"},"page":"348-363"}]