[{"language":[{"iso":"eng"}],"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"_id":"28199","user_id":"477","department":[{"_id":"77"}],"status":"public","type":"conference","publication":"2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)","title":"Jicer: Simplifying Cooperative Android App Analysis Tasks","doi":"10.1109/scam52516.2021.00031","date_updated":"2022-11-17T14:26:19Z","date_created":"2021-12-01T08:53:29Z","author":[{"first_name":"Felix","last_name":"Pauck","id":"22398","full_name":"Pauck, Felix"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"year":"2021","citation":{"ama":"Pauck F, Wehrheim H. Jicer: Simplifying Cooperative Android App Analysis Tasks. In: <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>","chicago":"Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” In <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021. <a href=\"https://doi.org/10.1109/scam52516.2021.00031\">https://doi.org/10.1109/scam52516.2021.00031</a>.","ieee":"F. Pauck and H. Wehrheim, “Jicer: Simplifying Cooperative Android App Analysis Tasks,” 2021, doi: <a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>.","apa":"Pauck, F., &#38; Wehrheim, H. (2021). Jicer: Simplifying Cooperative Android App Analysis Tasks. <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. <a href=\"https://doi.org/10.1109/scam52516.2021.00031\">https://doi.org/10.1109/scam52516.2021.00031</a>","bibtex":"@inproceedings{Pauck_Wehrheim_2021, title={Jicer: Simplifying Cooperative Android App Analysis Tasks}, DOI={<a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Pauck, Felix and Wehrheim, Heike}, year={2021} }","mla":"Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>.","short":"F. Pauck, H. Wehrheim, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021."},"publication_status":"published"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"27841","user_id":"22398","department":[{"_id":"78"}],"keyword":["Software Analysis","Abstract Interpretation","Custom Instruction","Hardware Verification"],"language":[{"iso":"eng"}],"funded_apc":"1","type":"journal_article","publication":"IEEE Access","abstract":[{"text":"Verification of software and processor hardware usually proceeds separately, software analysis relying on the correctness of processors executing machine instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption. In this paper we present a novel formal approach for hardware/software co-verification targeting processors with custom instruction set extensions. We detail two different approaches for checking whether the hardware fulfills the requirements expected by the software analysis. The approaches are designed to explore a trade-off between generality of the verification and computational effort. Then, we describe the integration of software and hardware analyses for both techniques and describe a fully automated tool chain implementing the approaches. Finally, we demonstrate and compare the two approaches on example source code with custom instructions, using state-of-the-art software analysis and hardware verification techniques.","lang":"eng"}],"status":"public","publisher":"IEEE","date_updated":"2023-01-18T08:34:50Z","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Pauck, Felix","id":"22398","last_name":"Pauck","first_name":"Felix"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"}],"date_created":"2021-11-25T14:12:22Z","title":"Software/Hardware Co-Verification for Custom Instruction Set Processors","doi":"10.1109/ACCESS.2021.3131213","publication_status":"published","quality_controlled":"1","year":"2021","citation":{"ama":"Jakobs M-C, Pauck F, Platzner M, Wehrheim H, Wiersema T. Software/Hardware Co-Verification for Custom Instruction Set Processors. <i>IEEE Access</i>. Published online 2021. doi:<a href=\"https://doi.org/10.1109/ACCESS.2021.3131213\">10.1109/ACCESS.2021.3131213</a>","chicago":"Jakobs, Marie-Christine, Felix Pauck, Marco Platzner, Heike Wehrheim, and Tobias Wiersema. “Software/Hardware Co-Verification for Custom Instruction Set Processors.” <i>IEEE Access</i>, 2021. <a href=\"https://doi.org/10.1109/ACCESS.2021.3131213\">https://doi.org/10.1109/ACCESS.2021.3131213</a>.","ieee":"M.-C. Jakobs, F. Pauck, M. Platzner, H. Wehrheim, and T. Wiersema, “Software/Hardware Co-Verification for Custom Instruction Set Processors,” <i>IEEE Access</i>, 2021, doi: <a href=\"https://doi.org/10.1109/ACCESS.2021.3131213\">10.1109/ACCESS.2021.3131213</a>.","apa":"Jakobs, M.-C., Pauck, F., Platzner, M., Wehrheim, H., &#38; Wiersema, T. (2021). Software/Hardware Co-Verification for Custom Instruction Set Processors. <i>IEEE Access</i>. <a href=\"https://doi.org/10.1109/ACCESS.2021.3131213\">https://doi.org/10.1109/ACCESS.2021.3131213</a>","mla":"Jakobs, Marie-Christine, et al. “Software/Hardware Co-Verification for Custom Instruction Set Processors.” <i>IEEE Access</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/ACCESS.2021.3131213\">10.1109/ACCESS.2021.3131213</a>.","bibtex":"@article{Jakobs_Pauck_Platzner_Wehrheim_Wiersema_2021, title={Software/Hardware Co-Verification for Custom Instruction Set Processors}, DOI={<a href=\"https://doi.org/10.1109/ACCESS.2021.3131213\">10.1109/ACCESS.2021.3131213</a>}, journal={IEEE Access}, publisher={IEEE}, author={Jakobs, Marie-Christine and Pauck, Felix and Platzner, Marco and Wehrheim, Heike and Wiersema, Tobias}, year={2021} }","short":"M.-C. Jakobs, F. Pauck, M. Platzner, H. Wehrheim, T. Wiersema, IEEE Access (2021)."}},{"status":"public","editor":[{"last_name":"Koziolek","full_name":"Koziolek, Anne","first_name":"Anne"},{"last_name":"Schaefer","full_name":"Schaefer, Ina","first_name":"Ina"},{"last_name":"Seidl","full_name":"Seidl, Christoph","first_name":"Christoph"}],"type":"conference","publication":"Software Engineering 2021","language":[{"iso":"eng"}],"user_id":"22398","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"21238","citation":{"ama":"Pauck F, Wehrheim H. Cooperative Android App Analysis with CoDiDroid. In: Koziolek A, Schaefer I, Seidl C, eds. <i>Software Engineering 2021</i>. Gesellschaft für Informatik e.V.; 2021:83-84. doi:<a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>","ieee":"F. Pauck and H. Wehrheim, “Cooperative Android App Analysis with CoDiDroid,” in <i>Software Engineering 2021</i>, 2021, pp. 83–84, doi: <a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>.","chicago":"Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” In <i>Software Engineering 2021</i>, edited by Anne Koziolek, Ina Schaefer, and Christoph Seidl, 83–84. Bonn: Gesellschaft für Informatik e.V., 2021. <a href=\"https://doi.org/10.18420/SE2021_30 \">https://doi.org/10.18420/SE2021_30 </a>.","short":"F. Pauck, H. Wehrheim, in: A. Koziolek, I. Schaefer, C. Seidl (Eds.), Software Engineering 2021, Gesellschaft für Informatik e.V., Bonn, 2021, pp. 83–84.","bibtex":"@inproceedings{Pauck_Wehrheim_2021, place={Bonn}, title={Cooperative Android App Analysis with CoDiDroid}, DOI={<a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>}, booktitle={Software Engineering 2021}, publisher={Gesellschaft für Informatik e.V.}, author={Pauck, Felix and Wehrheim, Heike}, editor={Koziolek, Anne and Schaefer, Ina and Seidl, Christoph}, year={2021}, pages={83–84} }","mla":"Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” <i>Software Engineering 2021</i>, edited by Anne Koziolek et al., Gesellschaft für Informatik e.V., 2021, pp. 83–84, doi:<a href=\"https://doi.org/10.18420/SE2021_30 \">10.18420/SE2021_30 </a>.","apa":"Pauck, F., &#38; Wehrheim, H. (2021). Cooperative Android App Analysis with CoDiDroid. In A. Koziolek, I. Schaefer, &#38; C. Seidl (Eds.), <i>Software Engineering 2021</i> (pp. 83–84). Gesellschaft für Informatik e.V. <a href=\"https://doi.org/10.18420/SE2021_30 \">https://doi.org/10.18420/SE2021_30 </a>"},"page":" 83-84 ","year":"2021","place":"Bonn","publication_status":"published","doi":"10.18420/SE2021_30 ","title":"Cooperative Android App Analysis with CoDiDroid","date_created":"2021-02-16T09:28:49Z","author":[{"first_name":"Felix","last_name":"Pauck","id":"22398","full_name":"Pauck, Felix"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2023-01-18T08:35:20Z","publisher":"Gesellschaft für Informatik e.V."},{"project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"}],"_id":"29138","user_id":"72764","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"type":"conference","publication":"2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)","status":"public","date_updated":"2023-04-19T15:03:45Z","date_created":"2021-12-30T00:02:24Z","author":[{"id":"72764","full_name":"Ahmed, Qazi Arbab","last_name":"Ahmed","orcid":"0000-0002-1837-2254","first_name":"Qazi Arbab"}],"title":"Hardware Trojans in Reconfigurable Computing","doi":"10.1109/vlsi-soc53125.2021.9606974","publication_status":"published","year":"2021","citation":{"ama":"Ahmed QA. Hardware Trojans in Reconfigurable Computing. In: <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>","ieee":"Q. A. Ahmed, “Hardware Trojans in Reconfigurable Computing,” 2021, doi: <a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>.","chicago":"Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” In <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2021. <a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">https://doi.org/10.1109/vlsi-soc53125.2021.9606974</a>.","apa":"Ahmed, Q. A. (2021). Hardware Trojans in Reconfigurable Computing. <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. <a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">https://doi.org/10.1109/vlsi-soc53125.2021.9606974</a>","bibtex":"@inproceedings{Ahmed_2021, title={Hardware Trojans in Reconfigurable Computing}, DOI={<a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>}, booktitle={2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)}, author={Ahmed, Qazi Arbab}, year={2021} }","mla":"Ahmed, Qazi Arbab. “Hardware Trojans in Reconfigurable Computing.” <i>2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/vlsi-soc53125.2021.9606974\">10.1109/vlsi-soc53125.2021.9606974</a>.","short":"Q.A. Ahmed, in: 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC), 2021."}},{"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"_id":"20681","user_id":"72764","department":[{"_id":"78"}],"file_date_updated":"2023-05-11T09:16:15Z","type":"conference","status":"public","oa":"1","date_updated":"2023-05-11T09:16:34Z","author":[{"first_name":"Qazi Arbab","id":"72764","full_name":"Ahmed, Qazi Arbab","orcid":"0000-0002-1837-2254","last_name":"Ahmed"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"}],"main_file_link":[{"open_access":"1"}],"conference":{"start_date":"2021-02-01","name":"Design, Automation and Test in Europe Conference (DATE'21)","location":"Alpexpo | Grenoble, France","end_date":"2021-02-05"},"doi":"10.23919/DATE51398.2021.9474026","publication_status":"published","publication_identifier":{"eisbn":["978-3-9819263-5-4"]},"has_accepted_license":"1","place":"Alpexpo | Grenoble, France","citation":{"chicago":"Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Malicious Routing: Circumventing Bitstream-Level Verification for FPGAs.” In <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. Alpexpo | Grenoble, France: 2021 Design, Automation and Test in Europe Conference (DATE), 2021. <a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">https://doi.org/10.23919/DATE51398.2021.9474026</a>.","ieee":"Q. A. Ahmed, T. Wiersema, and M. Platzner, “Malicious Routing: Circumventing Bitstream-level Verification for FPGAs,” presented at the Design, Automation and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France, 2021, doi: <a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>.","ama":"Ahmed QA, Wiersema T, Platzner M. Malicious Routing: Circumventing Bitstream-level Verification for FPGAs. In: <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. 2021 Design, Automation and Test in Europe Conference (DATE); 2021. doi:<a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>","apa":"Ahmed, Q. A., Wiersema, T., &#38; Platzner, M. (2021). Malicious Routing: Circumventing Bitstream-level Verification for FPGAs. <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. Design, Automation and Test in Europe Conference (DATE’21), Alpexpo | Grenoble, France. <a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">https://doi.org/10.23919/DATE51398.2021.9474026</a>","short":"Q.A. Ahmed, T. Wiersema, M. Platzner, in: 2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE), 2021 Design, Automation and Test in Europe Conference (DATE), Alpexpo | Grenoble, France, 2021.","bibtex":"@inproceedings{Ahmed_Wiersema_Platzner_2021, place={Alpexpo | Grenoble, France}, title={Malicious Routing: Circumventing Bitstream-level Verification for FPGAs}, DOI={<a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>}, booktitle={2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)}, publisher={2021 Design, Automation and Test in Europe Conference (DATE)}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, year={2021} }","mla":"Ahmed, Qazi Arbab, et al. “Malicious Routing: Circumventing Bitstream-Level Verification for FPGAs.” <i>2021 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 2021 Design, Automation and Test in Europe Conference (DATE), 2021, doi:<a href=\"https://doi.org/10.23919/DATE51398.2021.9474026\">10.23919/DATE51398.2021.9474026</a>."},"ddc":["006"],"language":[{"iso":"eng"}],"publication":"2021 Design, Automation & Test in Europe Conference & Exhibition (DATE)","abstract":[{"lang":"eng","text":"The battle of developing hardware Trojans and corresponding countermeasures has taken adversaries towards ingenious ways of compromising hardware designs by circumventing even advanced testing and verification methods. Besides conventional methods of inserting Trojans into a design by a malicious entity, the design flow for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised to assist the attacker to perform a successful malfunctioning or information leakage attack. The advanced stealthy malicious look-up-table (LUT) attack activates a Trojan only when generating the FPGA bitstream and can thus not be detected by register transfer and gate level testing and verification. However, also this attack was recently revealed by a bitstream-level proof-carrying hardware (PCH) approach. In this paper, we present a novel attack that leverages malicious routing of the inserted Trojan circuit to acquire a dormant state even in the generated and transmitted bitstream. The Trojan's payload is connected to primary inputs/outputs of the FPGA via a programmable interconnect point (PIP). The Trojan is detached from inputs/outputs during place-and-route and re-connected only when the FPGA is being programmed, thus activating the Trojan circuit without any need for a trigger logic. Since the Trojan is injected in a post-synthesis step and remains unconnected in the bitstream, the presented attack can currently neither be prevented by conventional testing and verification methods nor by recent bitstream-level verification techniques."}],"file":[{"file_size":394011,"access_level":"closed","file_name":"1812.pdf","file_id":"44752","date_updated":"2023-05-11T09:16:15Z","date_created":"2023-05-11T09:16:15Z","creator":"qazi","success":1,"relation":"main_file","content_type":"application/pdf"}],"publisher":"2021 Design, Automation and Test in Europe Conference (DATE)","date_created":"2020-12-07T14:03:00Z","title":"Malicious Routing: Circumventing Bitstream-level Verification for FPGAs","year":"2021"},{"title":"Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++","date_updated":"2023-06-15T08:39:55Z","author":[{"first_name":"Philipp","orcid":"0000-0002-8674-1859","last_name":"Schubert","id":"60543","full_name":"Schubert, Philipp"},{"first_name":"Ben","full_name":"Hermann, Ben","id":"66173","orcid":"0000-0001-9848-2017","last_name":"Hermann"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647"},{"first_name":"Richard","last_name":"Leer","full_name":"Leer, Richard"}],"date_created":"2021-10-18T12:52:12Z","year":"2021","citation":{"ama":"Schubert P, Hermann B, Bodden E, Leer R. Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++. In: <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>. ; 2021.","chicago":"Schubert, Philipp, Ben Hermann, Eric Bodden, and Richard Leer. “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” In <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>, 2021.","ieee":"P. Schubert, B. Hermann, E. Bodden, and R. Leer, “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++,” 2021.","bibtex":"@inproceedings{Schubert_Hermann_Bodden_Leer_2021, title={Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++}, booktitle={SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric and Leer, Richard}, year={2021} }","mla":"Schubert, Philipp, et al. “Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++.” <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>, 2021.","short":"P. Schubert, B. Hermann, E. Bodden, R. Leer, in: SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track), 2021.","apa":"Schubert, P., Hermann, B., Bodden, E., &#38; Leer, R. (2021). Into the Woods: Experiences from Building a Dataflow Analysis Framework for C/C++. <i>SCAM ’21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)</i>."},"language":[{"iso":"eng"}],"_id":"26406","project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"}],"department":[{"_id":"76"}],"user_id":"15249","status":"public","publication":"SCAM '21: IEEE International Working Conference on Source Code Analysis and Manipulation (Engineering Track)","type":"conference"},{"year":"2021","citation":{"short":"P. Schubert, F. Sattler, F.B. Schiebel, B. Hermann, E. Bodden, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.","mla":"Schubert, Philipp, et al. “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++.” <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021.","bibtex":"@inproceedings{Schubert_Sattler_Schiebel_Hermann_Bodden_2021, title={Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Schubert, Philipp and Sattler, Florian and Schiebel, Fabian Benedikt and Hermann, Ben and Bodden, Eric}, year={2021} }","apa":"Schubert, P., Sattler, F., Schiebel, F. B., Hermann, B., &#38; Bodden, E. (2021). Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>.","ama":"Schubert P, Sattler F, Schiebel FB, Hermann B, Bodden E. Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. In: <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. ; 2021.","chicago":"Schubert, Philipp, Florian Sattler, Fabian Benedikt Schiebel, Ben Hermann, and Eric Bodden. “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++.” In <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021.","ieee":"P. Schubert, F. Sattler, F. B. Schiebel, B. Hermann, and E. Bodden, “Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++,” 2021."},"title":"Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++","date_updated":"2025-12-04T10:43:01Z","author":[{"first_name":"Philipp","full_name":"Schubert, Philipp","id":"60543","orcid":"0000-0002-8674-1859","last_name":"Schubert"},{"first_name":"Florian","full_name":"Sattler, Florian","last_name":"Sattler"},{"last_name":"Schiebel","orcid":"0009-0008-6867-9802","full_name":"Schiebel, Fabian Benedikt","id":"55745","first_name":"Fabian Benedikt"},{"first_name":"Ben","orcid":"0000-0001-9848-2017","last_name":"Hermann","full_name":"Hermann, Ben","id":"66173"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden"}],"date_created":"2021-10-18T12:50:35Z","status":"public","publication":"2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)","type":"conference","language":[{"iso":"eng"}],"_id":"26405","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"department":[{"_id":"76"}],"user_id":"15249"},{"author":[{"first_name":"Linus Matthias","id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen"},{"first_name":"Tobias","last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"volume":28,"date_updated":"2022-01-06T06:53:09Z","doi":"10.1109/TVLSI.2020.3008061","publication_status":"published","publication_identifier":{"issn":["1063-8210"],"eissn":["1557-9999"]},"citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i> 28, no. 9 (2020): 2084–88. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>.","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate Circuits,” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, pp. 2084–2088, 2020.","ama":"Witschen LM, Wiersema T, Platzner M. Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>. 2020;28(9):2084-2088. doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>","bibtex":"@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate Circuits}, volume={28}, DOI={<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>}, number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems}, publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2020}, pages={2084–2088} }","mla":"Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” <i>IEEE Transactions On Very Large Scale Integration Systems</i>, vol. 28, no. 9, IEEE, 2020, pp. 2084–88, doi:<a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">10.1109/TVLSI.2020.3008061</a>.","short":"L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large Scale Integration Systems 28 (2020) 2084–2088.","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2020). Proof-carrying Approximate Circuits. <i>IEEE Transactions On Very Large Scale Integration Systems</i>, <i>28</i>(9), 2084–2088. <a href=\"https://doi.org/10.1109/TVLSI.2020.3008061\">https://doi.org/10.1109/TVLSI.2020.3008061</a>"},"page":"2084 - 2088","intvolume":"        28","user_id":"49051","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}],"_id":"17358","funded_apc":"1","article_type":"original","type":"journal_article","status":"public","date_created":"2020-07-06T11:21:30Z","publisher":"IEEE","title":"Proof-carrying Approximate Circuits","issue":"9","quality_controlled":"1","year":"2020","language":[{"iso":"eng"}],"keyword":["Approximate circuit synthesis","approximate computing","error metrics","formal verification","proof-carrying hardware"],"publication":"IEEE Transactions On Very Large Scale Integration Systems","abstract":[{"text":"Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework.","lang":"eng"}]},{"date_updated":"2022-01-06T06:54:34Z","author":[{"full_name":"Schubert, Philipp","id":"60543","last_name":"Schubert","orcid":"0000-0002-8674-1859","first_name":"Philipp"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"},{"full_name":"Hermann, Ben","id":"66173","orcid":"0000-0001-9848-2017","last_name":"Hermann","first_name":"Ben"}],"date_created":"2020-12-14T07:44:11Z","title":"Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries","has_accepted_license":"1","year":"2020","citation":{"apa":"Schubert, P., Bodden, E., &#38; Hermann, B. (2020). <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>.","short":"P. Schubert, E. Bodden, B. Hermann, Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries, 2020.","bibtex":"@book{Schubert_Bodden_Hermann_2020, title={Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries}, author={Schubert, Philipp and Bodden, Eric and Hermann, Ben}, year={2020} }","mla":"Schubert, Philipp, et al. <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>. 2020.","ama":"Schubert P, Bodden E, Hermann B. <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>.; 2020.","ieee":"P. Schubert, E. Bodden, and B. Hermann, <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>. 2020.","chicago":"Schubert, Philipp, Eric Bodden, and Ben Hermann. <i>Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries</i>, 2020."},"_id":"20712","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"department":[{"_id":"76"}],"user_id":"477","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-12-14T07:39:07Z","type":"report","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"20713","file_name":"main.pdf","file_size":683576,"date_created":"2020-12-14T07:39:07Z","creator":"pdschbrt","date_updated":"2020-12-14T07:39:07Z"}]},{"title":"Search Space Characterization for AxC Synthesis","date_updated":"2022-01-06T06:54:35Z","author":[{"last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_created":"2020-12-15T15:13:49Z","year":"2020","citation":{"bibtex":"@article{Witschen_Wiersema_Platzner, title={Search Space Characterization for AxC Synthesis}, journal={Fifth Workshop on Approximate Computing (AxC 2020)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco} }","mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for AxC Synthesis.” <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>.","short":"L.M. Witschen, T. Wiersema, M. Platzner, Fifth Workshop on Approximate Computing (AxC 2020) (n.d.).","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (n.d.). Search Space Characterization for AxC Synthesis. <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>.","ama":"Witschen LM, Wiersema T, Platzner M. Search Space Characterization for AxC Synthesis. <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>.","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Search Space Characterization for AxC Synthesis,” <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>. .","chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Search Space Characterization for AxC Synthesis.” <i>Fifth Workshop on Approximate Computing (AxC 2020)</i>, n.d."},"page":"2","publication_status":"accepted","has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-12-15T15:11:06Z","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"_id":"20748","user_id":"3118","department":[{"_id":"78"}],"abstract":[{"lang":"eng","text":"On the circuit level, the design paradigm Approximate Computing seeks to trade off computational accuracy against a target metric, e.g., energy consumption. This trade-off is possible for many applications due to their inherent resiliency against inaccuracies.\r\nIn the past, several automated approximation frameworks have been presented, which either utilize designated approximation techniques or libraries to replace approximable circuit parts with inaccurate versions. The frameworks invoke a search algorithm to iteratively explore the search space of performance degraded circuits, and validate their quality individually. \r\nIn this paper, we propose to reverse this procedure. Rather than exploring the search space, we delineate the approximate parts of the search space which are guaranteed to lead to valid approximate circuits. Our methodology is supported by formal verification and independent of approximation techniques. Eventually, the user is provided with quality bounds of the individual approximable circuit parts. Consequently, our approach guarantees that any approximate circuit which implements these parts within the determined quality constraints satisfies the global quality constraints, superseding a subsequent quality verification.\r\nIn our experimental results, we present the runtimes of our approach."}],"file":[{"file_size":250870,"file_id":"20749","access_level":"closed","file_name":"witschen20_axc.pdf","date_updated":"2020-12-15T15:11:06Z","creator":"witschen","date_created":"2020-12-15T15:11:06Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"preprint","publication":"Fifth Workshop on Approximate Computing (AxC 2020)"},{"status":"public","type":"journal_article","publication":"Journal of Automated Software Engineering","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"16725","user_id":"477","department":[{"_id":"7"},{"_id":"77"},{"_id":"355"}],"year":"2020","citation":{"apa":"Richter, C., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","mla":"Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, Springer.","bibtex":"@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection for Software Validation Based on Graph Kernels}, journal={Journal of Automated Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }","short":"C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.).","ieee":"C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection for Software Validation Based on Graph Kernels,” <i>Journal of Automated Software Engineering</i>.","chicago":"Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, n.d.","ama":"Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>."},"publication_status":"accepted","title":"Algorithm Selection for Software Validation Based on Graph Kernels","publisher":"Springer","date_updated":"2022-01-06T06:52:55Z","author":[{"id":"50003","full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2020-04-19T14:08:06Z"},{"doi":"10.1007/s12599-019-00627-x","volume":62,"author":[{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"},{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-12-02T09:27:17Z","page":"467-481","intvolume":"        62","citation":{"chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>.","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>. 2020;62(6):467-481. doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>, <i>62</i>(6), 467–481. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>}, number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38; Information Systems Engineering 62 (2020) 467–481."},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2019-12-12T10:24:47Z","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"user_id":"477","_id":"13770","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Project Area T","_id":"82"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Subproject C3","_id":"15"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Subproject C5","_id":"17"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"_id":"107","name":"SFB 901 -Subproject T3"},{"_id":"158","name":"SFB 901 - T4: SFB 901 -Subproject T4"}],"status":"public","type":"journal_article","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","date_created":"2019-10-10T13:41:06Z","publisher":"Springer","year":"2020","issue":"6","language":[{"iso":"eng"}],"ddc":["004"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"15311","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","file_size":454532,"creator":"ups","date_created":"2019-12-12T10:24:47Z","date_updated":"2019-12-12T10:24:47Z"}],"publication":"Business & Information Systems Engineering"},{"doi":"10.1016/j.microrel.2019.04.003","volume":99,"author":[{"first_name":"Linus Matthias","last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias"},{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"},{"last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186","first_name":"Hassan"},{"id":"64665","full_name":"Awais, Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","first_name":"Muhammad"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_updated":"2022-01-06T06:59:25Z","intvolume":"        99","page":"277-290","citation":{"short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Microelectronics Reliability 99 (2019) 277–290.","bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner_2019, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, volume={99}, DOI={<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>}, journal={Microelectronics Reliability}, publisher={Elsevier}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}, year={2019}, pages={277–290} }","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i>, vol. 99, Elsevier, 2019, pp. 277–90, doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>.","apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (2019). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>, <i>99</i>, 277–290. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Microelectronics Reliability</i>, vol. 99, pp. 277–290, 2019.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i> 99 (2019): 277–90. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>.","ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>. 2019;99:277-290. doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>"},"publication_identifier":{"issn":["0026-2714"]},"publication_status":"published","department":[{"_id":"78"}],"user_id":"49051","_id":"3585","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"status":"public","type":"journal_article","title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","date_created":"2018-07-20T14:08:49Z","publisher":"Elsevier","year":"2019","language":[{"iso":"eng"}],"keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"abstract":[{"text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments.","lang":"eng"}],"publication":"Microelectronics Reliability"},{"department":[{"_id":"77"}],"user_id":"477","_id":"7623","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"author":[{"first_name":"Shikun","last_name":"Zhang","full_name":"Zhang, Shikun"}],"date_created":"2019-02-12T06:13:43Z","date_updated":"2022-01-06T07:03:41Z","publisher":"Universität Paderborn","title":"Combining Android Apps for Analysis Purposes","page":"64","citation":{"apa":"Zhang, S. (2019). <i>Combining Android Apps for Analysis Purposes</i>. Universität Paderborn.","mla":"Zhang, Shikun. <i>Combining Android Apps for Analysis Purposes</i>. Universität Paderborn, 2019.","short":"S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn, 2019.","bibtex":"@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes}, publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }","chicago":"Zhang, Shikun. <i>Combining Android Apps for Analysis Purposes</i>. Universität Paderborn, 2019.","ieee":"S. Zhang, <i>Combining Android Apps for Analysis Purposes</i>. Universität Paderborn, 2019.","ama":"Zhang S. <i>Combining Android Apps for Analysis Purposes</i>. Universität Paderborn; 2019."},"year":"2019"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"7628","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"76"}],"user_id":"477","year":"2019","citation":{"mla":"Selbach, Nils. <i>Modeling Crypto API Usages in OpenSSL’s EVP Library</i>. Universität Paderborn, 2019.","short":"N. Selbach, Modeling Crypto API Usages in OpenSSL’s EVP Library, Universität Paderborn, 2019.","bibtex":"@book{Selbach_2019, title={Modeling Crypto API usages in OpenSSL’s EVP library}, publisher={Universität Paderborn}, author={Selbach, Nils}, year={2019} }","apa":"Selbach, N. (2019). <i>Modeling Crypto API usages in OpenSSL’s EVP library</i>. Universität Paderborn.","ieee":"N. Selbach, <i>Modeling Crypto API usages in OpenSSL’s EVP library</i>. Universität Paderborn, 2019.","chicago":"Selbach, Nils. <i>Modeling Crypto API Usages in OpenSSL’s EVP Library</i>. Universität Paderborn, 2019.","ama":"Selbach N. <i>Modeling Crypto API Usages in OpenSSL’s EVP Library</i>. Universität Paderborn; 2019."},"title":"Modeling Crypto API usages in OpenSSL's EVP library","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:41Z","supervisor":[{"orcid":"0000-0002-8674-1859","last_name":"Schubert","id":"60543","full_name":"Schubert, Philipp","first_name":"Philipp"}],"author":[{"last_name":"Selbach","full_name":"Selbach, Nils","first_name":"Nils"}],"date_created":"2019-02-12T07:28:12Z"},{"title":"Android App Merging for Benchmark Speed-Up and Analysis Lift-Up","date_created":"2020-02-06T17:06:51Z","year":"2019","ddc":["004"],"keyword":["Program Analysis","Android App Analysis","Taint Analysis","App Merging","Benchmark"],"language":[{"iso":"eng"}],"abstract":[{"text":"In the field of software analysis a trade-off between scalability and accuracy always exists. In this respect, Android app analysis is no exception, in particular, analyzing large or many apps can be challenging. Dealing with many small apps is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH. These particular benchmarks are not only used for the evaluation of novel tools but also in continuous integration pipelines of existing mature tools to maintain and guarantee a certain quality-level. Considering this latter usage it becomes very important to be able to achieve benchmark results as fast as possible. Hence, benchmarks have to be optimized for this purpose. One approach to do so is app merging. We implemented the Android Merge Tool (AMT) following this approach and show that its novel aspects can be used to produce scaled up and accurate benchmarks. For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy trade-off anymore. We show this throughout detailed experiments on DROIDBENCH employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark execution times are largely reduced without losing benchmark accuracy. Moreover, we argue why AMT is an advantageous successor of the state-of-the-art app merging tool (APKCOMBINER) in analysis lift-up scenarios.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":644517,"access_level":"closed","file_id":"15839","file_name":"AMT_final.pdf","date_updated":"2020-02-06T17:09:45Z","date_created":"2020-02-06T17:09:45Z","creator":"fpauck"}],"publication":"2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)","doi":"10.1109/asew.2019.00019","date_updated":"2022-01-06T06:52:38Z","author":[{"first_name":"Felix","last_name":"Pauck","id":"22398","full_name":"Pauck, Felix"},{"first_name":"Shikun","full_name":"Zhang, Shikun","last_name":"Zhang"}],"citation":{"bibtex":"@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark Speed-Up and Analysis Lift-Up}, DOI={<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>}, booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }","mla":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>.","short":"F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019.","apa":"Pauck, F., &#38; Zhang, S. (2019). Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>. <a href=\"https://doi.org/10.1109/asew.2019.00019\">https://doi.org/10.1109/asew.2019.00019</a>","ama":"Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In: <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>","chicago":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019. <a href=\"https://doi.org/10.1109/asew.2019.00019\">https://doi.org/10.1109/asew.2019.00019</a>.","ieee":"F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up,” in <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019."},"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781728141367"]},"file_date_updated":"2020-02-06T17:09:45Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"15838","user_id":"477","department":[{"_id":"77"}],"status":"public","type":"conference"},{"language":[{"iso":"eng"}],"_id":"15920","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"78"}],"user_id":"477","abstract":[{"lang":"eng","text":"Secure hardware design is the most important aspect to be considered in addition to functional correctness. Achieving hardware security in today’s globalized Integrated Cir- cuit(IC) supply chain is a challenging task. One solution that is widely considered to help achieve secure hardware designs is Information Flow Tracking(IFT). It provides an ap- proach to verify that the systems adhere to security properties either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying Hardware(PCH) is an approach to verify a functional design prior to using it in hardware. It is a two-party verification approach, where the target party, the consumer requests new functionalities with pre-defined properties to the producer. In response, the producer designs the IP (Intellectual Property) cores with the requested functionalities that adhere to the consumer-defined properties. The producer provides the IP cores and a proof certificate combined into a proof-carrying bitstream to the consumer to verify it. If the verification is successful, the consumer can use the IP cores in his hardware. In essence, the consumer can only run verified IP cores. Correctly applied, PCH techniques can help consumers to defend against many unintentional modifications and malicious alterations of the modules they receive. There are numerous published examples of how to use PCH to detect any change in the functionality of a circuit, i.e., pairing a PCH approach with functional equivalence checking for combinational or sequential circuits. For non-functional properties, since opening new covert channels to leak secret information from secure circuits is a viable attack vector for hardware trojans, i.e., intentionally added malicious circuitry, IFT technique is employed to make sure that secret/untrusted information never reaches any unclassified/trusted outputs.\r\nThis master thesis aims to explore the possibility of adapting Information Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream level enabling consumers to validate the trustworthiness of a module’s information flow without the computational costs of a complete flow analysis."}],"status":"public","type":"mastersthesis","title":"A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:41Z","supervisor":[{"last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"},{"first_name":"Sybille","full_name":"Hellebrand, Sybille","id":"209","orcid":"0000-0002-3717-3939","last_name":"Hellebrand"}],"date_created":"2020-02-17T12:03:40Z","author":[{"first_name":"Monica","last_name":"Keerthipati","full_name":"Keerthipati, Monica"}],"year":"2019","citation":{"apa":"Keerthipati, M. (2019). <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn.","short":"M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking, Universität Paderborn, 2019.","bibtex":"@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati, Monica}, year={2019} }","mla":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","ama":"Keerthipati M. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn; 2019.","chicago":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","ieee":"M. Keerthipati, <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019."}},{"date_updated":"2022-01-06T06:52:10Z","date_created":"2019-11-12T12:20:56Z","author":[{"last_name":"Dann","full_name":"Dann, Andreas","first_name":"Andreas"},{"last_name":"Hermann","orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben","id":"66173","first_name":"Ben"},{"full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"}],"title":"ModGuard: Identifying Integrity &Confidentiality Violations in Java Modules","doi":"10.1109/tse.2019.2931331","publication_status":"published","publication_identifier":{"issn":["0098-5589","1939-3520","2326-3881"]},"year":"2019","citation":{"ama":"Dann A, Hermann B, Bodden E. ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>. Published online 2019:1-1. doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>","ieee":"A. Dann, B. Hermann, and E. Bodden, “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules,” <i>IEEE Transactions on Software Engineering</i>, pp. 1–1, 2019, doi: <a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>.","chicago":"Dann, Andreas, Ben Hermann, and Eric Bodden. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>.","apa":"Dann, A., Hermann, B., &#38; Bodden, E. (2019). ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>","short":"A. Dann, B. Hermann, E. Bodden, IEEE Transactions on Software Engineering (2019) 1–1.","bibtex":"@article{Dann_Hermann_Bodden_2019, title={ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules}, DOI={<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>}, journal={IEEE Transactions on Software Engineering}, author={Dann, Andreas and Hermann, Ben and Bodden, Eric}, year={2019}, pages={1–1} }","mla":"Dann, Andreas, et al. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>."},"page":"1-1","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"14896","user_id":"5786","department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"IEEE Transactions on Software Engineering","status":"public"},{"title":"Combining Verifiers in Conditional Model Checking via Reducers","date_created":"2019-06-03T08:08:39Z","publisher":"GI","year":"2019","language":[{"iso":"eng"}],"ddc":["004"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":472426,"access_level":"closed","file_id":"12956","file_name":"46.pdf","date_updated":"2019-08-26T09:31:55Z","date_created":"2019-08-26T09:31:55Z","creator":"ups"}],"publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019","doi":"10.18420/se2019-46","volume":"P-292","author":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Thomas","last_name":"Lemberger","full_name":"Lemberger, Thomas"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:50:28Z","page":"151--152","citation":{"apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i> (Vol. P-292, pp. 151--152). GI. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>","bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>}, booktitle={Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152}, collection={LNI} }","mla":"Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via Reducers.” <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. P-292, GI, 2019, pp. 151--152, doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>.","short":"D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.","ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers in Conditional Model Checking via Reducers,” in <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, 2019, vol. P-292, pp. 151--152.","chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Combining Verifiers in Conditional Model Checking via Reducers.” In <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, P-292:151--152. LNI. GI, 2019. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>.","ama":"Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>. Vol P-292. LNI. GI; 2019:151--152. doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>"},"has_accepted_license":"1","file_date_updated":"2019-08-26T09:31:55Z","department":[{"_id":"77"}],"series_title":"LNI","user_id":"477","_id":"10093","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","editor":[{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"first_name":"Ivan","last_name":"Bogicevic","full_name":"Bogicevic, Ivan"},{"first_name":"Georg","last_name":"Herzwurm","full_name":"Herzwurm, Georg"},{"first_name":"Stefan","last_name":"Wagner","full_name":"Wagner, Stefan"}],"type":"conference"},{"date_created":"2019-06-03T08:12:55Z","publisher":"Springer","title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","year":"2019","language":[{"iso":"eng"}],"ddc":["004"],"publication":"Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}","file":[{"file_size":254772,"access_level":"closed","file_id":"12961","file_name":"PeSCo.pdf","date_updated":"2019-08-26T11:01:00Z","date_created":"2019-08-26T11:01:00Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"author":[{"first_name":"Cedric","id":"50003","full_name":"Richter, Cedric","last_name":"Richter"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"volume":11429,"date_updated":"2022-01-06T06:50:29Z","doi":"10.1007/978-3-030-17502-3_19","has_accepted_license":"1","citation":{"apa":"Richter, C., &#38; Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon, &#38; B. Steffen (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i> (Vol. 11429, pp. 229–233). Springer. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>","mla":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}, volume={11429}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>}, booktitle={Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter, Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture Notes in Computer Science} }","short":"C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.","ieee":"C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution),” in <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, 2019, vol. 11429, pp. 229–233.","chicago":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” In <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>.","ama":"Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>. Vol 11429. Lecture Notes in Computer Science. Springer; 2019:229-233. doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>"},"intvolume":"     11429","page":"229-233","user_id":"29719","series_title":"Lecture Notes in Computer Science","department":[{"_id":"77"}],"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"10095","file_date_updated":"2019-08-26T11:01:00Z","type":"conference","status":"public","editor":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"full_name":"Huisman, Marieke","last_name":"Huisman","first_name":"Marieke"},{"full_name":"Kordon, Fabrice","last_name":"Kordon","first_name":"Fabrice"},{"first_name":"Bernhard","full_name":"Steffen, Bernhard","last_name":"Steffen"}]}]