Demo Data from EDBT 2026 / reviewers in the wild / expert
Judith Liebman
dblp:87/2227
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2Computer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 72% Electronic design automation · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › design methodology
correct-by-construction design |
0.0 | 1 | 2003 | Platform-based embedded software design and system integration for autonomous vehicles · Proc. IEEE 2003 |
Embedded and real-time systems
cyber-physical system platforms |
0.0 | 1 | 2003 | Platform-based embedded software design and system integration for autonomous vehicles · Proc. IEEE 2003 |
Embedded and real-time systems › embedded system design
platform-based design |
0.0 | 1 | 2003 | Platform-based embedded software design and system integration for autonomous vehicles · Proc. IEEE 2003 |
Embedded and real-time systems
real-time scheduling |
0.0 | 1 | 2003 | Platform-based embedded software design and system integration for autonomous vehicles · Proc. IEEE 2003 |
Embedded and real-time systems
timing constraints |
0.0 | 1 | 2003 | Platform-based embedded software design and system integration for autonomous vehicles · Proc. IEEE 2003 |
Methods — techniques the papers use, named apart from their topics
platform-based design · 0.0control law design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Platform-based embedded software design and system integration for autonomous vehiclesabstractAutomatic control systems typically incorporate legacy code and components that were originally designed to operate independently. Furthermore, they operate under stringent safety and timing constraints. Current design strategies deal with these requirements and characteristics with ad hoc approaches. In particular, when designing control laws, implementation constraints are often ignored or cursorily estimated. Indeed, costly redesigns are needed after a prototype of the control system is built because of missed timing constraints and subtle transient errors. In this paper, we use the concepts of platform-based design to develop a methodology for the design of automatic control systems that builds in modularity and correct-by-construction procedures. We illustrate our strategy by describing the (successful) application of the methodology to the design of a time-based control system for a helicopter-based uninhabited aerial vehicle. Benjamin Horowitz, Judith Liebman, Cedric Ma, Tak-John Koo, Alberto L. Sangiovanni-Vincentelli, S. Shankar Sastry |
Proc. IEEE | 2 |
| 2002 | Platform-Based Embedded Software Design for Multi-vehicle Multi-modal Systems
Tak-John Koo, Judith Liebman, Cedric Ma, Benjamin Horowitz, Alberto L. Sangiovanni-Vincentelli, S. Shankar Sastry |
EMSOFT | 2 |
| 1981 | An O(n log n) heuristic for steiner minimal tree problems on the euclidean metricabstractAbstract An O ( n log n ) heuristic for the Euclidean Steiner Minimal Tree (ESMT) problem is presented. The algorithm is based on a decomposition approach which first partitions the vertex set into triangles via the Delaunay triangulation, then “recomposes” the suboptimal Steiner Minimal Tree (SMT) according to the Voronoi diagram and Minimum Spanning Tree (MST) of the point set. The ESMT algorithm was implemented in FORTRAN‐IV and tested on a number of randomly generated point sets in the plane drawn from a uniform distribution. Comparison of the O ( n log n ) algorithm with an O ( n 4 ) algorithm clearly indicates that the O ( n log n ) algorithm is as good as the previous O ( n 4 ) algorithm in achieving reductions in the ratio SMT/MST of the given vertex set. This is somewhat surprising since the O ( n 4 ) algorithm considers more potential Steiner points and alternative tree configurations. James MacGregor Smith, D. T. Lee, Judith Liebman |
Networks | 3 |