Dr. Reinhold Heckmann

Curriculum vitæ

Reinhold Heckmann, born in 1959, completed the diploma degree program in computer science and mathematics at the Saarland University from 1979 to 1984, and his PhD in 1991 (summa cum laude). In recognition of his work, he was awarded the Dr. Eduard Martin Prize in 1993 for the best PhD dissertation in computer science at the Saarland University. He completed his post-doctoral dissertation in 1996 and has been an Assistant (Privatdozent) at Saarland University since this time.

The subject of Reinhold Heckmann’s master’s thesis was “Generation of LL Parsers from Context-free Grammars Employing Regular Productions”. From 1984 to 1999 he was a research associate at Saarland University’s Department for Compiler Construction and Programming Languages, in addition to participating in the ESPRIT project PROSPECTRA (Programming by Specification and Transformation) and being a member of Collaborative Research Center no. 124 (VLSI and Parallelism). During this time, he designed and implemented TrafoLa, a non-deterministic functional programming language, and worked on program semantics. In his PhD dissertation, he developed an algebraic theory of power domain constructions.

Dr. Heckmann was visiting fellow at Imperial College, London, in 1992, visiting professor at the Free University of Berlin in 1994, and visiting professor at Trier University 1996. During this time, he worked on semantic domains with applications to measure theory and integration theory, on exact real arithmetic, and on text processing. In 1999, he was a research fellow at Imperial College, London, working on the design and implementation of algorithms for exact real arithmetic. Since September 2000, he is a Senior Researcher at AbsInt. He is also in charge of the documentation for most of our products.

Research interests

  • Domain theory
  • Equilogical spaces and convergence spaces
  • Exact real arithmetic
  • Document processing
  • Functional programming languages
  • Compiler construction

Selected publications

  • D. Kästner, C. Rustemeier, U. Kiffmeier, D. Fleischer, S. Nenova, R. Heckmann, M. Schlickling, C. Ferdinand. Model-Driven Code Generation and Analysis. SAE World Congress 2014.
  • D. Kästner, M. Schlickling, M. Pister, C. Cullmann, G. Gebhard, R. Heckmann, C. Ferdinand. Meeting Real-Time Requirements with Multi-Core Processors. Safecomp 2012 Workshop: Next Generation of System Assurance Approaches for Safety-Critical Systems (SASSUR), Magdeburg, September 2012.
  • D. Kästner, R. Wilhelm, R. Heckmann, M. Schlickling, M. Pister, M. Jersak, K. Richter, C. Ferdinand. Timing Validation of Automotive Software. 3rd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISOLA), Kassandra, Greece, 2008.
  • C. Ferdinand, R. Heckmann, and D. Kästner. Static Memory and Timing Analysis of Embedded Systems Code. Proceedings of The IET Conference on Embedded Systems at Embedded Systems Show (ESS) 2006, Birmingham.
  • Reinhold Heckmann, Christian Ferdinand. Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation. DATE 2005, pages 618–619.
  • Abbas Edalat, Reinhold Heckmann. Computing with Real Numbers: I. The LFT Approach to Real Number Computation; II. A Domain Framework for Computational Geometry. Gilles Barthe, Peter Dybjer, Luis Pinto, and Joao Saraiva (eds.), Applied Semantics — Lecture Notes from the International Summer School, Caminha, Portugal, 2000. LNCS 2395, 193–267, Springer, 2002.
  • Reinhold Heckmann. Contractivity of Linear Fractional Transformations. Theoretical Computer Science, Vol. 279 (1), pages 65–82.
  • Reinhold Heckmann. A Non-Topological View of Dcpo’s as Convergence Spaces. Theoretical Computer Science, Vol. 305, pages 159–186.
  • Reinhold Heckmann. Completeness Classes of Equilogical Spaces. MFPS’99, New Orleans. Electronic Notes in Theoretical Computer Science, Vol. 20.
  • Reinhold Heckmann. Approximation of Metric Spaces by Partial Metric Spaces. Applied Categorical Structures, Vol. 7, pages 71–83.
  • Abbas Edalat, Reinhold Heckmann. A Computational Model for Metric Spaces. Theoretical Computer Science, Vol. 193, pages 53–73.
  • Reinhold Heckmann. The Appearance of Big Integers in Exact Real Arithmetic based on Linear Fractional Transformations. Foundations of Software Science and Computation Structures, LNCS 1378, pages 172–188, Springer, 1998.
  • Reinhold Heckmann, Martín Escardó. Topologies on Spaces of Continuous Functions. Topology Proceedings, Vol. 26 (2), pages 545–564.
  • Reinhold Heckmann, Michael Huth. A Duality Theory for Quantitative Semantics. Computer Science Logic CSL’97 (Selected Papers), LNCS 1414, pages 255–274, Springer, 1998.
  • Reinhold Heckmann. Characterising FS Domains by means of Power Domains. Theoretical Computer Science, Vol. 264 (2), pages 195–203.
  • Reinhard Wilhelm, Reinhold Heckmann. Grundlagen der Dokumentenverarbeitung (book). Addison Wesley Longman, 1996.
  • Reinhold Heckmann, Reinhard Wilhelm. A Functional Description of TeX’s Formula Layout. Journal of Functional Programming, Vol. 7 (5), pages 451–485.
  • Reinhold Heckmann. Spaces of Valuations. Summer Conference on General Topology and Applications 1995, Annals of the New York Academy of Sciences, Vol. 806, pages 174–200.
  • Reinhold Heckmann. Lower Bag Domains. Fundamenta Informaticae, Vol. 24 (3), pages 259–281.
  • Reinhold Heckmann. Probabilistic Domains. CAAP’94, LNCS 787, pages 142–156, Springer, 1994.
  • Reinhold Heckmann. Probabilistic Power Domains, Information Systems, and Locales. MFPS’93, LNCS 802, pages 410–437, Springer, 1994.
  • Reinhold Heckmann. Power Domains Supporting Recursion and Failure. CAAP’92, LNCS 581, pages 165–181, Springer, 1992.
  • Reinhold Heckmann. Product Operations in Strong Monads. First Imperial College Workshop on Theory and Formal Methods 1993, Springer Workshops in Computing, pages 159–170.
  • Reinhold Heckmann. Observable Modules and Power Domain Constructions. M. Droste and Y. Gurevich, eds., Semantics of Programming Languages and Model Theory, Algebra, Logic, and Applications Vol. 5, pages 159–187. Gordon and Breach Science Publishers, OPA (Amsterdam), 1993.
  • Reinhold Heckmann. An Upper Power Domain Construction in terms of Strongly Compact Sets. MFPS’91, LNCS 598, pages 272–293, Springer, 1992.
  • Reinhold Heckmann. Power Domain Constructions. Phd thesis, Saarland University, 1990.
  • Reinhold Heckmann. Set Domains. ESOP’90, LNCS 432, pages 177–196, Springer, 1990.
  • Reinhold Heckmann. A Functional Language for the Specification of Complex Tree Transformations. ESOP’88, LNCS 300, pages 175–190, Springer 1988.
  • Reinhold Heckmann. ELL(k)-Parsing and Efficient ELL(1)-Parser Generation. Diploma thesis, Saarland University, 1984.