Reinhold Heckmann

Reinhold Heckmann, Christian Ferdinand, Daniel Kästner, Stefana Nenova: Architecture exploration and timing estimation during early design phases. STTT 15(1): 29-39 (2013)

Daniel Kästner, Marc Schlickling, Markus Pister, Christoph Cullmann, Gernot Gebhard, Reinhold Heckmann, Christian Ferdinand: Meeting Real-Time Requirements with Multi-core Processors. SAFECOMP Workshops 2012: 117-131

Gernot Gebhard, Christoph Cullmann, Reinhold Heckmann: Software Structure and WCET Predictability. PPES 2011: 1-10

Reinhold Heckmann: Similarity, topology, and uniformity. J. Log. Algebr. Program. 79(1): 10-31 (2010)

Daniel Kästner, Reinhold Heckmann, Christian Ferdinand: 100% Coverage for Safety-Critical Software - Efficient Testing by Static Analysis. SAFECOMP 2010: 196-209

Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David B. Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter P. Puschner, Jan Staschulat, Per Stenström: The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst. 7(3) (2008)

Daniel Kästner, Reinhard Wilhelm, Reinhold Heckmann, Marc Schlickling, Markus Pister, Marek Jersak, Kai Richter, Christian Ferdinand: Timing Validation of Automotive Software. ISoLA 2008: 93-107

Christian Ferdinand, Reinhold Heckmann: Worst-Case Execution Time - A Tool Provider's Perspective. ISORC 2008: 340-345

Philippe Baufreton, Reinhold Heckmann: Reliable and Precise WCET and Stack Size Determination for a Real-life Embedded Application. ISoLA 2007: 41-48

Reinhold Heckmann, Christian Ferdinand: Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation. CoRR abs/0710.4753 (2007)

Reinhold Heckmann: Injective Convergence Spaces and Equilogical Spaces via Pretopological Spaces. Electr. Notes Theor. Comput. Sci. 155: 379-399 (2006)

Reinhold Heckmann: A Cartesian closed extension of the category of locales. Mathematical Structures in Computer Science 16(2): 231-253 (2006)

Kevin Hammond, Christian Ferdinand, Reinhold Heckmann: Towards formally verifiable resource bounds for real-time embedded systems. SIGBED Review 3(4): 27-36 (2006)

Christian Ferdinand, Reinhold Heckmann, Hans-Jörg Wolff, Christian Renz, Oleg Parshin, Reinhard Wilhelm: Towards Model-Driven Development of Hard Real-Time Systems. ASWSD 2006: 145-160

Christian Ferdinand, Florian Martin, Christoph Cullmann, Marc Schlickling, Ingmar Stein, Stephan Thesing, Reinhold Heckmann: New Developments in WCET Analysis. Program Analysis and Compilation 2006: 12-52

Armelle Bonenfant, Christian Ferdinand, Kevin Hammond, Reinhold Heckmann: Worst-Case Execution Times for a Purely Functional Language. IFL 2006: 235-252

Christian Ferdinand, Reinhold Heckmann, Hans-Jörg Wolff, Christian Renz, Manabendra Gupta, Oleg Parshin: Towards an Integration of Low-Level Timing Analysis and Model-Based Code Generation. ISoLA 2006: 220-226

Kevin Hammond, Christian Ferdinand, Reinhold Heckmann, Roy Dyckhoff, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace: Towards Formally Verifiable WCET Analysis for a Functional Programming Language. WCET 2006

Christian Ferdinand, Reinhold Heckmann: Verifying Timing Behavior by Abstract Interpretation of Executable Code. CHARME 2005: 336-339

Reinhold Heckmann: A Cartesian Closed Extension of the Category of Locales. Spatial Representation 2005

Reinhold Heckmann, Christian Ferdinand: erifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation. DATE 2005: 618-619

Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace: The Embounded project (project start paper). Trends in Functional Programming 2005: 195-210

Reinhold Heckmann, Christian Ferdinand: Verifying Safety-Critical Properties of Embedded Software by Abstract Interpretation. Sicherheit 2005: 125-128

Reinhold Heckmann: Power domain constructions. Saarland University 2004

Christian Ferdinand, Reinhold Heckmann, Reinhard Wilhelm: Analyzing the Worst-Case Execution Time by Abstract Interpretation of Executable Code. ASWSD 2004: 1-14

Christian Ferdinand, Reinhold Heckmann: aiT: worst case execution time prediction by static program analysis. IFIP Congress Topical Sessions 2004: 377-384

Reinhold Heckmann, Marc Langenbach, Stephan Thesing, Reinhard Wilhelm: The influence of processor architecture on the design and the results of WCET tools. Proceedings of the IEEE 91(7): 1038-1054 (2003)

Reinhold Heckmann: A non-topological view of dcpos as convergence spaces. Theor. Comput. Sci. 305(1-3): 159-186 (2003)

Stephan Thesing, Jean Souyris, Reinhold Heckmann, Famantanantsoa Randimbivololona, Marc Langenbach, Reinhard Wilhelm, Christian Ferdinand: An Abstract Interpretation-Based Timing Validation of Hard Real-Time Avionics Software. DSN 2003: 625-632

Christian Ferdinand, Daniel Kästner, Florian Martin, Marc Langenbach, Martin Sicks, Stephan Wilhelm, Reinhold Heckmann, Nicolas Fritz, Stephan Thesing, Frank Fontaine, Henrik Theiling, Michael Schmidt, Alexander A. Evstiougov-Babaev, Reinhard Wilhelm: Validierung des Zeitverhaltens von kritischer Echtzeit-Software. GI Jahrestagung (1) 2003: 335-339

Christian Ferdinand, Reinhold Heckmann, Henrik Theiling, Reinhard Wilhelm: Convenient User Annotations for a WCET Tool. WCET 2003: 17-20

Reinhold Heckmann: Contractivity of linear fractional transformations. Theor. Comput. Sci. 279(1-2): 65-82 (2002)

Marc Langenbach, Stephan Thesing, Reinhold Heckmann: Pipeline Modeling for Timing Analysis. SAS 2002: 294-309

Reinhold Heckmann: Characterising FS domains by means of power domains. Theor. Comput. Sci. 264(2): 195-203 (2001)

Reinhold Heckmann: Translation of Taylor Series into LFT Expansions. Symbolic Algebraic Methods and Verification Methods 2001: 107-116

Christian Ferdinand, Reinhold Heckmann, Marc Langenbach, Florian Martin, Michael Schmidt, Henrik Theiling, Stephan Thesing, Reinhard Wilhelm: Reliable and Precise WCET Determination for a Real-Life Processor. EMSOFT 2001: 469-485

Reinhold Heckmann: A Non-Topological View of Dcpos as Convergence Spaces (Extended Abstract). Electr. Notes Theor. Comput. Sci. 40: 187 (2000)

Abbas Edalat, Reinhold Heckmann: Computing with Real Numbers. APPSEM 2000: 193-267

Reinhold Heckmann: Approximation of Metric Spaces by Partial Metric Spaces. Applied Categorical Structures 7(1-2): 71-83 (1999)

Reinhold Heckmann: Completeness Classes of Equilogical Spaces. Electr. Notes Theor. Comput. Sci. 20: 293-308 (1999)

Reinhold Heckmann: How Many Argument Digits are Needed to Produce n Result Digits? Electr. Notes Theor. Comput. Sci. 24: 13-33 (1999)

Reinhold Heckmann: Big Integers and Complexity Issues in Exact Real Arithmetic. Electr. Notes Theor. Comput. Sci. 13: 69 (1998)

Abbas Edalat, Reinhold Heckmann: A Computational Model for Metric Spaces. Theor. Comput. Sci. 193(1-2): 53-73 (1998)

Reinhold Heckmann: The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations. FoSSaCS 1998: 172-188

Reinhold Heckmann: Abstract valuations: A novel representation of Plotkin power domain and Vietoris hyperspace. Electr. Notes Theor. Comput. Sci. 6: 160-173 (1997)

Reinhold Heckmann, Reinhard Wilhelm: A Functional Description of TEX's Formula Layout. J. Funct. Program. 7(5): 451-485 (1997)

Reinhold Heckmann, Michael Huth: A Duality Theory for Quantitative Semantics. CSL 1997: 255-274

Reinhard Wilhelm, Reinhold Heckmann: Grundlagen der Dokumentenverarbeitung. Addison-Wesley 1996, isbn 978-3-89319-877-1, pp. I-XIV, 1-274

Reinhold Heckmann: Lower Bag Domains. Fundam. Inform. 24(3): 259-281 (1995)

Reinhold Heckmann: Stable Power Domains. Theor. Comput. Sci. 136(1): 21-56 (1994)

Reinhold Heckmann: Probabilistic Domains. CAAP 1994: 142-156

Reinhold Heckmann: Power Domains and Second-Order Predicates. Theor. Comput. Sci. 111(1&2): 59-88 (1993)

Reinhold Heckmann: Product Operations in Strong Monads. Theory and Formal Methods 1993: 159-170

Reinhold Heckmann: Probabilistic Power Domains, Information Systems, and Locales. MFPS 1993: 410-437

Reinhold Heckmann, Georg Sander: TrafoLa-H Reference Manual. PROSPECTRA Book 1993: 275-313

Reinhold Heckmann: Power Domains Supporting Recursion and Failure. CAAP 1992: 165-181

Reinhold Heckmann: Lower and Upper Power Domain Constructions Commute on all Cpos. Inf. Process. Lett. 40(1): 7-11 (1991)

Reinhold Heckmann: Power Domain Constructions. Sci. Comput. Program. 17(1-3): 77-117 (1991)

Reinhold Heckmann: An Upper Power Domain Construction in Terms of Strongly Compact Sets. MFPS 1991: 272-293

Reinhold Heckmann: Power domain constructions. Universität Saarbrücken 1990, pp. I-VII, 1-285

Reinhold Heckmann: Set Domains. ESOP 1990: 177-196

Reinhold Heckmann: A Functional Language for the Specification of Complex Tree Transformations. ESOP 1988: 175-190

Reinhold Heckmann: A Functional Language for the Specification of Complex Tree Transformations (System Exhibition). ESOP 1988: 380

Reinhold Heckmann: An Efficient ELL(1)-Parser Generator. Acta Inf. 23(2): 127-148 (1986)