C. Metzler

dblp:23/6410 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 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 · 81% Electronic design automation · 19%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
real-time system verification
0.012003
Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs · RTSS 2003
Electronic design automation
hardware synthesis
0.012003
Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs · RTSS 2003
Embedded and real-time systems
synchronous programming
0.012003
Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs · RTSS 2003

Methods — techniques the papers use, named apart from their topics

runtime analysis · 0.0exact low-level analysis · 0.0
YearPublicationVenuePosition
2003 Exact Low-Level Runtime Analysis of Synchronous Programs for Formal Verification of Real-Time Systems
George Logothetis, Klaus Schneider 0001, C. Metzler
FDL3
2003 Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs
abstract
Synchronous programming languages are well-suited for the implementation and verification of real-time systems. The main benefit for the estimation of real-time constraints is thereby that the macro steps provided by synchronous programs can be directly used for runtime analysis. If synchronous circuits are generated from these descriptions, the macro steps are implemented by combinatorial circuits, and if software is generated, they correspond to basic building blocks that do not contain loops. In this paper, we describe methods to generate timed transitions systems from a synchronous program by taking the final architecture into account. For software synthesis, this requires considering different microprocessors and compilers, and for hardware synthesis, this requires considering a hierarchy of clocks to optimize the clock speed.
George Logothetis, Klaus Schneider 0001, C. Metzler
RTSS3