Tools and Algorithms for the Construction and Analysis of Systems
C. R. Ramakrishnan and J. Rehof (Eds.)
14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings Springer 2008.
Automatic composition of rough solution possibilities in the target planning of factory planning projects by means of combinatorial logic
J. Winkels, J. Graefenstein, T. Schäfer, D. Scholz, J. Rehof and M. Henke
Proceedings of 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation. Ed. by Tiziana Margaria and Bernhard Steffen. accepted.
Zypern, November 04-09 2018.
A Methodology for Combinatory Process Synthesis: Process Variability in Clinical Pathways
T. Schäfer, F. Möller, A. Burmann, Y. Pikus, N. Weißenberg, M. Hintze and J. Rehof
J. Bessai, A. Dudenhefner, B. Düdder, M. Martens and J. Rehof
Proceedings of 7th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation. Ed. by Tiziana Margaria and Bernhard Steffen. accepted.
J. Bessai, B. Düdder, G. T. Heineman, and J. Rehof
Proceedings of 7th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation. Ed. by Tiziana Margaria and Bernhard Steffen. accepted.
In Proceedings of Software Engineering & Software Management 2015, GI Fachtagung Software Engineering 2015, Dresden, Germany, March 17-20, 2015, Lecture Notes in Informatics (LNI), 89-90.
2014
Combinatory Logic Synthesizer
J. Bessai, A. Dudenhefner, B. Düdder, M. Martens and J. Rehof
ISoLA 2014, 6th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, Corfu, Greece, October 2014, Part I, LNCS 8802, pp. 26--40. Springer, Heidelberg, 2014
Context-Bounded Model Checking of Concurrent Software
J. Rehof and S. Qadeer
Proceedings TACAS 2005, Eleventh International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Edinburgh, U.K., April 4-8, 2005.
Science of Computer Programming 35 (1999) 191-221.
A shorter conference version appeared in Proceedings SAS '96, Third International Static Analysis Symposium, Aachen, Germany, September 1996. Lecture Notes in Computer Science, vol. 1145.
Proceedings TACS '94, International Symposium on Theoretical Aspects of Computer Software, Sendai, Japan, April 1994. Lecture Notes in Computer Science vol. 789, 1994.
The main objective of this thesis is to understand why polymorphic subtype inference systems may be inherently difficult to scale up. This is done through a study of the complexity of type size, constraint simplification and constraint entailment in simple subtyping systems.
Some key results in the thesis were presented in conference papers at ICALP '98, LICS '97 and POPL '97.