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