[{"status":"public","publication":"CoRR","type":"journal_article","department":[{"_id":"77"}],"user_id":"29719","_id":"3161","citation":{"chicago":"Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016.","ieee":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation tolerance constraints from verification runs,” <i>CoRR</i>, 2016.","ama":"Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>. 2016.","mla":"Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016.","short":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg, Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016} }","apa":"Isenberg, T., Jakobs, M.-}Christine, Pauck, F., &#38; Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>."},"year":"2016","title":"Deriving approximation tolerance constraints from verification runs","author":[{"last_name":"Isenberg","full_name":"Isenberg, Tobias","first_name":"Tobias"},{"first_name":"Marie{-}Christine","full_name":"Jakobs, Marie{-}Christine","last_name":"Jakobs"},{"last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2018-06-13T07:45:27Z","date_updated":"2022-01-06T06:59:01Z"},{"user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"210","status":"public","type":"mastersthesis","title":"Congestion Games with Mixed Objectives","date_created":"2017-10-17T12:41:33Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"author":[{"full_name":"Leder, Lennart","last_name":"Leder","first_name":"Lennart"}],"date_updated":"2022-01-06T06:54:42Z","publisher":"Universität Paderborn","citation":{"ieee":"L. Leder, <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","chicago":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","ama":"Leder L. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn; 2016.","apa":"Leder, L. (2016). <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn.","mla":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016."},"year":"2016"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:53Z","date_created":"2017-10-17T12:41:33Z","author":[{"last_name":"Porzenheim","full_name":"Porzenheim, Laurens","first_name":"Laurens"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","year":"2016","citation":{"ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016."},"_id":"213","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":"477","type":"bachelorsthesis","status":"public"},{"title":"Commitment Schemes - Definitions, Variants, and Security","author":[{"first_name":"Kai Sören","last_name":"Bemmann","full_name":"Bemmann, Kai Sören"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:33Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:58Z","citation":{"ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016."},"year":"2016","department":[{"_id":"64"}],"user_id":"477","_id":"214","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","type":"bachelorsthesis"},{"title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","doi":"10.1145/2935764.2935783","date_updated":"2022-01-06T06:55:02Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:41:33Z","year":"2016","citation":{"ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427, 2016. <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427.","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>.","apa":"Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427). <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>"},"page":"417--427","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T10:41:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"215","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"file":[{"file_size":352996,"file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","file_id":"1518","access_level":"closed","date_updated":"2018-03-21T10:41:40Z","creator":"florida","date_created":"2018-03-21T10:41:40Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)"},{"_id":"175","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","file_date_updated":"2018-03-21T12:38:40Z","type":"journal_article","status":"public","date_updated":"2022-01-06T06:53:13Z","author":[{"first_name":"Sven","full_name":"Walther, Sven","last_name":"Walther"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"doi":"10.1016/j.scico.2016.04.002","has_accepted_license":"1","page":"2--23","citation":{"ieee":"S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs,” <i>Science of Computer Programming</i>, pp. 2--23, 2016.","chicago":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, 2016, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>.","ama":"Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>. 2016:2--23. doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>","mla":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, Elsevier, 2016, pp. 2--23, doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>.","bibtex":"@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}, DOI={<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>}, journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther, Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }","short":"S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.","apa":"Walther, S., &#38; Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>"},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Science of Computer Programming","abstract":[{"text":"Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.","lang":"eng"}],"file":[{"access_level":"closed","file_id":"1536","file_name":"175-1-s2.0-S0167642316300028-main.pdf","file_size":630739,"date_created":"2018-03-21T12:38:40Z","creator":"florida","date_updated":"2018-03-21T12:38:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publisher":"Elsevier","date_created":"2017-10-17T12:41:26Z","title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs","year":"2016"},{"keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"extern":"1","language":[{"iso":"eng"}],"_id":"17655","user_id":"83983","series_title":"Frontiers in Artificial Intelligence and Applications","department":[{"_id":"63"},{"_id":"541"}],"status":"public","type":"conference","publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","title":"The Game of Reciprocation Habits","doi":"10.3233/978-1-61499-672-9-417","date_updated":"2022-01-06T06:53:16Z","author":[{"first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983"},{"last_name":"de Weerdt","full_name":"de Weerdt, M.M.","first_name":"M.M."},{"first_name":"C.M.","last_name":"Jonker","full_name":"Jonker, C.M."}],"date_created":"2020-08-06T15:20:30Z","volume":"Volume 285: ECAI 2016","year":"2016","citation":{"ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.","chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">https://doi.org/10.3233/978-1-61499-672-9-417</a>.","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>","apa":"Polevoy, G., de Weerdt, M. M., &#38; Jonker, C. M. (2016). The Game of Reciprocation Habits. In <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i> (Vol. Volume 285: ECAI 2016, pp. 417–425). <a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">https://doi.org/10.3233/978-1-61499-672-9-417</a>","short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.","mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume 285: ECAI 2016}, DOI={<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>}, booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence}, author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425}, collection={Frontiers in Artificial Intelligence and Applications} }"},"page":"417-425"},{"keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"extern":"1","language":[{"iso":"eng"}],"_id":"17656","department":[{"_id":"63"},{"_id":"541"}],"series_title":"AAMAS '16","user_id":"83983","status":"public","publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems","type":"conference","title":"The Convergence of Reciprocation","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","date_updated":"2022-01-06T06:53:16Z","date_created":"2020-08-06T15:20:45Z","author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"},{"first_name":"Mathijs","full_name":"de Weerdt, Mathijs","last_name":"de Weerdt"},{"first_name":"Catholijn","last_name":"Jonker","full_name":"Jonker, Catholijn"}],"year":"2016","place":"Richland, SC","page":"1431-1432","citation":{"apa":"Polevoy, G., de Weerdt, M., &#38; Jonker, C. (2016). The Convergence of Reciprocation. In <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i> (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS ’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432}, collection={AAMAS ’16} }","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.","short":"G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.","ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.","chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, 2016, pp. 1431–1432."},"publication_identifier":{"isbn":["978-1-4503-4239-1"]}},{"series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"177","file_date_updated":"2018-11-02T14:15:18Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"conference","publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","file":[{"file_size":293345,"file_name":"OnTheParameterizedParallelComp.pdf","access_level":"closed","file_id":"5266","date_updated":"2018-11-02T14:15:18Z","creator":"ups","date_created":"2018-11-02T14:15:18Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus."}],"author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N."},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"date_created":"2017-10-17T12:41:26Z","date_updated":"2022-01-06T06:53:17Z","doi":"10.1007/978-3-319-48749-6_35","title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","has_accepted_license":"1","citation":{"apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 477–488). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">https://doi.org/10.1007/978-3-319-48749-6_35</a>","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 477–88, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 477–488.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 477–88. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">https://doi.org/10.1007/978-3-319-48749-6_35</a>.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:477-488. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>"},"page":"477-488","year":"2016"},{"date_created":"2017-10-17T12:41:28Z","date_updated":"2022-01-06T06:53:51Z","doi":"10.1145/2936716","title":"Introduction to the Special Issue on SPAA 2014","issue":"1","has_accepted_license":"1","citation":{"apa":"Meyer auf der Heide, F. (Ed.). (2016). <i>Introduction to the Special Issue on SPAA 2014</i>. <i>Transactions on Parallel Computing (TOPC)</i>. <a href=\"https://doi.org/10.1145/2936716\">https://doi.org/10.1145/2936716</a>","mla":"Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” <i>Transactions on Parallel Computing (TOPC)</i>, no. 1, 2016, doi:<a href=\"https://doi.org/10.1145/2936716\">10.1145/2936716</a>.","bibtex":"@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue on SPAA 2014}, DOI={<a href=\"https://doi.org/10.1145/2936716\">10.1145/2936716</a>}, number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }","short":"F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016.","ieee":"F. Meyer auf der Heide, Ed., <i>Introduction to the Special Issue on SPAA 2014</i>, no. 1. 2016.","chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Introduction to the Special Issue on SPAA 2014</i>. <i>Transactions on Parallel Computing (TOPC)</i>, 2016. <a href=\"https://doi.org/10.1145/2936716\">https://doi.org/10.1145/2936716</a>.","ama":"Meyer auf der Heide F, ed. <i>Introduction to the Special Issue on SPAA 2014</i>.; 2016. doi:<a href=\"https://doi.org/10.1145/2936716\">10.1145/2936716</a>"},"page":"1","year":"2016","user_id":"15504","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"187","file_date_updated":"2018-03-21T12:31:42Z","ddc":["040"],"type":"journal_editor","publication":"Transactions on Parallel Computing (TOPC)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1531","access_level":"closed","file_name":"187-a1-heide.pdf","file_size":34053,"date_created":"2018-03-21T12:31:42Z","creator":"florida","date_updated":"2018-03-21T12:31:42Z"}],"status":"public","editor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}]},{"publication_status":"published","publication_identifier":{"isbn":["978-1-5090-2054-6"]},"year":"2016","citation":{"ama":"Lass M, Leibenger D, Sorge C. Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension. In: <i>Proc. 41st Conference on Local Computer Networks (LCN)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/lcn.2016.11\">10.1109/lcn.2016.11</a>","ieee":"M. Lass, D. Leibenger, and C. Sorge, “Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension,” in <i>Proc. 41st Conference on Local Computer Networks (LCN)</i>, 2016.","chicago":"Lass, Michael, Dominik Leibenger, and Christoph Sorge. “Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension.” In <i>Proc. 41st Conference on Local Computer Networks (LCN)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/lcn.2016.11\">https://doi.org/10.1109/lcn.2016.11</a>.","apa":"Lass, M., Leibenger, D., &#38; Sorge, C. (2016). Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension. In <i>Proc. 41st Conference on Local Computer Networks (LCN)</i>. IEEE. <a href=\"https://doi.org/10.1109/lcn.2016.11\">https://doi.org/10.1109/lcn.2016.11</a>","mla":"Lass, Michael, et al. “Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension.” <i>Proc. 41st Conference on Local Computer Networks (LCN)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/lcn.2016.11\">10.1109/lcn.2016.11</a>.","short":"M. Lass, D. Leibenger, C. Sorge, in: Proc. 41st Conference on Local Computer Networks (LCN), IEEE, 2016.","bibtex":"@inproceedings{Lass_Leibenger_Sorge_2016, title={Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension}, DOI={<a href=\"https://doi.org/10.1109/lcn.2016.11\">10.1109/lcn.2016.11</a>}, booktitle={Proc. 41st Conference on Local Computer Networks (LCN)}, publisher={IEEE}, author={Lass, Michael and Leibenger, Dominik and Sorge, Christoph}, year={2016} }"},"date_updated":"2022-01-06T06:53:56Z","publisher":"IEEE","author":[{"last_name":"Lass","orcid":"0000-0002-5708-7632","full_name":"Lass, Michael","id":"24135","first_name":"Michael"},{"full_name":"Leibenger, Dominik","last_name":"Leibenger","first_name":"Dominik"},{"last_name":"Sorge","full_name":"Sorge, Christoph","first_name":"Christoph"}],"date_created":"2017-07-25T14:36:16Z","title":"Confidentiality and Authenticity for Distributed Version Control Systems - A Mercurial Extension","doi":"10.1109/lcn.2016.11","type":"conference","publication":"Proc. 41st Conference on Local Computer Networks (LCN)","abstract":[{"text":"Version Control Systems (VCS) are a valuable tool for software development\r\nand document management. Both client/server and distributed (Peer-to-Peer)\r\nmodels exist, with the latter (e.g., Git and Mercurial) becoming\r\nincreasingly popular. Their distributed nature introduces complications,\r\nespecially concerning security: it is hard to control the dissemination of\r\ncontents stored in distributed VCS as they rely on replication of complete\r\nrepositories to any involved user.\r\n\r\nWe overcome this issue by designing and implementing a concept for\r\ncryptography-enforced access control which is transparent to the user. Use\r\nof field-tested schemes (end-to-end encryption, digital signatures) allows\r\nfor strong security, while adoption of convergent encryption and\r\ncontent-defined chunking retains storage efficiency. The concept is\r\nseamlessly integrated into Mercurial---respecting its distributed storage\r\nconcept---to ensure practical usability and compatibility to existing\r\ndeployments.","lang":"eng"}],"status":"public","_id":"19","user_id":"24135","department":[{"_id":"27"},{"_id":"518"}],"keyword":["access control","distributed version control systems","mercurial","peer-to-peer","convergent encryption","confidentiality","authenticity"],"language":[{"iso":"eng"}]},{"page":"739-759","citation":{"apa":"Platenius, M. C., Shaker, A., Becker, M., Hüllermeier, E., &#38; Schäfer, W. (2016). Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic. <i>IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017</i>, (8), 739–759. <a href=\"https://doi.org/10.1109/TSE.2016.2632115\">https://doi.org/10.1109/TSE.2016.2632115</a>","short":"M.C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, W. Schäfer, IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017 (2016) 739–759.","bibtex":"@article{Platenius_Shaker_Becker_Hüllermeier_Schäfer_2016, title={Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic}, DOI={<a href=\"https://doi.org/10.1109/TSE.2016.2632115\">10.1109/TSE.2016.2632115</a>}, number={8}, journal={IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017}, publisher={IEEE}, author={Platenius, Marie Christin and Shaker, Ammar and Becker, Matthias and Hüllermeier, Eyke and Schäfer, Wilhelm}, year={2016}, pages={739–759} }","mla":"Platenius, Marie Christin, et al. “Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic.” <i>IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017</i>, no. 8, IEEE, 2016, pp. 739–59, doi:<a href=\"https://doi.org/10.1109/TSE.2016.2632115\">10.1109/TSE.2016.2632115</a>.","ieee":"M. C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, and W. Schäfer, “Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic,” <i>IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017</i>, no. 8, pp. 739–759, 2016.","chicago":"Platenius, Marie Christin, Ammar Shaker, Matthias Becker, Eyke Hüllermeier, and Wilhelm Schäfer. “Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic.” <i>IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017</i>, no. 8 (2016): 739–59. <a href=\"https://doi.org/10.1109/TSE.2016.2632115\">https://doi.org/10.1109/TSE.2016.2632115</a>.","ama":"Platenius MC, Shaker A, Becker M, Hüllermeier E, Schäfer W. Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic. <i>IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017</i>. 2016;(8):739-759. doi:<a href=\"https://doi.org/10.1109/TSE.2016.2632115\">10.1109/TSE.2016.2632115</a>"},"year":"2016","issue":"8","has_accepted_license":"1","doi":"10.1109/TSE.2016.2632115","title":"Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic","author":[{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"first_name":"Ammar","full_name":"Shaker, Ammar","last_name":"Shaker"},{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"},{"last_name":"Schäfer","full_name":"Schäfer, Wilhelm","first_name":"Wilhelm"}],"date_created":"2017-10-17T12:41:29Z","publisher":"IEEE","date_updated":"2022-01-06T06:53:57Z","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":5225413,"access_level":"closed","file_name":"190-07755807.pdf","file_id":"1529","date_updated":"2018-03-21T12:30:31Z","date_created":"2018-03-21T12:30:31Z","creator":"florida"}],"abstract":[{"text":"Today, software components are provided by global markets in the form of services. In order to optimally satisfy service requesters and service providers, adequate techniques for automatic service matching are needed. However, a requester’s requirements may be vague and the information available about a provided service may be incomplete. As a consequence, fuzziness is induced into the matching procedure. The contribution of this paper is the development of a systematic matching procedure that leverages concepts and techniques from fuzzy logic and possibility theory based on our formal distinction between different sources and types of fuzziness in the context of service matching. In contrast to existing methods, our approach is able to deal with imprecision and incompleteness in service specifications and to inform users about the extent of induced fuzziness in order to improve the user’s decision-making. We demonstrate our approach on the example of specifications for service reputation based on ratings given by previous users. Our evaluation based on real service ratings shows the utility and applicability of our approach.","lang":"eng"}],"publication":"IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017","type":"journal_article","file_date_updated":"2018-03-21T12:30:31Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"355"}],"user_id":"15504","_id":"190","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"page":"805-810","citation":{"ama":"Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem. In: <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>. IEEE; 2016:805-810. doi:<a href=\"https://doi.org/10.1109/icdm.2016.0094\">10.1109/icdm.2016.0094</a>","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.” In <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>, 805–10. IEEE, 2016. <a href=\"https://doi.org/10.1109/icdm.2016.0094\">https://doi.org/10.1109/icdm.2016.0094</a>.","ieee":"J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means Problem,” in <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>, Barcelona, Spain, 2016, pp. 805–810.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). A Theoretical Analysis of the Fuzzy K-Means Problem. In <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i> (pp. 805–810). Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/icdm.2016.0094\">https://doi.org/10.1109/icdm.2016.0094</a>","bibtex":"@inproceedings{Blömer_Brauer_Bujna_2016, title={A Theoretical Analysis of the Fuzzy K-Means Problem}, DOI={<a href=\"https://doi.org/10.1109/icdm.2016.0094\">10.1109/icdm.2016.0094</a>}, booktitle={2016 IEEE 16th International Conference on Data Mining (ICDM)}, publisher={IEEE}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016}, pages={805–810} }","mla":"Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.” <i>2016 IEEE 16th International Conference on Data Mining (ICDM)</i>, IEEE, 2016, pp. 805–10, doi:<a href=\"https://doi.org/10.1109/icdm.2016.0094\">10.1109/icdm.2016.0094</a>.","short":"J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–810."},"year":"2016","publication_identifier":{"isbn":["9781509054732"]},"publication_status":"published","doi":"10.1109/icdm.2016.0094","conference":{"end_date":"2016-12-15","location":"Barcelona, Spain","name":"IEEE 16th International Conference on Data Mining (ICDM)","start_date":"2016-12-12"},"title":"A Theoretical Analysis of the Fuzzy K-Means Problem","date_created":"2018-04-17T11:46:07Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Sascha","last_name":"Brauer","id":"13291","full_name":"Brauer, Sascha"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"}],"date_updated":"2022-01-06T06:55:58Z","publisher":"IEEE","status":"public","abstract":[{"text":"One of the most popular fuzzy clustering techniques is the fuzzy K-means algorithm (also known as fuzzy-c-means or FCM algorithm). In contrast to the K-means and K-median problem, the underlying fuzzy K-means problem has not been studied from a theoretical point of view. In particular, there are no algorithms with approximation guarantees similar to the famous K-means++ algorithm known for the fuzzy K-means problem. This work initiates the study of the fuzzy K-means problem from an algorithmic and complexity theoretic perspective. We show that optimal solutions for the fuzzy K-means problem cannot, in general, be expressed by radicals over the input points. Surprisingly, this already holds for simple inputs in one-dimensional space. Hence, one cannot expect to compute optimal solutions exactly. We give the first (1+eps)-approximation algorithms for the fuzzy K-means problem. First, we present a deterministic approximation algorithm whose runtime is polynomial in N and linear in the dimension D of the input set, given that K is constant, i.e. a polynomial time approximation scheme (PTAS) for fixed K. We achieve this result by showing that for each soft clustering there exists a hard clustering with similar properties. Second, by using techniques known from coreset constructions for the K-means problem, we develop a deterministic approximation algorithm that runs in time almost linear in N but exponential in the dimension D. We complement these results with a randomized algorithm which imposes some natural restrictions on the sought solution and whose runtime is comparable to some of the most efficient approximation algorithms for K-means, i.e. linear in the number of points and the dimension, but exponential in the number of clusters.","lang":"eng"}],"publication":"2016 IEEE 16th International Conference on Data Mining (ICDM)","type":"conference","language":[{"iso":"eng"}],"keyword":["unsolvability by radicals","clustering","fuzzy k-means","probabilistic method","approximation algorithms","randomized algorithms"],"department":[{"_id":"64"}],"user_id":"25078","_id":"2367"},{"date_updated":"2022-01-06T06:54:30Z","author":[{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"},{"first_name":"Ka","last_name":"I Pun","full_name":"I Pun, Ka"},{"first_name":"Martin","full_name":"Steffen, Martin","last_name":"Steffen"},{"first_name":"Volker","last_name":"Stolz","full_name":"Stolz, Volker"},{"full_name":"Wickert, Anna-Katharina","last_name":"Wickert","first_name":"Anna-Katharina"}],"date_created":"2020-11-30T11:02:52Z","title":"Information Flow Analysis for Go","doi":"10.1007/978-3-319-47166-2_30","year":"2016","page":"431-445","citation":{"ieee":"E. Bodden, K. I Pun, M. Steffen, V. Stolz, and A.-K. Wickert, “Information Flow Analysis for Go,” in <i>Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}</i>, 2016, pp. 431–445, doi: <a href=\"https://doi.org/10.1007/978-3-319-47166-2_30\">10.1007/978-3-319-47166-2_30</a>.","chicago":"Bodden, Eric, Ka I Pun, Martin Steffen, Volker Stolz, and Anna-Katharina Wickert. “Information Flow Analysis for Go.” In <i>Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}</i>, 431–45, 2016. <a href=\"https://doi.org/10.1007/978-3-319-47166-2_30\">https://doi.org/10.1007/978-3-319-47166-2_30</a>.","ama":"Bodden E, I Pun K, Steffen M, Stolz V, Wickert A-K. Information Flow Analysis for Go. In: <i>Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}</i>. ; 2016:431-445. doi:<a href=\"https://doi.org/10.1007/978-3-319-47166-2_30\">10.1007/978-3-319-47166-2_30</a>","apa":"Bodden, E., I Pun, K., Steffen, M., Stolz, V., &#38; Wickert, A.-K. (2016). Information Flow Analysis for Go. <i>Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}</i>, 431–445. <a href=\"https://doi.org/10.1007/978-3-319-47166-2_30\">https://doi.org/10.1007/978-3-319-47166-2_30</a>","bibtex":"@inproceedings{Bodden_I Pun_Steffen_Stolz_Wickert_2016, title={Information Flow Analysis for Go}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-47166-2_30\">10.1007/978-3-319-47166-2_30</a>}, booktitle={Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}}, author={Bodden, Eric and I Pun, Ka and Steffen, Martin and Stolz, Volker and Wickert, Anna-Katharina}, year={2016}, pages={431–445} }","short":"E. Bodden, K. I Pun, M. Steffen, V. Stolz, A.-K. Wickert, in: Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}, 2016, pp. 431–445.","mla":"Bodden, Eric, et al. “Information Flow Analysis for Go.” <i>Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}</i>, 2016, pp. 431–45, doi:<a href=\"https://doi.org/10.1007/978-3-319-47166-2_30\">10.1007/978-3-319-47166-2_30</a>."},"_id":"20556","department":[{"_id":"76"}],"user_id":"5786","language":[{"iso":"eng"}],"publication":"Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, Imperial, Corfu, Greece, October 10-14, 2016, Proceedings, Part {I}","type":"conference","status":"public"},{"date_updated":"2022-01-06T06:54:33Z","author":[{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"date_created":"2017-10-17T12:41:32Z","title":"Cost-efficient Scheduling on Machines from the Cloud","doi":"10.1007/978-3-319-48749-6_42","has_accepted_license":"1","year":"2016","citation":{"mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 578--592, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">10.1007/978-3-319-48749-6_42</a>.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">10.1007/978-3-319-48749-6_42</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 578--592). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">https://doi.org/10.1007/978-3-319-48749-6_42</a>","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 578--592, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">https://doi.org/10.1007/978-3-319-48749-6_42</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 578--592.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. ; 2016:578--592. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_42\">10.1007/978-3-319-48749-6_42</a>"},"page":"578--592","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"207","user_id":"477","department":[{"_id":"63"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:18:51Z","type":"conference","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","abstract":[{"lang":"eng","text":"We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\\beta$. While for $\\beta series = {LNCS}"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":608614,"file_name":"Cost-EfficientSchedulingOnMach.pdf","access_level":"closed","file_id":"5268","date_updated":"2018-11-02T14:18:51Z","date_created":"2018-11-02T14:18:51Z","creator":"ups"}],"status":"public"},{"_id":"20716","date_updated":"2022-01-06T06:54:34Z","department":[{"_id":"76"}],"user_id":"5786","author":[{"orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"first_name":"Michael","last_name":"Eichberg","full_name":"Eichberg, Michael"},{"full_name":"I Pun, Ka","last_name":"I Pun","first_name":"Ka"},{"first_name":"Martin","last_name":"Steffen","full_name":"Steffen, Martin"},{"first_name":"Volker","last_name":"Stolz","full_name":"Stolz, Volker"},{"first_name":"Anna-Katharina","last_name":"Wickert","full_name":"Wickert, Anna-Katharina"}],"date_created":"2020-12-14T11:56:15Z","title":"Don't let data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://bodden.de/pubs/bep16gotaint.pdf"}],"publication":"Nordic Workshop on Programming Theory (NWPT'16)","type":"conference","year":"2016","status":"public","citation":{"short":"E. Bodden, M. Eichberg, K. I Pun, M. Steffen, V. Stolz, A.-K. Wickert, in: Nordic Workshop on Programming Theory (NWPT’16), 2016.","bibtex":"@inproceedings{Bodden_Eichberg_I Pun_Steffen_Stolz_Wickert_2016, title={Don’t let data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go}, booktitle={Nordic Workshop on Programming Theory (NWPT’16)}, author={Bodden, Eric and Eichberg, Michael and I Pun, Ka and Steffen, Martin and Stolz, Volker and Wickert, Anna-Katharina}, year={2016} }","mla":"Bodden, Eric, et al. “Don’t Let Data Go Astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go.” <i>Nordic Workshop on Programming Theory (NWPT’16)</i>, 2016.","apa":"Bodden, E., Eichberg, M., I Pun, K., Steffen, M., Stolz, V., &#38; Wickert, A.-K. (2016). Don’t let data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go. <i>Nordic Workshop on Programming Theory (NWPT’16)</i>.","chicago":"Bodden, Eric, Michael Eichberg, Ka I Pun, Martin Steffen, Volker Stolz, and Anna-Katharina Wickert. “Don’t Let Data Go Astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go.” In <i>Nordic Workshop on Programming Theory (NWPT’16)</i>, 2016.","ieee":"E. Bodden, M. Eichberg, K. I Pun, M. Steffen, V. Stolz, and A.-K. Wickert, “Don’t let data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go,” 2016.","ama":"Bodden E, Eichberg M, I Pun K, Steffen M, Stolz V, Wickert A-K. Don’t let data Go astray---A Context-Sensitive Taint Analysis for Concurrent Programs in Go. In: <i>Nordic Workshop on Programming Theory (NWPT’16)</i>. ; 2016."}},{"title":"Just-in-Time Static Analysis","doi":"http://dx.doi.org/10.7939/DVN/10859","main_file_link":[{"url":"http://bodden.de/pubs/dal16jit-tr.pdf"}],"date_updated":"2022-01-06T06:54:34Z","author":[{"full_name":"Nguyen Quang Do, Lisa","last_name":"Nguyen Quang Do","first_name":"Lisa"},{"first_name":"Karim","last_name":"Ali","full_name":"Ali, Karim"},{"full_name":"Livshits, Benjamin","last_name":"Livshits","first_name":"Benjamin"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"last_name":"Smith","full_name":"Smith, Justin","first_name":"Justin"},{"last_name":"Murphy-Hill","full_name":"Murphy-Hill, Emerson","first_name":"Emerson"}],"date_created":"2020-12-14T11:57:09Z","year":"2016","citation":{"ama":"Nguyen Quang Do L, Ali K, Livshits B, Bodden E, Smith J, Murphy-Hill E. <i>Just-in-Time Static Analysis</i>.; 2016. doi:<a href=\"http://dx.doi.org/10.7939/DVN/10859\">http://dx.doi.org/10.7939/DVN/10859</a>","ieee":"L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, and E. Murphy-Hill, <i>Just-in-Time Static Analysis</i>. 2016.","chicago":"Nguyen Quang Do, Lisa, Karim Ali, Benjamin Livshits, Eric Bodden, Justin Smith, and Emerson Murphy-Hill. <i>Just-in-Time Static Analysis</i>, 2016. <a href=\"http://dx.doi.org/10.7939/DVN/10859\">http://dx.doi.org/10.7939/DVN/10859</a>.","mla":"Nguyen Quang Do, Lisa, et al. <i>Just-in-Time Static Analysis</i>. 2016, doi:<a href=\"http://dx.doi.org/10.7939/DVN/10859\">http://dx.doi.org/10.7939/DVN/10859</a>.","short":"L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, E. Murphy-Hill, Just-in-Time Static Analysis, 2016.","bibtex":"@book{Nguyen Quang Do_Ali_Livshits_Bodden_Smith_Murphy-Hill_2016, title={Just-in-Time Static Analysis}, DOI={<a href=\"http://dx.doi.org/10.7939/DVN/10859\">http://dx.doi.org/10.7939/DVN/10859</a>}, author={Nguyen Quang Do, Lisa and Ali, Karim and Livshits, Benjamin and Bodden, Eric and Smith, Justin and Murphy-Hill, Emerson}, year={2016} }","apa":"Nguyen Quang Do, L., Ali, K., Livshits, B., Bodden, E., Smith, J., &#38; Murphy-Hill, E. (2016). <i>Just-in-Time Static Analysis</i>. <a href=\"http://dx.doi.org/10.7939/DVN/10859\">http://dx.doi.org/10.7939/DVN/10859</a>"},"keyword":["ATTRACT","ITSECWEBSITE"],"language":[{"iso":"eng"}],"_id":"20717","department":[{"_id":"76"}],"user_id":"5786","status":"public","type":"report"},{"citation":{"apa":"Rasthofer, S., Arzt, S., Bodden, E., &#38; Miltenberger, M. (2016). Harvester - Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen. <i>Datenschutz Und Datensicherheit</i>, 718–722. <a href=\"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536\">https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536</a>","bibtex":"@article{Rasthofer_Arzt_Bodden_Miltenberger_2016, title={Harvester - Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen}, DOI={<a href=\"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536\">https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536</a>}, journal={Datenschutz und Datensicherheit}, author={Rasthofer, Siegfried and Arzt, Steven and Bodden, Eric and Miltenberger, Marc}, year={2016}, pages={718–722} }","short":"S. Rasthofer, S. Arzt, E. Bodden, M. Miltenberger, Datenschutz Und Datensicherheit (2016) 718–722.","mla":"Rasthofer, Siegfried, et al. “Harvester - Vollautomatische Extraktion von Laufzeitwerten Aus Obfuskierten Android-Applikationen.” <i>Datenschutz Und Datensicherheit</i>, 2016, pp. 718–22, doi:<a href=\"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536\">https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536</a>.","ieee":"S. Rasthofer, S. Arzt, E. Bodden, and M. Miltenberger, “Harvester - Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen,” <i>Datenschutz und Datensicherheit</i>, pp. 718–722, 2016, doi: <a href=\"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536\">https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536</a>.","chicago":"Rasthofer, Siegfried, Steven Arzt, Eric Bodden, and Marc Miltenberger. “Harvester - Vollautomatische Extraktion von Laufzeitwerten Aus Obfuskierten Android-Applikationen.” <i>Datenschutz Und Datensicherheit</i>, 2016, 718–22. <a href=\"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536\">https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536</a>.","ama":"Rasthofer S, Arzt S, Bodden E, Miltenberger M. Harvester - Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen. <i>Datenschutz und Datensicherheit</i>. Published online 2016:718-722. doi:<a href=\"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536\">https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536</a>"},"page":"718-722","year":"2016","date_created":"2020-12-14T11:57:48Z","author":[{"first_name":"Siegfried","last_name":"Rasthofer","full_name":"Rasthofer, Siegfried"},{"first_name":"Steven","full_name":"Arzt, Steven","last_name":"Arzt"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden"},{"first_name":"Marc","full_name":"Miltenberger, Marc","last_name":"Miltenberger"}],"date_updated":"2022-01-06T06:54:34Z","main_file_link":[{"url":"http://bodden.de/pubs/rabm16harvester.pdf"}],"doi":"https://www.springerprofessional.de/en/datenschutz-und-datensicherheit-dud-11-2016/10866536","title":"Harvester - Vollautomatische Extraktion von Laufzeitwerten aus obfuskierten Android-Applikationen","type":"journal_article","publication":"Datenschutz und Datensicherheit","status":"public","user_id":"5786","department":[{"_id":"76"}],"_id":"20718","language":[{"iso":"eng"}],"keyword":["ATTRACT","ITSECWEBSITE"]},{"publication_identifier":{"isbn":["978-1-4503-4139-4"]},"page":"779-790","citation":{"apa":"Holzinger, P., Triller, S., Bartel, A., &#38; Bodden, E. (2016). An In-Depth Study of More Than Ten Years of Java Exploitation. <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</i>, 779–790. <a href=\"http://doi.acm.org/10.1145/2976749.2978361\">http://doi.acm.org/10.1145/2976749.2978361</a>","mla":"Holzinger, Philipp, et al. “An In-Depth Study of More Than Ten Years of Java Exploitation.” <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</i>, 2016, pp. 779–90, doi:<a href=\"http://doi.acm.org/10.1145/2976749.2978361\">http://doi.acm.org/10.1145/2976749.2978361</a>.","bibtex":"@inproceedings{Holzinger_Triller_Bartel_Bodden_2016, series={CCS ’16}, title={An In-Depth Study of More Than Ten Years of Java Exploitation}, DOI={<a href=\"http://doi.acm.org/10.1145/2976749.2978361\">http://doi.acm.org/10.1145/2976749.2978361</a>}, booktitle={Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security}, author={Holzinger, Philipp and Triller, Stefan and Bartel, Alexandre and Bodden, Eric}, year={2016}, pages={779–790}, collection={CCS ’16} }","short":"P. Holzinger, S. Triller, A. Bartel, E. Bodden, in: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016, pp. 779–790.","ama":"Holzinger P, Triller S, Bartel A, Bodden E. An In-Depth Study of More Than Ten Years of Java Exploitation. In: <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</i>. CCS ’16. ; 2016:779-790. doi:<a href=\"http://doi.acm.org/10.1145/2976749.2978361\">http://doi.acm.org/10.1145/2976749.2978361</a>","chicago":"Holzinger, Philipp, Stefan Triller, Alexandre Bartel, and Eric Bodden. “An In-Depth Study of More Than Ten Years of Java Exploitation.” In <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</i>, 779–90. CCS ’16, 2016. <a href=\"http://doi.acm.org/10.1145/2976749.2978361\">http://doi.acm.org/10.1145/2976749.2978361</a>.","ieee":"P. Holzinger, S. Triller, A. Bartel, and E. Bodden, “An In-Depth Study of More Than Ten Years of Java Exploitation,” in <i>Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security</i>, 2016, pp. 779–790, doi: <a href=\"http://doi.acm.org/10.1145/2976749.2978361\">http://doi.acm.org/10.1145/2976749.2978361</a>."},"year":"2016","date_created":"2020-12-14T11:58:33Z","author":[{"first_name":"Philipp","last_name":"Holzinger","full_name":"Holzinger, Philipp"},{"full_name":"Triller, Stefan","last_name":"Triller","first_name":"Stefan"},{"first_name":"Alexandre","last_name":"Bartel","full_name":"Bartel, Alexandre"},{"first_name":"Eric","full_name":"Bodden, Eric","id":"59256","orcid":"0000-0003-3470-3647","last_name":"Bodden"}],"date_updated":"2022-01-06T06:54:34Z","doi":"http://doi.acm.org/10.1145/2976749.2978361","title":"An In-Depth Study of More Than Ten Years of Java Exploitation","publication":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","type":"conference","status":"public","department":[{"_id":"76"}],"user_id":"5786","series_title":"CCS '16","_id":"20719","language":[{"iso":"eng"}],"keyword":["ATTRACT","access control","exploits","java security","security analysis","ITSECWEBSITE"]},{"year":"2016","page":"212-228","citation":{"apa":"Follner, A., Bartel, A., Peng, H., Chang, Y.-C., Ispoglou, K., Payer, M., &#38; Bodden, E. (2016). PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution. <i>International Workshop on Security and Trust Management (STM)</i>, 212–228.","bibtex":"@inproceedings{Follner_Bartel_Peng_Chang_Ispoglou_Payer_Bodden_2016, title={PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution}, booktitle={International Workshop on Security and Trust Management (STM)}, author={Follner, Andreas and Bartel, Alexandre and Peng, Hui and Chang, Yu-Chen and Ispoglou, Kyriakos and Payer, Mathias and Bodden, Eric}, year={2016}, pages={212–228} }","mla":"Follner, Andreas, et al. “PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution.” <i>International Workshop on Security and Trust Management (STM)</i>, 2016, pp. 212–28.","short":"A. Follner, A. Bartel, H. Peng, Y.-C. Chang, K. Ispoglou, M. Payer, E. Bodden, in: International Workshop on Security and Trust Management (STM), 2016, pp. 212–228.","ieee":"A. Follner <i>et al.</i>, “PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution,” in <i>International Workshop on Security and Trust Management (STM)</i>, 2016, pp. 212–228.","chicago":"Follner, Andreas, Alexandre Bartel, Hui Peng, Yu-Chen Chang, Kyriakos Ispoglou, Mathias Payer, and Eric Bodden. “PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution.” In <i>International Workshop on Security and Trust Management (STM)</i>, 212–28, 2016.","ama":"Follner A, Bartel A, Peng H, et al. PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution. In: <i>International Workshop on Security and Trust Management (STM)</i>. ; 2016:212-228."},"date_updated":"2022-01-06T06:54:34Z","author":[{"last_name":"Follner","full_name":"Follner, Andreas","first_name":"Andreas"},{"first_name":"Alexandre","full_name":"Bartel, Alexandre","last_name":"Bartel"},{"first_name":"Hui","last_name":"Peng","full_name":"Peng, Hui"},{"full_name":"Chang, Yu-Chen","last_name":"Chang","first_name":"Yu-Chen"},{"last_name":"Ispoglou","full_name":"Ispoglou, Kyriakos","first_name":"Kyriakos"},{"last_name":"Payer","full_name":"Payer, Mathias","first_name":"Mathias"},{"orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"}],"date_created":"2020-12-14T11:59:04Z","title":"PSHAPE: Automatically Combining Gadgets for Arbitrary Method Execution","main_file_link":[{"url":"http://bodden.de/pubs/fbt+16pshape.pdf"}],"publication":"International Workshop on Security and Trust Management (STM)","type":"conference","status":"public","_id":"20720","department":[{"_id":"76"}],"user_id":"5786","language":[{"iso":"eng"}]}]