default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReinhold Heckmann
Person information
- affiliation: Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c42]Wolfgang Ecker, Peer Adelt, Wolfgang Müller, Reinhold Heckmann, Milos Krstic
, Vladimir Herdt, Rolf Drechsler, Gerhard Angst, Ralf Wimmer, Andreas Mauderer, Rafael Stahl, Karsten Emrich, Daniel Mueller-Gritschneder, Bernd Becker, Philipp Scholl, Eyck Jentzsch, Jan Schlamelcher, Kim Grüttner, Paul Palomero Bernardo, Oliver Bringmann, Mihaela Damian, Julian Oppermann, Andreas Koch, Jörg Bormann, Johannes Partzsch, Christian Mayr, Wolfgang Kunz:
The Scale4Edge RISC-V Ecosystem. DATE 2022: 808-813
2010 – 2019
- 2015
- [j20]Martin Schoeberl, Sahar Abbaspour, Benny Akesson, Neil C. Audsley, Raffaele Capasso, Jamie Garside, Kees Goossens, Sven Goossens, Scott Hansen, Reinhold Heckmann, Stefan Hepp, Benedikt Huber, Alexander Jordan, Evangelia Kasapaki, Jens Knoop, Yonghui Li, Daniel Prokesch, Wolfgang Puffitsch, Peter P. Puschner, André Rocha, Cláudio Silva, Jens Sparsø, Alessandro Tocchi:
T-CREST: Time-predictable multi-core architecture for embedded systems. J. Syst. Archit. 61(9): 449-471 (2015) - [j19]Reinhold Heckmann:
Spatiality of countably presentable locales (proved with the Baire category theorem). Math. Struct. Comput. Sci. 25(7): 1607-1625 (2015) - 2013
- [j18]Reinhold Heckmann, Christian Ferdinand, Daniel Kästner, Stefana Nenova:
Architecture exploration and timing estimation during early design phases. Int. J. Softw. Tools Technol. Transf. 15(1): 29-39 (2013) - [c41]Reinhold Heckmann, Klaus Keimel:
Quasicontinuous Domains and the Smyth Powerdomain. MFPS 2013: 215-232 - 2012
- [c40]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 - 2011
- [c39]Gernot Gebhard, Christoph Cullmann, Reinhold Heckmann:
Software Structure and WCET Predictability. PPES 2011: 1-10 - 2010
- [j17]Reinhold Heckmann:
Similarity, topology, and uniformity. J. Log. Algebraic Methods Program. 79(1): 10-31 (2010) - [c38]Daniel Kästner, Reinhold Heckmann, Christian Ferdinand:
100% Coverage for Safety-Critical Software - Efficient Testing by Static Analysis. SAFECOMP 2010: 196-209
2000 – 2009
- 2008
- [j16]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. Embed. Comput. Syst. 7(3): 36:1-36:53 (2008) - [c37]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 - [c36]Christian Ferdinand, Reinhold Heckmann:
Worst-Case Execution Time - A Tool Provider's Perspective. ISORC 2008: 340-345 - 2007
- [c35]Philippe Baufreton, Reinhold Heckmann:
Reliable and Precise WCET and Stack Size Determination for a Real-life Embedded Application. ISoLA 2007: 41-48 - [i2]Reinhold Heckmann, Christian Ferdinand:
Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation. CoRR abs/0710.4753 (2007) - 2006
- [j15]Reinhold Heckmann:
A Cartesian closed extension of the category of locales. Math. Struct. Comput. Sci. 16(2): 231-253 (2006) - [j14]Kevin Hammond, Christian Ferdinand, Reinhold Heckmann:
Towards formally verifiable resource bounds for real-time embedded systems. SIGBED Rev. 3(4): 27-36 (2006) - [c34]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 - [c33]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 - [c32]Armelle Bonenfant, Christian Ferdinand, Kevin Hammond, Reinhold Heckmann:
Worst-Case Execution Times for a Purely Functional Language. IFL 2006: 235-252 - [c31]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 - [c30]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 - 2005
- [c29]Christian Ferdinand, Reinhold Heckmann:
Verifying Timing Behavior by Abstract Interpretation of Executable Code. CHARME 2005: 336-339 - [c28]Reinhold Heckmann, Christian Ferdinand:
Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation. DATE 2005: 618-619 - [c27]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 - [c26]Reinhold Heckmann, Christian Ferdinand:
Verifying Safety-Critical Properties of Embedded Software by Abstract Interpretation. Sicherheit 2005: 125-128 - [c25]Reinhold Heckmann:
Injective Convergence Spaces and Equilogical Spaces via Pretopological Spaces. MFPS 2005: 379-399 - [i1]Reinhold Heckmann:
A Cartesian Closed Extension of the Category of Locales. Spatial Representation 2005 - 2004
- [c24]Christian Ferdinand, Reinhold Heckmann, Reinhard Wilhelm:
Analyzing the Worst-Case Execution Time by Abstract Interpretation of Executable Code. ASWSD 2004: 1-14 - [c23]Christian Ferdinand, Reinhold Heckmann:
aiT: worst case execution time prediction by static program analysis. IFIP Congress Topical Sessions 2004: 377-383 - 2003
- [j13]Reinhold Heckmann, Marc Langenbach, Stephan Thesing, Reinhard Wilhelm:
The influence of processor architecture on the design and the results of WCET tools. Proc. IEEE 91(7): 1038-1054 (2003) - [j12]Reinhold Heckmann:
A non-topological view of dcpos as convergence spaces. Theor. Comput. Sci. 305(1-3): 159-186 (2003) - [c22]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 - [c21]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 - [c20]Christian Ferdinand, Reinhold Heckmann, Henrik Theiling, Reinhard Wilhelm:
Convenient User Annotations for a WCET Tool. WCET 2003: 17-20 - 2002
- [j11]Reinhold Heckmann:
Contractivity of linear fractional transformations. Theor. Comput. Sci. 279(1-2): 65-82 (2002) - [c19]Marc Langenbach, Stephan Thesing, Reinhold Heckmann:
Pipeline Modeling for Timing Analysis. SAS 2002: 294-309 - 2001
- [j10]Reinhold Heckmann:
Characterising FS domains by means of power domains. Theor. Comput. Sci. 264(2): 195-203 (2001) - [c18]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 - [p1]Reinhold Heckmann:
Translation of Taylor Series into LFT Expansions. Symbolic Algebraic Methods and Verification Methods 2001: 107-116 - 2000
- [c17]Abbas Edalat, Reinhold Heckmann:
Computing with Real Numbers. APPSEM 2000: 193-267 - [c16]Reinhold Heckmann:
A Non-Topological View of Dcpos as Convergence Spaces (Extended Abstract). MFCSIT 2000: 187
1990 – 1999
- 1999
- [j9]Reinhold Heckmann:
Approximation of Metric Spaces by Partial Metric Spaces. Appl. Categorical Struct. 7(1-2): 71-83 (1999) - [c15]Reinhold Heckmann:
Completeness Classes of Equilogical Spaces. MFPS 1999: 293-308 - 1998
- [j8]Abbas Edalat, Reinhold Heckmann:
A Computational Model for Metric Spaces. Theor. Comput. Sci. 193(1-2): 53-73 (1998) - [c14]Reinhold Heckmann:
The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations. FoSSaCS 1998: 172-188 - [c13]Reinhold Heckmann:
How Many Argument Digits are Needed to Produce n Result Digits? RealComp 1998: 13-33 - 1997
- [j7]Reinhold Heckmann, Reinhard Wilhelm:
A Functional Description of TEX's Formula Layout. J. Funct. Program. 7(5): 451-485 (1997) - [c12]Reinhold Heckmann, Michael Huth:
A Duality Theory for Quantitative Semantics. CSL 1997: 255-274 - [c11]Reinhold Heckmann:
Big Integers and Complexity Issues in Exact Real Arithmetic. COMPROX 1997: 69 - [c10]Reinhold Heckmann:
Abstract valuations: A novel representation of Plotkin power domain and Vietoris hyperspace. MFPS 1997: 160-173 - 1996
- [b2]Reinhard Wilhelm, Reinhold Heckmann:
Grundlagen der Dokumentenverarbeitung. Addison-Wesley 1996, ISBN 978-3-89319-877-1, pp. I-XIV, 1-274 - 1995
- [j6]Reinhold Heckmann:
Lower Bag Domains. Fundam. Informaticae 24(3): 259-281 (1995) - 1994
- [j5]Reinhold Heckmann:
Stable Power Domains. Theor. Comput. Sci. 136(1): 21-56 (1994) - [c9]Reinhold Heckmann:
Probabilistic Domains. CAAP 1994: 142-156 - 1993
- [j4]Reinhold Heckmann:
Power Domains and Second-Order Predicates. Theor. Comput. Sci. 111(1&2): 59-88 (1993) - [c8]Reinhold Heckmann:
Product Operations in Strong Monads. Theory and Formal Methods 1993: 159-170 - [c7]Reinhold Heckmann:
Probabilistic Power Domains, Information Systems, and Locales. MFPS 1993: 410-437 - [c6]Reinhold Heckmann, Georg Sander:
TrafoLa-H Reference Manual. PROSPECTRA Book 1993: 275-313 - 1992
- [c5]Reinhold Heckmann:
Power Domains Supporting Recursion and Failure. CAAP 1992: 165-181 - 1991
- [j3]Reinhold Heckmann:
Lower and Upper Power Domain Constructions Commute on all Cpos. Inf. Process. Lett. 40(1): 7-11 (1991) - [j2]Reinhold Heckmann:
Power Domain Constructions. Sci. Comput. Program. 17(1-3): 77-117 (1991) - [c4]Reinhold Heckmann:
An Upper Power Domain Construction in Terms of Strongly Compact Sets. MFPS 1991: 272-293 - 1990
- [b1]Reinhold Heckmann:
Power domain constructions. Universität Saarbrücken, 1990, pp. I-VII, 1-285 - [c3]Reinhold Heckmann:
Set Domains. ESOP 1990: 177-196
1980 – 1989
- 1988
- [c2]Reinhold Heckmann:
A Functional Language for the Specification of Complex Tree Transformations. ESOP 1988: 175-190 - [c1]Reinhold Heckmann:
A Functional Language for the Specification of Complex Tree Transformations (System Exhibition). ESOP 1988: 380 - 1986
- [j1]Reinhold Heckmann:
An Efficient ELL(1)-Parser Generator. Acta Informatica 23(2): 127-148 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
