default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFriedhelm Stappert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Natalie Kiesler, Ingo Scholz, Jens Albrecht, Friedhelm Stappert, Uwe Wienkop:
Novice Learners of Programming and Generative AI - Prior Knowledge Matters. Koli Calling 2024: 51:1-51:2
2010 – 2019
- 2016
- [j3]Peter Altenbernd, Jan Gustafsson, Björn Lisper, Friedhelm Stappert:
Early execution time-estimation through automatically generated timing models. Real Time Syst. 52(6): 731-760 (2016) - 2010
- [c10]Yiannis Papadopoulos
, Martin Walker, Mark-Oliver Reiser, Matthias Weber, De-Jiu Chen, Martin Törngren, David Servat, Andreas Abele, Friedhelm Stappert, Henrik Lönn, L. Berntsson, Rolf Johansson, Fulvio Tagliabo, Sandra Torchiaro, Anders Sandberg:
Automatic allocation of safety integrity levels. EDCC-CARS 2010: 7-10 - [c9]Rolf Johansson, Stefan Bunzel, Marc Graniou, Henrik Lönn, Håkan Sivencrona, Friedhelm Stappert:
A road-map for enabling system analysis of AUTOSAR-based systems. EDCC-CARS 2010: 21-24
2000 – 2009
- 2005
- [j2]Andreas Ermedahl, Friedhelm Stappert, Jakob Engblom:
Clustered Worst-Case Execution-Time Calculation. IEEE Trans. Computers 54(9): 1104-1122 (2005) - 2004
- [b1]Friedhelm Stappert:
From low level to model based and constructive worst case execution time analysis. University of Paderborn, 2004, ISBN 3-8322-2637-0, pp. 1-137 - 2003
- [c8]Andreas Ermedahl, Friedhelm Stappert, Jakob Engblom:
Clustered calculation of worst-case execution times. CASES 2003: 51-62 - [c7]Friedhelm Stappert, Carsten Rust:
Worst Case Execution Time Analysis for Petri Net Models of Embedded Systems. Embedded Systems and Applications 2003: 176-182 - 2002
- [c6]Carsten Rust, Friedhelm Stappert, Reinhard Bernhardi-Grisson:
Petri Net Based Design of Reconfigurable Embedded. DIPES 2002: 41-50 - 2001
- [c5]Friedhelm Stappert, Andreas Ermedahl, Jakob Engblom:
Efficient longest executable path search for programs with complex flows and pipeline effects. CASES 2001: 132-140 - 2000
- [j1]Friedhelm Stappert, Peter Altenbernd:
Complete worst-case execution time analysis of straight-line hard real-time programs. J. Syst. Archit. 46(4): 339-355 (2000) - [c4]Carsten Rust, Friedhelm Stappert, Peter Altenbernd, Jürgen Tacken:
From High-Level Specifications Down to Software Implementations of Parallel Embedded Real-Time Systems. DATE 2000: 686-691 - [c3]Peter Altenbernd, Lars-Olof Burchard, Friedhelm Stappert:
Worst-case execution times analysis of MPEG-2 decoding. ECRTS 2000: 73-80
1990 – 1999
- 1998
- [c2]Wolfram Hardt, Peter Altenbernd, Carsten Böke, Giuseppe Del Castillo, C. Ditze, Edwin Erpenbach, Uwe Glässer, Bernd Kleinjohann, Georg Lehrenfeld, Franz J. Rammig, Carsten Rust, Friedhelm Stappert, Joachim Stroop, Jürgen Tacken:
Paradise: Design Environment for Parallel & Distributed, Embedded Real-Time Systems. DIPES 1998: 181-190 - 1997
- [c1]Friedhelm Stappert:
Predicting pipelining and caching behaviour of hard real-time programs. RTS 1997: 80-86
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-11-19 21:47 CET 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:
