Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., &; Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? 37th IEEE/ACM International Conference on Automated Software Engineering.https://doi.org/10.1145/3551349.3561156 

Schott, S., &; Pauck, F. (2023). Benchmark Fuzzing for Android Taint Analyses. 2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM).https://doi.org/10.1109/scam55253.2022.00007 

Pauck, F. (2023). Scaling Arbitrary Android App Analyses. 37th IEEE/ACM International Conference on Automated Software Engineering.https://doi.org/10.1145/3551349.3561339 

Pauck, F. (2023). Cooperative Android App Analysis. Paderborn University.https://doi.org/10.17619/UNIPB/1-1698 

König, J. (2023). On the Membership and Correctness Problem for State Serializability and Value Opacity.

Richter, C., &; Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–173.https://doi.org/10.1109/ICST53961.2022.00027 

Richter, C., &; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–422.https://doi.org/10.1145/3524842.3528505 

Dongol, B., Schellhorn, G., &; Wehrheim, H. (2022). Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In B. Klin, S. Lasota, &; A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland (Vol. 243, p. 31:1–31:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2022.31 

Sharma, A., Demir, C., Ngonga Ngomo, A.-C., &; Wehrheim, H. (n.d.). MLCHECK–Property-Driven Testing of Machine Learning Classifiers. Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA).

Luo, L., Pauck, F., Piskachev, G., Benz, M., Pashchenko, I., Mory, M., Bodden, E., Hermann, B., &; Massacci, F. (2021). TaintBench: Automatic real-world malware benchmarking of Android taint analyses. Empirical Software Engineering.https://doi.org/10.1007/s10664-021-10013-5 

Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn.

Pauck, F., &; Wehrheim, H. (2021). Jicer: Simplifying Cooperative Android App Analysis Tasks. 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM).https://doi.org/10.1109/scam52516.2021.00031 

Pauck, F., &; Wehrheim, H. (2021). Cooperative Android App Analysis with CoDiDroid. In A. Koziolek, I. Schaefer, &; C. Seidl (Eds.), Software Engineering 2021 (pp. 83–84). Gesellschaft für Informatik e.V.https://doi.org/10.18420/SE2021_30  

Sharma, A., &; Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). Springer.

Mayer, S. (2020). Optimierung von JMCTest beim Testen von Inter Method Contracts. Universität Paderborn.

Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &; Wehrheim, H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In A. Gotsman &; A. Sokolova (Eds.), Formal Techniques for Distributed Objects, Components, and Systems - 40th IFIP WG 6.1 International Conference, FORTE 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings (Vol. 12136, pp. 39–58). Springer.https://doi.org/10.1007/978-3-030-50086-3‑3 

Beringer, S., &; Wehrheim, H. (2020). Consistency Analysis of AUTOSAR Timing Requirements. In M. van Sinderen, H.-Georg Fill, &; L. A. Maciaszek (Eds.), Proceedings of the 15th International Conference on Software Technologies, ICSOFT 2020, Lieusaint, Paris, France, July 7-9, 2020 (pp. 15–26). ScitePress.https://doi.org/10.5220/0009766600150026 

Beyer, D., &; Wehrheim, H. (2020). Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. In T. Margaria &; B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part I (Vol. 12476, pp. 143–167). Springer.https://doi.org/10.1007/978-3-030-61362-4‑8 

Wehrheim, H., &; Cabot, J. (Eds.). (2020). Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings (Vol. 12076). Springer.https://doi.org/10.1007/978-3-030-45234-6 

Ahrendt, W., &; Wehrheim, H. (Eds.). (2020). Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed] (Vol. 12165). Springer.https://doi.org/10.1007/978-3-030-50995-8 

Sharma, A., &; Wehrheim, H. (2020). Testing Monotonicity of Machine Learning Models. CoRR, abs/2002.12278.

Dalvandi, S., Doherty, S., Dongol, B., &; Wehrheim, H. (2020). Owicki-Gries Reasoning forhttps://doi.org/10.4230/DARTS.6.2.15__RAR (Artifact). Dagstuhl Artifacts Ser., 6(2), 15:1-15:2.https://doi.org/10.4230/DARTS.6.2.15 

Dalvandi, S., Doherty, S., Dongol, B., &; Wehrheim, H. (2020). Owicki-Gries Reasoning forhttps://doi.org/10.4230/LIPIcs.ECOOP.2020.11__RAR. In R. Hirschfeld &; T. Pape (Eds.), 34th European Conference on Object-Oriented Programming, ECOOP 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference) (Vol. 166, pp. 11:1-11:26). Schloss Dagstuhl - Leibniz-Zentrum f\'22ur Informatik.https://doi.org/10.4230/LIPIcs.ECOOP.2020.11 

Richter, C., &; Wehrheim, H. (2020). Attend and Represent: A Novel View on Algorithm Selection for Software Verification. In 35th IEEE/ACM International Conference on Automated Software Engineering, ASE 2020, Melbourne, Australia, September 21-25, 2020 (pp. 1016–1028). IEEE.

Ahrendt, W., &; Wehrheim, H. (Eds.). (2020). Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed] (Vol. 12165). Springer.https://doi.org/10.1007/978-3-030-50995-8 

Haltermann, J. F., &; Wehrheim, H. (2020). Cooperative Verification via Collective Invariant Generation. ArXiv:2008.04551.

Sharma, A., &; Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM.

Richter, C., Hüllermeier, E., Jakobs, M.-C., &; Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. Journal of Automated Software Engineering.

Karl, H., Kundisch, D., Meyer auf der Heide, F., &; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business &; Information Systems Engineering, 62(6), 467–481.https://doi.org/10.1007/s12599-019-00627-x 

Pauck, F., Bodden, E., &; Wehrheim, H. (2020). Reproducing Taint-Analysis Results with ReproDroid. In M. Felderer, W. Hasselbring, R. Rabiser, &; R. Jung (Eds.), Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria (pp. 123–124). Gesellschaft f\'22ur Informatik e.V.https://doi.org/10.18420/SE2020_36 

Schneider, S. B., Sharma, A., Karl, H., &; Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) (pp. 116--124). Washington, DC, USA: IFIP.

Sharma, A., &; Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In Proceedings of the Software Engineering Conference (SE) (Vol. P-292, pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).

Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität Paderborn.

Sharma, A., &; Wehrheim, H. (2019). Testing Machine Learning Algorithms for Balanced Data Usage. In IEEE International Conference on Software Testing, Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.

Haltermann, J. F. (2019). Analyzing Data Usage in Array Programs.

Pauck, F., &; Zhang, S. (2019). Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW).https://doi.org/10.1109/asew.2019.00019 

Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &; Wehrheim, H. (2019). Verifying Correctness of Persistent Concurrent Data Structures. In M. H. ter Beek, A. McIver, &; J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years - Third World Congress, FM 2019, Porto, Portugal, October 7-11, 2019, Proceedings (Vol. 11800, pp. 179–195). Springer.https://doi.org/10.1007/978-3-030-30942-8‑12 

Russo, A., Schürr, A., &; Wehrheim, H. (2019). Editorial. Formal Asp. Comput., 31(5), 457–458.https://doi.org/10.1007/s00165-019-00495-y 

Fränzle, M., Kapur, D., Wehrheim, H., &; Zhan, N. (2019). Editorial. Formal Asp. Comput., 31(1), 1.https://doi.org/10.1007/s00165-018-00477-6 

Beyer, D., &; Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based Testing. In Fundamental Approaches to Software Engineering. Cham.https://doi.org/10.1007/978-3-030-16722-6_23 

Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &; Wehrheim, H. (2019). Verifying Correctness of Persistent Concurrent Data Structures. In Formal Methods - The Next 30 Years - Third World Congress, FM 2019, Porto, Portugal, October 7-11, 2019, Proceedings (pp. 179–195).https://doi.org/10.1007/978-3-030-30942-8‑12 

Fränzle, M., Kapur, D., Wehrheim, H., &; Zhan, N. (2019). Editorial. Formal Asp. Comput., 31(1), 1.https://doi.org/10.1007/s00165-018-00477-6 

König, J., &; Wehrheim, H. (2019). Data Independence for Software Transactional Memory. In J. M. Badger &; K. Yvonne Rozier (Eds.), NASA Formal Methods - 11th International Symposium, NFM 2019, Houston, TX, USA, May 7-9, 2019, Proceedings (Vol. 11460, pp. 263–279). Springer.https://doi.org/10.1007/978-3-030-20652-9‑18 

Doherty, S., Dongol, B., Wehrheim, H., &; Derrick, J. (2019). Verifyinghttps://doi.org/10.1145/3293883.3295702__programs operationally. In J. K. Hollingsworth &; I. Keidar (Eds.), Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019 (pp. 355–365). ACM.https://doi.org/10.1145/3293883.3295702 

Beyer, D., Jakobs, M.-C., Lemberger, T., &; Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, &; S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 151--152). GI.https://doi.org/10.18420/se2019-46 

Sharma, A., &; Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In S. Becker, I. Bogicevic, G. Herzwurm, &; S. Wagner (Eds.), Software Engineering and Software Management, SE/SWM 2019, Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 157–158). GI.https://doi.org/10.18420/se2019-48 

Richter, C., &; Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). 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 (Vol. 11429, pp. 229–233). Springer.https://doi.org/10.1007/978-3-030-17502-3_19 

Haltermann, J. (2019). Analyzing Data Usage in Array Programs. Universität Paderborn.

Pauck, F., &; Wehrheim, H. (2019). Together Strong: Cooperative Android App Analysis. Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 374–384.https://doi.org/10.1145/3338906.3338915 

Isenberg, T., Jakobs, M.-C., Pauck, F., &; Wehrheim, H. (2019). When Are Software Verification Results Valid for Approximate Hardware? Tests and Proofs - 13th International Conference, TAP 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 3–20.https://doi.org/10.1007/978-3-030-31157-5_1 

Rautenberg, K. (2018). Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn.

Börding, P., Haltermann, J. F., Jakobs, M.-C., &; Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018) (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.

Schellhorn, G., Wedel, M., Travkin, O., König, J., &; Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software Engineering and Formal Methods (pp. 105–120). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-92970-5_7 

Doherty, S., Derrick, J., Dongol, B., &; Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR.

Pauck, F., Bodden, E., &; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? ArXiv:1804.02903.

Töws, M., &; Wehrheim, H. (2018). Information Flow Certificates. In Theoretical Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-030-02508-3_23 

Pauck, F., Bodden, E., &; Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? In Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press.https://doi.org/10.1145/3236024.3236029 

Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Travkin, O., &; Wehrheim, H. (2018). Mechanized proofs of opacity: a comparison of two techniques. Formal Asp. Comput., 30(5), 597–625.https://doi.org/10.1007/s00165-017-0433-3 

Doherty, S., Dongol, B., Wehrheim, H., &; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In Integrated Formal Methods - 14th International Conference, IFM 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings (pp. 110–129).https://doi.org/10.1007/978-3-319-98938-9‑7 

Doherty, S., Dongol, B., Wehrheim, H., &; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In Integrated Formal Methods - 14th International Conference, IFM 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings (pp. 110–129).https://doi.org/10.1007/978-3-319-98938-9‑7 

Doherty, S., Dongol, B., Wehrheim, H., &; Derrick, J. (2018). Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018 (pp. 45:1-45:3).https://doi.org/10.4230/LIPIcs.DISC.2018.45 

Isenberg, T., Jakobs, M.-C., Pauck, F., &; Wehrheim, H. (2018). Validity of Software Verification Results on Approximate Hardware. IEEE Embedded Systems Letters, 22–25.https://doi.org/10.1109/LES.2017.2758200 

Beyer, D., Jakobs, M.-C., Lemberger, T., &; Wehrheim, H. (2018). Reducer-Based Construction of Conditional Verifiers. In Proceedings of the 40th International Conference on Software Engineering (ICSE) (pp. 1182--1193). Gothenburg, Sweden: ACM.

Börding, P. (2017). Testing Java Method Contracts. Universität Paderborn.

Töws, M., &; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Z. Duan &; L. Ong (Eds.), Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, ICFEM 2017, Xi’an, China, November 13-17, 2017, Proceedings (pp. 362--378).https://doi.org/10.1007/978-3-319-68690-5_22 

König, J., &; Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity Definitions for STMs. In D. Van Hung &; D. Kapur (Eds.), Theoretical Aspects of Computing - ICTAC 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings (pp. 118--135).https://doi.org/10.1007/978-3-319-67729-3_8 

Jakobs, M.-C., &; Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett, M. Davies, &; T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium (pp. 389–403).https://doi.org/10.1007/978-3-319-57288-8_28 

Jakobs, M.-C., Krämer, J., van Straaten, D., &; Lettmann, T. (2017). Certiû01cation Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION) (pp. 7–12).

Isenberg, T. (2017). Incremental Inductive Verification of Parameterized Timed Systems. ACM Transactions on Embedded Computing Systems, (2), 47:1-47:24.https://doi.org/10.1145/2984640 

Töws, M., &; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017) (pp. 362–378). Springer International Publishing.https://doi.org/10.1007/978-3-319-68690-5_22 

Walther, S. (2017). Knowledge-based Verification of Service Compositions. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-307 

Czech, M., Hüllermeier, E., Jakobs, M.-C., &; Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In Proceedings of the 3rd International Workshop on Software Analytics (pp. 23–26).https://doi.org/10.1145/3121257.3121262 

Czech, M., Hüllermeier, E., Jakobs, M.-C., &; Wehrheim, H. (2017). Predicting Rankings of Software Verification Competitions.

Isenberg, T., Platzner, M., Wehrheim, H., &; Wiersema, T. (2017). Proof-Carrying Hardware via Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems, (4), 61:1--61:23.https://doi.org/10.1145/3054743 

Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-104 

Jakobs, M.-C., &; Wehrheim, H. (2017). Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. ACM Transactions on Programming Languages and Systems, (2), 7:1-7:56.https://doi.org/10.1145/3014427 

Pauck, F. (2017). Cooperative static analysis of Android applications. Universität Paderborn.

Bröcher, H. (2016). Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn.

Beringer, S., &; Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, &; A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204).https://doi.org/10.1007/978-3-319-45943-1_13 

Travkin, O., &; Wehrheim, H. (2016). Verification of Concurrent Programs on Weak Memory Models. In A. Sampaio &; F. Wang (Eds.), Theoretical Aspects of Computing - ICTAC 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings (pp. 3--24).https://doi.org/10.1007/978-3-319-46750-4_1 

Schellhorn, G., Travkin, O., &; Wehrheim, H. (2016). Towards a Thread-Local Proof Technique for Starvation Freedom. In M. Huisman (Ed.), Integrated Formal Methods - 12th International Conference, IFM 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings (pp. 193--209).https://doi.org/10.1007/978-3-319-33693-0_13 

Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &; Wehrheim, H. (2016). Proving Opacity of a Pessimistic STM. In P. Fatourou, E. Jim\rquote enez, &; F. Pedone (Eds.), 20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17).https://doi.org/10.4230/LIPIcs.OPODIS.2016.35 

Isenberg, T., Jakobs, M.-Christine, Pauck, F., &; Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. CoRR.

Walther, S., &; Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. Science of Computer Programming, 2--23.https://doi.org/10.1016/j.scico.2016.04.002 

Czech, M., Jakobs, M.-C., &; Wehrheim, H. (2016). Just test what you cannot verify! In U. Z. Jens Knoop (Ed.), Software Engineering 2016 (pp. 17–18).

Krämer, J., &; Wehrheim, H. (2016). A short survey on using software error localization for service compositions. In Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016) (pp. 248--262).https://doi.org/10.1007/978-3-319-44482-6_16 

Krämer, J., &; Wehrheim, H. (2016). A Formal Approach to Error Localization and Correction in Service Compositions. In Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016) (pp. 445--457).https://doi.org/10.1007/978-3-319-50230-4_35 

Töws, M., &; Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis. In Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016) (pp. 466--483).https://doi.org/10.1007/978-3-319-47846-3_29 

Jakobs, M.-C., Töws, M., &; Pauck, F. (2016). PAndA 2f: Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems.

Isenberg, T. (2016). Induction-based Verification of Timed Systems. Universität Paderborn.

Zhang, G. (2016). Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions. Universität Paderborn.

Czech, M. (2016). Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn.

Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin. Universität Paderborn.

Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog. Universität Paderborn.

Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM) (pp. 159--174).https://doi.org/10.1007/978-3-319-22969-0_12 

Czech, M., Jakobs, M.-C., &; Wehrheim, H. (2015). Just test what you cannot verify! In A. Egyed &; I. Schaefer (Eds.), Fundamental Approaches to Software Engineering (pp. 100–114).https://doi.org/10.1007/978-3-662-46675-9_7 

Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed Systems. In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD) (pp. 1–9).https://doi.org/10.1109/ACSD.2015.13 

Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations. Universität Paderborn.

Jakobs, M.-C., &; Wehrheim, H. (2015). Programs from Proofs of Predicated Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied Computing (pp. 1729–1736).https://doi.org/10.1145/2695664.2695690 

Besova, G., Steenken, D., &; Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems &; Structures, 116–138.https://doi.org/10.1016/j.cl.2015.05.003