| 2008 |
|---|
| 49 | EE | Christian Ferdinand,
Reinhold Heckmann:
Worst-Case Execution Time - A Tool Provider's Perspective.
ISORC 2008: 340-345 |
| 48 | EE | 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) |
| 2007 |
|---|
| 47 | EE | Reinhold Heckmann,
Christian Ferdinand:
Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation
CoRR abs/0710.4753: (2007) |
| 2006 |
|---|
| 46 | EE | Armelle Bonenfant,
Christian Ferdinand,
Kevin Hammond,
Reinhold Heckmann:
Worst-Case Execution Times for a Purely Functional Language.
IFL 2006: 235-252 |
| 45 | EE | 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 |
| 44 | EE | 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 |
| 43 | EE | Reinhold Heckmann:
Injective Convergence Spaces and Equilogical Spaces via Pretopological Spaces.
Electr. Notes Theor. Comput. Sci. 155: 379-399 (2006) |
| 2005 |
|---|
| 42 | EE | Christian Ferdinand,
Reinhold Heckmann:
Verifying Timing Behavior by Abstract Interpretation of Executable Code.
CHARME 2005: 336-339 |
| 41 | EE | Reinhold Heckmann,
Christian Ferdinand:
erifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation.
DATE 2005: 618-619 |
| 40 | | Reinhold Heckmann,
Christian Ferdinand:
Verifying Safety-Critical Properties of Embedded Software by Abstract Interpretation.
Sicherheit 2005: 125-128 |
| 39 | EE | Reinhold Heckmann:
A Cartesian Closed Extension of the Category of Locales.
Spatial Representation 2005 |
| 38 | | 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 |
| 2004 |
|---|
| 37 | EE | Christian Ferdinand,
Reinhold Heckmann,
Reinhard Wilhelm:
Analyzing the Worst-Case Execution Time by Abstract Interpretation of Executable Code.
ASWSD 2004: 1-14 |
| 36 | | Christian Ferdinand,
Reinhold Heckmann:
aiT: worst case execution time prediction by static program analysis.
IFIP Congress Topical Sessions 2004: 377-384 |
| 2003 |
|---|
| 35 | EE | 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- |
| 34 | | 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 |
| 33 | | Christian Ferdinand,
Reinhold Heckmann,
Henrik Theiling,
Reinhard Wilhelm:
Convenient User Annotations for a WCET Tool.
WCET 2003: 17-20 |
| 32 | | 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) |
| 31 | EE | Reinhold Heckmann:
A non-topological view of dcpos as convergence spaces.
Theor. Comput. Sci. 305(1-3): 159-186 (2003) |
| 2002 |
|---|
| 30 | EE | Marc Langenbach,
Stephan Thesing,
Reinhold Heckmann:
Pipeline Modeling for Timing Analysis.
SAS 2002: 294-309 |
| 29 | EE | Reinhold Heckmann:
Contractivity of linear fractional transformations.
Theor. Comput. Sci. 279(1-2): 65-82 (2002) |
| 2001 |
|---|
| 28 | EE | 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 |
| 27 | | Reinhold Heckmann:
Translation of Taylor Series into LFT Expansions.
Symbolic Algebraic Methods and Verification Methods 2001: 107-116 |
| 26 | EE | Reinhold Heckmann:
Characterising FS domains by means of power domains.
Theor. Comput. Sci. 264(2): 195-203 (2001) |
| 2000 |
|---|
| 25 | EE | Abbas Edalat,
Reinhold Heckmann:
Computing with Real Numbers.
APPSEM 2000: 193-267 |
| 24 | EE | Reinhold Heckmann:
A Non-Topological View of Dcpos as Convergence Spaces (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 1999 |
|---|
| 23 | EE | Reinhold Heckmann:
Completeness Classes of Equilogical Spaces.
Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 22 | EE | Reinhold Heckmann:
How Many Argument Digits are Needed to Produce n Result Digits?
Electr. Notes Theor. Comput. Sci. 24: (1999) |
| 1998 |
|---|
| 21 | EE | Reinhold Heckmann:
The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations.
FoSSaCS 1998: 172-188 |
| 20 | EE | Reinhold Heckmann:
Big Integers and Complexity Issues in Exact Real Arithmetic.
Electr. Notes Theor. Comput. Sci. 13: (1998) |
| 19 | EE | Abbas Edalat,
Reinhold Heckmann:
A Computational Model for Metric Spaces.
Theor. Comput. Sci. 193(1-2): 53-73 (1998) |
| 1997 |
|---|
| 18 | | Reinhold Heckmann,
Michael Huth:
A Duality Theory for Quantitative Semantics.
CSL 1997: 255-274 |
| 17 | EE | Reinhold Heckmann:
Abstract valuations: A novel representation of Plotkin power domain and Vietoris hyperspace.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 16 | | Reinhold Heckmann,
Reinhard Wilhelm:
A Functional Description of TEX's Formula Layout.
J. Funct. Program. 7(5): 451-485 (1997) |
| 1995 |
|---|
| 15 | | Reinhold Heckmann:
Lower Bag Domains.
Fundam. Inform. 24(3): 259-281 (1995) |
| 1994 |
|---|
| 14 | | Reinhold Heckmann:
Probabilistic Domains.
CAAP 1994: 142-156 |
| 13 | | Reinhold Heckmann:
Stable Power Domains.
Theor. Comput. Sci. 136(1): 21-56 (1994) |
| 1993 |
|---|
| 12 | | Reinhold Heckmann:
Probabilistic Power Domains, Information Systems, and Locales.
MFPS 1993: 410-437 |
| 11 | | Reinhold Heckmann,
Georg Sander:
TrafoLa-H Reference Manual.
PROSPECTRA Book 1993: 275-313 |
| 10 | | Reinhold Heckmann:
Product Operations in Strong Monads.
Theory and Formal Methods 1993: 159-170 |
| 9 | | Reinhold Heckmann:
Power Domains and Second-Order Predicates.
Theor. Comput. Sci. 111(1&2): 59-88 (1993) |
| 1992 |
|---|
| 8 | | Reinhold Heckmann:
Power Domains Supporting Recursion and Failure.
CAAP 1992: 165-181 |
| 1991 |
|---|
| 7 | | Reinhold Heckmann:
An Upper Power Domain Construction in Terms of Strongly Compact Sets.
MFPS 1991: 272-293 |
| 6 | | Reinhold Heckmann:
Lower and Upper Power Domain Constructions Commute on all Cpos.
Inf. Process. Lett. 40(1): 7-11 (1991) |
| 5 | | Reinhold Heckmann:
Power Domain Constructions.
Sci. Comput. Program. 17(1-3): 77-117 (1991) |
| 1990 |
|---|
| 4 | | Reinhold Heckmann:
Set Domains.
ESOP 1990: 177-196 |
| 1988 |
|---|
| 3 | | Reinhold Heckmann:
A Functional Language for the Specification of Complex Tree Transformations.
ESOP 1988: 175-190 |
| 2 | | Reinhold Heckmann:
A Functional Language for the Specification of Complex Tree Transformations (System Exhibition).
ESOP 1988: 380 |
| 1986 |
|---|
| 1 | | Reinhold Heckmann:
An Efficient ELL(1)-Parser Generator.
Acta Inf. 23(2): 127-148 (1986) |
