Otto Ehrhardt, Magnus Brunkhorst, Dr. W. Warstat, E. A. Loeb, Kaiser Wilhelm, Emil Gienapp, Prof. O. Schwindrazheim, E. Linck, Dr. E. Wychgram,
... Brief Sehr Geehrter Herr!, W. Niederastroth, Potsdam. Kaiser Wilhelm II, Adolf Ledenig, Graz, Olgraphik Der Daguerreotypeur, Die Poesie Der Alten Deutschen Stadt, Fritz Reinhard, Leipzig. Parkeinfahrt, Motive Und Stimmungen, Das Künstlerische Problem ...
1912 - Gale Group | NCCO Photography
Jürgen Börstler, Ulrich Möncke, Reinhard Wilhelm,
... Germany Univ. des Saarlandes, Saarbru¨cken, GermanyView Profile , Reinhard Wilhelm Univ. des Saarlandes, Saarbru¨cken, Germany Univ. des ...
Tópico(s): Network Packet Processing and Optimization
1991 - Association for Computing Machinery | ACM Transactions on Programming Languages and Systems
Edwin Morgan, G. W. Hopkins, Phillip Whitehead, Derek Mahon, Alan Bullock, Emma Rothschild, Bernard Dunstan, D. A. N. Jones, Edmund Rubbra, Stuart Hood, Sabdy Brown, G. S. Rousseay, Gordon Carr, Misha Donat, Anlthony Smith, Basil Lam, Dogop, Francis Dillon, George Steiner, T. G. 'Tug' Scuffard, John Arden, William Hardcastle, Hugh Casson, Charles Wheeler, Maire Davies, Peter Mills, Paul Podro, J. W. Burrow, Gavin Millar, Adrian Stokes, Ronald Robson, Clive James, Nicholas Tomalin, Michael Chanan,
... 1.75 The Greening of America Charles Reich Reinhard Keiser Last week's broadcast music Records Jazz ...
1971 - Gale Group | The Listener GDA
Tópico(s): Logic, Reasoning, and Knowledge
2022 - Springer Science+Business Media | Formal Aspects of Computing
No abstract available.
Tópico(s): Computability, Logic, AI Algorithms
2021 - Springer Science+Business Media | Formal Aspects of Computing
Mingsong Lv, Nan Guan, Jan Reineke, Reinhard Wilhelm, Wang Yi,
Real-time systems are reactive computer systems that must produce their reaction to a stimulus within given time bounds. A vital verification requirement is to estimate the Worst-Case Execution Time (WCET) of programs. These estimates are then used to predict the timing behavior of the overall system. The execution time of a program heavily depends on the underlying hardware, among which cache has the biggest influence. Analyzing cache behavior is very challenging due to the versatile cache features ...
Tópico(s): Embedded Systems Design Techniques
2016 - Schloss Dagstuhl — Leibniz-Zentrum fuer Informatik | Leibniz transactions on embedded systems
Sebastian Hahn, Jan Reineke, Reinhard Wilhelm,
Hard real-time systems require programs to react on time. Static timing analysis derives timing guarantees by analyzing the behavior of programs running on the underlying execution platform. Efficient abstractions have been found for the analysis of caches. Unfortunately, this is not the case for the analysis of processor pipelines. Pipeline analysis typically uses an expensive powerset domain of concrete pipeline states. Therefore, pipeline analysis is the most complex part of timing analysis. ...
Tópico(s): Formal Methods in Verification
2015 - Springer Science+Business Media | Lecture notes in computer science
Sebastian Hahn, Jan Reineke, Reinhard Wilhelm,
For hard real-time systems, timeliness of operations has to be guaranteed. Static timing analysis is therefore employed to compute upper bounds on the execution times of a program. Analysis results at high precision are required to avoid over-provisioning of resources. For current processors, timing analysis is a complex task mainly due to interdependencies of the processors' features that affect the overall timing behaviour. To still obtain tight bounds, state-of-the-art approaches collect detailed ...
Tópico(s): Embedded Systems Design Techniques
2015 - Association for Computing Machinery | ACM SIGBED Review
Philip Axer, Rolf Ernst, Heiko Falk, Alain Girault, Daniel Grund, Nan Guan, Bengt Jönsson, Peter Marwedel, Jan Reineke, Christine Rochange, Maurice Sebastian, Reinhard von Hanxleden, Reinhard Wilhelm, Wang Yi,
A large class of embedded systems is distinguished from general-purpose computing systems by the need to satisfy strict requirements on timing, often under constraints on available resources. Predictable system design is concerned with the challenge of building systems for which timing requirements can be guaranteed a priori . Perhaps paradoxically, this problem has become more difficult by the introduction of performance-enhancing architectural elements, such as caches, pipelines, and multithreading, ...
Tópico(s): Parallel Computing and Optimization Techniques
2014 - Association for Computing Machinery | ACM Transactions on Embedded Computing Systems
Reinhard Wilhelm, Daniel Grund,
Timing analysis for hard real-time systems.
Tópico(s): Distributed systems and fault tolerance
2014 - Association for Computing Machinery | Communications of the ACM
Reinhard Wilhelm, Helmut Seidl, Sebastian Hack,
While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages. Additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available. The book ...
Tópico(s): Embedded Systems Design Techniques
2013 - Association of College and Research Libraries | Choice Reviews Online
Andreas Abel, Florian Benz, Johannes Doerfert, Barbara Dörr, Sebastian Hahn, Florian Haupenthal, Michael E. Jacobs, Armin Moin, Jan Reineke, Bernhard Schommer, Reinhard Wilhelm,
Multi-core processors are increasingly considered as execution platforms for embedded systems because of their good performance/ energy ratio. However, the interference on shared resources poses several problems. It may severely reduce the performance of tasks executed on the cores, and it increases the complexity of timing analysis and/or decreases the precision of its results. In this paper, we survey recent work on the impact of shared buses, caches, and other resources on performance and performance ...
Tópico(s): Interconnection Networks and Systems
2013 - Springer Science+Business Media | Lecture notes in computer science
Reinhard Wilhelm, Sebastian Altmeyer, Claire Burguière, Daniel Grund, Jörg Herter, Jan Reineke, Björn Wachter, Stephan Wilhelm,
Hard real-time systems have to satisfy strict timing constraints. To prove that these constraints are met, timing analyses aim to derive safe upper bounds on tasks' execution times. Processor components such as caches, out-of-order pipelines, and speculation cause a large variation of the execution time of instructions, which may induce a large variability of a task's execution time. The architectural platform also determines the precision and the complexity of timing analysis. This paper provides ...
Tópico(s): Formal Methods in Verification
2010 - Springer Science+Business Media | Lecture notes in computer science
Reinhard Wilhelm, Daniel Grund, Jan Reineke, Marc Schlickling, Markus Pister, Christian Ferdinand,
Embedded hard real-time systems need reliable guarantees for the satisfaction of their timing constraints. Experience with the use of static timing-analysis methods and the tools based on them in the automotive and the aeronautics industries is positive. However, both the precision of the results and the efficiency of the analysis methods are highly dependent on the predictability of the execution platform. In fact, the architecture determines whether a static timing analysis is practically feasible ...
Tópico(s): Parallel Computing and Optimization Techniques
2009 - Institute of Electrical and Electronics Engineers | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Thomas Martin Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm,
Tópico(s): Formal Methods in Verification
2009 - Springer Science+Business Media | Lecture notes in computer science
Daniel L. Kastner, Reinhard Wilhelm, Reinhold Heckmann, Marc Schlickling, Markus Pister, Marek Jersak, Kai Richter, Christian Ferdinand,
Embedded hard real-time systems need reliable guarantees for the satisfaction of their timing constraints. During the last years sophisticated analysis tools for timing analysis at the code-level, controller-level and networked system-level have been developed. This trend is exemplified by two tools: AbsInt’s timing analyzer aiT, and and Symtavision’s SymTA/S. aiT determines safe upper bounds for the execution times (WCETs) of non-interrupted tasks. SymTA/S computes the worst-case response times ( ...
Tópico(s): Formal Methods in Verification
2008 - Springer Science+Business Media | Communications in computer and information science
Reinhard Wilhelm, Björn Wachter,
Abstract interpretation is one of the main verification technologies besides model checking and deductive verification.Abstract interpretation has a rich theory of abstraction and strong support for the construction of abstract domains. It allows to express a precise relation to the (concrete) semantics of the programming language inducing a clear relation between the results of an abstract interpretation and the properties of the analyzed program. It permits trading efficiency against precision ...
Tópico(s): Embedded Systems Design Techniques
2008 - Springer Science+Business Media | Lecture notes in computer science
Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter Puschner, Jan Staschulat, Per Stenström,
The determination of upper bounds on execution times, commonly called worst-case execution times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components, such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools 1 and research prototypes.
Tópico(s): Embedded Systems Design Techniques
2008 - Association for Computing Machinery | ACM Transactions on Embedded Computing Systems
Greta Yorsh, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm,
Shape analysis concerns the problem of determining “shape invariants” for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed using an abstract interpretation based on three-valued first-order logic. In that work, concrete stores are finite two-valued logical structures, and the sets of stores that can possibly arise during execution are represented (conservatively) using a certain family of finite three-valued ...
Tópico(s): Security and Verification in Computing
2007 - Association for Computing Machinery | ACM Transactions on Computational Logic
Prominent examples of dynamic communication systems include traffic control systems and ad hoc networks. They are hard to verify due to inherent unboundedness. Unbounded creation and destruction of objects and a dynamically evolving communication topology are characteristic features.
Tópico(s): Embedded Systems Design Techniques
2007 - Springer Science+Business Media | Lecture notes in computer science
Reinhard Wilhelm's career in Computer Science spans more than a third of a century. During this time, ...
2007 - Springer Science+Business Media | Lecture notes in computer science
Jan Reineke, Daniel Grund, Christoph Berg, Reinhard Wilhelm,
Tópico(s): Optimization and Search Problems
2007 - Springer Science+Business Media | Real-Time Systems
Eran Yahav, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm,
Journal Article Verifying Temporal Heap Properties Specified via Evolution Logic Get access E. Yahav, E. Yahav School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel. E-mail: yahave@post.tau.ac.il Search for other works by this author on: Oxford Academic Google Scholar T. Reps, T. Reps Computer Sciences Department, University of Wisconsin, Madison, WI 53706, USA. E-mail: reps@cs.wisc.edu Search for other works by this author on: Oxford Academic Google Scholar M. Sagiv, M. Sagiv ...
Tópico(s): Model-Driven Software Engineering Techniques
2006 - Oxford University Press | Logic Journal of IGPL
Christian Ferdinand, Reinhold Heckmann, Reinhard Wilhelm,
Determining the worst-case execution times (WCETs) of tasks in safety-critical hard real-time systems is a difficult problem. A combination of automatic analysis techniques with a few user annotations yields precise WCET estimates.
Tópico(s): Software Reliability and Analysis Research
2006 - Springer Science+Business Media | Lecture notes in computer science
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. This paper explains the principles of our Timing-Analysis methods, which use Abstract Interpretation to predict the system's behavior on the underlying processor's components and use Integer Linear Programming to determine a worst-case path through the program. Under the assumption that non-trivial systems are subject of the analyses, exhaustive analyses can not be ...
Tópico(s): Real-Time Systems Scheduling
2005 - Springer Science+Business Media | Lecture notes in computer science
Interpretation [CC77] is used to compute invariants about cache contents. How the behavior of programs on processor pipelines is predicted follows in Section 0.3. 0.2.1 Cache Memories A cache can be characterized by three major parameters: • capacity is the number of bytes it may contain. • line size (also called block size) is the number of contiguous bytes that are transferred from memory on a cache miss. The cache can hold at most n = capacity/line size blocks. • associativity is the number of cache locations ...
Tópico(s): Formal Methods in Verification
2005 - CRC Press | Industrial information technology series
Thomas Reps, Mooly Sagiv, Reinhard Wilhelm,
This paper reviews the principles behind the paradigm of "abstract interpretation via 3-valued logic," discusses recent work to extend the approach, and summarizes on-going research aimed at overcoming remaining limitations on the ability to create program-analysis algorithms fully automatically.
Tópico(s): Software Testing and Debugging Techniques
2004 - Springer Science+Business Media | Lecture notes in computer science
A combination of Abstract Interpretation (AI) with Integer Linear Programming (ILP) has been successfully used to determine precise upper bounds on the execution times of real-time programs, commonly called worst-case execution times (WCET). The task solved by abstract interpretation is to verify as many local safety properties as possible, safety properties who correspond to the absence of “timing accidents”. Timing accidents, e.g. cache misses, are reasons for the increase of the execution time of ...
Tópico(s): Embedded Systems Design Techniques
2004 - Springer Science+Business Media | Lecture notes in computer science
Lothar Thiele, Reinhard Wilhelm,
Tópico(s): Formal Methods in Verification
2004 - Springer Science+Business Media | Real-Time Systems
Reinhold Heckmann, M. Langebach, Stephan Thesing, Reinhard Wilhelm,
The architecture of tools for the determination of worst case execution times (WCETs) as well as the precision of the results of WCET analyses strongly depend on the architecture of the employed processor. The cache replacement strategy influences the results of cache behavior prediction; out-of-order execution and control speculation introduce interferences between processor components, e.g., caches, pipelines, and branch prediction units. These interferences forbid modular designs of WCET tools, ...
Tópico(s): Embedded Systems Design Techniques
2003 - Institute of Electrical and Electronics Engineers | Proceedings of the IEEE