Most cited papers from AbsInt (Germany)

AbsInt (Germany)

What are the most cited papers from AbsInt (Germany)?

The most cited paper from AbsInt (Germany) is "The worst-case execution-time problem—overview of methods and survey of tools" (Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl et al., 2008), with 1,871 citations. Next come "Reliable and Precise WCET Determination for a Real-Life Processor" (273) and "The influence of processor architecture on the design and the results of WCET tools" (247).

Published TypeFieldAccessCitations

Showing 50 of 58 papers. Every paper with more than 11 citations is listed.

Most cited papers, sortable by citations and release date
#	Paper
1	The worst-case execution-time problem—overview of methods and survey of tools Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl et al. · ACM Transactions on Embedded Computing Systems	Apr 2008	1,871
2	Reliable and Precise WCET Determination for a Real-Life Processor Christian Ferdinand, Reinhold Heckmann, Marc Langenbach et al. · Lecture notes in computer science Conference paper	2001	273
3	The influence of processor architecture on the design and the results of WCET tools Reinhold Heckmann, M. Langebach, Stephan Thesing et al. · Proceedings of the IEEE	Jul 2003	247
4	Fast and Precise WCET Prediction by Separated Cache and Path Analyses Henrik Theiling, Christian Ferdinand, Reinhard Wilhelm · Real-Time Systems	May 2000	244
5	Memory Hierarchies, Pipelines, and Buses for Future Architectures in Time-Critical Embedded Systems Reinhard Wilhelm, Daniel Grund, Jan Reineke et al. · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems Open access	16 Jun 2009	237
6	T-CREST: Time-predictable multi-core architecture for embedded systems Martin Schoeberl et al. · Journal of Systems Architecture Open access	11 Apr 2015	192
7	CacheAudit Goran Doychev, Boris Köpf, Laurent Mauborgne et al. · ACM Transactions on Information and System Security	9 Jun 2015	157
8	Multi-core Interference-Sensitive WCET Analysis Leveraging Runtime Resource Capacity Enforcement Jan Nowotsch, Michael Paulitsch, Daniel Bühler et al. Conference paperOpen access	Jul 2014	138
9	Extracting safe and precise control flow from binaries Henrik Theiling Conference paper	8 Nov 2002	121
10	TACLeBench : a benchmark collection to support worst-case execution time research Heiko Falk, Sebastian Altmeyer, Peter Hellinckx et al. · HAL (Le Centre pour la Communication Scientifique Directe) Conference paperOpen access	2016	118
11	aiT: Worst-Case Execution Time Prediction by Static Program Analysis Christian Ferdinand, Reinhold Heckmann Book chapter	7 Apr 2008	97
12	Quasicontinuous Domains and the Smyth Powerdomain Reinhold Heckmann, Klaus Keimel · Electronic Notes in Theoretical Computer Science Open access	Nov 2013	90
13	An abstract interpretation-based timing validation of hard real-time avionics software Stephan Thesing, Jean Souyris, Reinhold Heckmann et al. Conference paper	22 Jun 2004	88
14	Compile-time decided instruction cache locking using worst-case execution paths Heiko Falk, Sascha Plazar, Henrik Theiling Conference paper	30 Sep 2007	76
15	Pipeline behavior prediction for superscalar processors by abstract interpretation Jörn Schneider, Christian Ferdinand Conference paper	May 1999	70
16	Worst case execution time prediction by static program analysis Christian Ferdinand Conference paper	10 Jun 2004	69
17	Pipeline Modeling for Timing Analysis Marc Langenbach, Stephan Thesing, Reinhold Heckmann · Lecture notes in computer science Conference paper	2002	58
18	CompCert - A Formally Verified Optimizing Compiler Xavier Leroy, Sandrine Blazy, D. Kastner et al. Open access	11 Jan 2016	44
19	ILP-Based Interprocedural Path Analysis Henrik Theiling · Lecture notes in computer science Conference paper	2002	42
20	Generic control flow reconstruction from assembly code Daniel L. Kastner, Stephan Wilhelm Conference paper	19 Jun 2002	37
21	The T-CREST approach of compiler and WCET-analysis integration Peter P. Puschner, Daniel Prokesch, Benedikt Huber et al. Conference paper	Jun 2013	36
22	Design of a WCET-Aware C Compiler Heiko Falk, Paul Lokuciejewski, Henrik Theiling	2006	35
23	Static WCET Analysis of Real-Time Task-Oriented Code in Vehicle Control Systems Daniel Sehlberg, Andreas Ermedahl, Jan Gustafsson et al. Conference paper	Nov 2006	35
24	Cache persistence analysis Christoph Cullmann · ACM Transactions on Embedded Computing Systems	Mar 2013	35
25	Static Analysis and Verification of Aerospace Software by Abstract Interpretation Julien Bertrane, Patrick M. Cousot, Radhia Cousot et al. · Foundations and Trends® in Programming Languages Open access	15 Dec 2015	34
26	Parametric Timing Analysis for Complex Architectures Sebastian Altmeyer, C. Humbert, Björn Lisper et al. Conference paperOpen access	Aug 2008	33
27	Post-pass compaction techniques Bruno De Bus, Daniel L. Kastner, Dominique Chanet et al. · Communications of the ACM	Aug 2003	32
28	Leakage Resilience against Concurrent Cache Attacks Gilles Barthe, Boris Köpf, Laurent Mauborgne et al. · Lecture notes in computer science Conference paper	2014	30
29	Astree: Proving the Absence of Runtime Errors Daniel L. Kastner, Stephan Wilhelm, Stefana Nenova et al. Open access	2010	28
30	Computing with Real Numbers Abbas Edalat, Reinhold Heckmann · Lecture notes in computer science Conference paper	2002	28
31	Online analysis of debug trace data for embedded systems Normann Decker, Boris Dreyer, Philip Gottschling et al. Conference paper	Mar 2018	26
32	CompCert: Practical Experience on Integrating and Qualifying a Formally Verified Optimizing Compiler Daniel L. Kastner, Jörg Barrho, Ulrich Wünsche et al. · HAL (Le Centre pour la Communication Scientifique Directe) Conference paperOpen access	31 Jan 2018	26
33	Run-Time Guarantees for Real-Time Systems—The USES Approach Christian Ferdinand, Daniel L. Kastner, Marc Langenbach et al. · Informatik aktuell Book chapter	1999	25
34	New Developments in WCET Analysis Christian Ferdinand, Florian Pierre Martin, Christoph Cullmann et al. · Lecture notes in computer science Conference paper	4 Jun 2007	24
35	WCET Tool Challenge 2011 : Report Reinhard von Hanxleden et al.	2011	21
36	Taking Static Analysis to the Next Level: Proving the Absence of Run-Time Errors and Data Races with Astrée Antoine Miné, Laurent Mauborgne, Xavier Rival et al. · HAL (Le Centre pour la Communication Scientifique Directe) Conference paperOpen access	27 Jan 2016	20
37	A non-topological view of dcpos as convergence spaces Reinhold Heckmann · Theoretical Computer Science Open access	27 Dec 2002	20
38	Spatiality of countably presentable locales (proved with the Baire category theorem) Reinhold Heckmann · Mathematical Structures in Computer Science	10 Nov 2014	19
39	Proving the Absence of Stack Overflows Daniel L. Kastner, Christian Ferdinand · Lecture notes in computer science Conference paper	2014	17
40	Analyzing the Worst-Case Execution Time by Abstract Interpretation of Executable Code Christian Ferdinand, Reinhold Heckmann, Reinhard Wilhelm · Lecture notes in computer science Conference paper	2006	17
41	Toward Compact Abstractions for Processor Pipelines Sebastian Hahn, Jan Reineke, Reinhard Wilhelm · Lecture notes in computer science Conference paper	2015	16
42	Verifying Safety-Critical Timing and Memory-Usage Properties of Embedded Software by Abstract Interpretation Reinhold Heckmann, Christian Ferdinand · Design, Automation, and Test in Europe Conference paperOpen access	Apr 2005	16
43	Symbolic state traversal for WCET analysis Stephan Wilhelm, Björn Wachter Conference paper	12 Oct 2009	16
44	Branch target buffers: WCET analysis framework and timing predictability Daniel Grund, Jan Reineke, Gernot Gebhard · Journal of Systems Architecture	10 Jun 2010	16
45	Timing Validation of Automotive Software Daniel L. Kastner, Reinhard Wilhelm, Reinhold Heckmann et al. · Communications in computer and information science Conference paper	2008	16
46	Finding All Potential Run-Time Errors and Data Races in Automotive Software Daniel Kaestner, Antoine Miné, André Schmidt et al. · SAE technical papers on CD-ROM/SAE technical paper series Conference paperOpen access	28 Mar 2017	15
47	WCET-driven, code-size critical procedure cloning Paul Lokuciejewski, Heiko Falk, Peter Marwedel et al. Conference paper	13 Mar 2008	15
48	Worst-Case Execution Time - A Tool Provider's Perspective Christian Ferdinand, Reinhold Heckmann Conference paper	May 2008	15
49	TDL: a hardware description language for retargetable postpass optimizations and analyses Daniel L. Kastner	22 Sep 2003	15
50	TimeWeaver: A Tool for Hybrid Worst-Case Execution Time Analysis Daniel L. Kastner, Markus Pister, Simon Wegener et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) Open access	2019	14

Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.