Stefan Wallentowitz

Dr. Stefan Wallentowitz


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 May 2025 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
KMKonrad Moron
Konrad Moron
SWStefan Wallentowitz
Stefan Wallentowitz
WebAssembly is a modern, low-level virtual machine with designed for improved application performance in web browsers. Recently, WebAssembly gained interest for its use outside the web, for example as a replacement for serverless container runtimes. A number of non-web WebAssembly implementations are actively supported, some of which target microcontrollers, IoT devices, and embedded systems. Such hardware platforms have strict resource constraints which may render the usage of WebAssembly impossible or too costly, for example due to its performance overhead and memory requirements. However, it is currently unclear what performance to expect of WebAssembly on low-resource microcontrollers compared to machine code and alternative application virtual machines. To answer this question, we evaluated the processing overhead and memory characteristics of WebAssembly application virtual machines on microcontrollers, and compare it to native execution, and the established application virtual machines: MicroPython and Lua. Furthermore, we analyzed the feature-set and architecture of the WebAssembly implementations in more detail, and measured the performance impact different runtime features have. We found that WebAssembly, despite its high extensibility and versatility in supported source languages, application paradigms, and target hardware, delivers very competitive performance. We conclude that WebAssembly can find wider industry usage for embedded systems and could replace other more costly or less flexible virtualization techniques, such as Java.

29 August 2025 in Electronics
Verified
Journal Article
Open access
PDF file
DODaniel Benjamín Arévalos Ortiz
Daniel Benjamín Arévalos Ortiz
JMJorge Marin
Jorge Marin
KHKrzysztof Herman
Krzysztof Herman
JGJorge Gomez
Jorge Gomez
SWStefan Wallentowitz
Stefan Wallentowitz
Christian A. RojasChristian A. Rojas
Christian A. Rojas
This work proposes a methodology for the automated sizing of transistors in analog integrated circuits, based on a modular and hierarchical representation of the circuit. The methodology combines structured design techniques and systematic design flow to generate a hierarchy of simplified macromodels that define their specifications locally and are interconnected with other macromodels or transistor-level primitive blocks. These primitive blocks can be described using symbolic models or pre-characterized data from look-up tables (LUTs). The symbolic representation of the system is obtained using Modified Nodal Analysis (MNA), and the exploration of each block is performed using local design spaces constrained by top-level specifications. The methodology is validated through the design of low dropout voltage regulators (LDOs) for DC-DC integrated power systems using open-source tools and three process design kits: Sky130A, GF180MCU, and IHP-SG13G2. Results show that the methodology allows the exploration of several topologies and technologies, demonstrating its versatility and modularity, which are key aspects in analog design.

28 January 2025
Verified
Book Chapter
Closed access
PDF file
AHAndreas Hager-Clukas
Andreas Hager-Clukas
JSJonathan Schröter
Jonathan Schröter
SWStefan Wallentowitz
Stefan Wallentowitz


16 September 2025 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
MKMarkus Krahl
Markus Krahl
MGMatthias Güdemann
Matthias Güdemann
SWStefan Wallentowitz
Stefan Wallentowitz
Satisfiability-based verification techniques, leveraging modern Boolean satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers, have demonstrated efficacy in addressing practical problem instances within program analysis. However, current SMT solver implementations often encounter limitations when addressing non-linear arithmetic problems, particularly those involving floating point (FP) operations. This poses a significant challenge for safety critical applications, where accurate and reliable calculations based on FP numbers and elementary mathematical functions are essential. This paper shows how an alternative formulation of the satisfiability problem for FP calculations allows for exploiting parallelism for FP constraint solving. By combining global optimization approaches with parallel execution on modern multi-core CPUs, we construct a portfolio-based semi-decision procedure specifically tailored to handle FP arithmetic. We demonstrate the potential of this approach to complement conventional methods through the evaluation of various benchmarks.