David N. Jansen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
David N. Jansen has a total of 84 co-authors. Here are the top co-authors by number of shared publications:
Lijun Zhang
University of Chinese Academy of Sciences
11 shared publicationsHolger Hermanns
8 shared publications- Joost-Pieter Katoen
RWTH Aachen University
5 shared publications - Anton Wijs
Eindhoven University of Technology
3 shared publications - Flemming Nielson
Technical University of Denmark
3 shared publications Jasper Berendsen
3 shared publications
Latest Publications
- Open Access
- 4 August 2026
- Published by Elsevier in Information and Computation
- Vol. 313
Deciding all behavioral equivalences at once II: The silent-step spectrum
- 4 August 2026
- Published by Elsevier in Information and Computation
- Vol. 313
Open AccessDeciding all behavioral equivalences at once II: The silent-step spectrum
- 10 April 2026
- Published by Springer Nature
- p. 331-361
A Formally Verified Procedure for Width Inference in FIRRTL
- 10 April 2026
- Published by Springer Nature
- p. 331-361
A Formally Verified Procedure for Width Inference in FIRRTL
- Open Access
A Formally Verified Procedure for Width Inference in FIRRTL
FIRRTL is an intermediate representation language for Register Transfer Level (RTL) hardware designs. In FIRRTL programs, the bit widths of many components are not specified explicitly and must be inferred during compilation. In mainstream FIRRTL compilers, such as the official compiler firtool, width inference is conducted by a compilation pass referred to as InferWidths, which may fail even for simple FIRRTL programs. In this paper, we thoroughly investigate the width inference problem for FIRRTL programs. We show that, if the constraints obtained from a FIRRTL program are satisfiable, there exists a unique least solution. Based on this result, we propose a complete procedure for solving the width inference problem. We implement it in the interactive theorem prover Rocq and prove its functional correctness. From the Rocq implementation, we extract an OCaml implementation, which is the first formally verified implementation of the InferWidths pass. Extensive experiments demonstrate that our approach can solve more instances than the official InferWidths pass in firtool, normally with high efficiency.
Open AccessA Formally Verified Procedure for Width Inference in FIRRTL
FIRRTL is an intermediate representation language for Register Transfer Level (RTL) hardware designs. In FIRRTL programs, the bit widths of many components are not specified explicitly and must be inferred during compilation. In mainstream FIRRTL compilers, such as the official compiler firtool, width inference is conducted by a compilation pass referred to as InferWidths, which may fail even for simple FIRRTL programs. In this paper, we thoroughly investigate the width inference problem for FIRRTL programs. We show that, if the constraints obtained from a FIRRTL program are satisfiable, there exists a unique least solution. Based on this result, we propose a complete procedure for solving the width inference problem. We implement it in the interactive theorem prover Rocq and prove its functional correctness. From the Rocq implementation, we extract an OCaml implementation, which is the first formally verified implementation of the InferWidths pass. Extensive experiments demonstrate that our approach can solve more instances than the official InferWidths pass in firtool, normally with high efficiency.
- 13 November 2024
- Published by Springer Nature
- p. 234-266
A Scenario Approach for Parametric Markov Decision Processes
- 13 November 2024
- Published by Springer Nature
- p. 234-266
A Scenario Approach for Parametric Markov Decision Processes
- Open Access
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Formally Verifying Arithmetic Chisel Designs for All Bit Widths at Once
Chisel is an open-source hardware description language embedded in Scala to facilitate parameterized and reusable digital circuit design. Chisel is becoming increasingly popular and has been used to design RISC-V CPUs, e.g. RocketChip and XiangShan. While Chisel features high-level hardware designs, its verification is still low-level: Low-level (e.g. Verilog) programs are first generated from Chisel programs, then the verification tools are applied to these low-level programs. In this work, we focus on formal verification of arithmetic units. Efficient low-level formal verification of arithmetic units has always been a challenge and remains an active research area, attributed to the state explosion problem brought on by bit widths. To circumvent this problem for arithmetic Chisel designs, we propose an approach to their high-level formal verification so that their correctness is verified for all bit widths at once, instead of for each bit width separately. The key idea is to transform arithmetic Chisel designs into Scala software programs that simulate their behaviors, where the high-level features are preserved, then resort to Stainless, a deductive formal verification tool for Scala. We validate the effectiveness of this approach by formally verifying the correctness of dividers and multipliers in two representative open source RISC-V processors, namely, RocketChip and XiangShan. Compared to the existing proof-assistant-based parameterized verification approaches for arithmetic designs (e.g. Kami), the verification cost in our approach is much lower on average.
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessFormally Verifying Arithmetic Chisel Designs for All Bit Widths at Once
Chisel is an open-source hardware description language embedded in Scala to facilitate parameterized and reusable digital circuit design. Chisel is becoming increasingly popular and has been used to design RISC-V CPUs, e.g. RocketChip and XiangShan. While Chisel features high-level hardware designs, its verification is still low-level: Low-level (e.g. Verilog) programs are first generated from Chisel programs, then the verification tools are applied to these low-level programs. In this work, we focus on formal verification of arithmetic units. Efficient low-level formal verification of arithmetic units has always been a challenge and remains an active research area, attributed to the state explosion problem brought on by bit widths. To circumvent this problem for arithmetic Chisel designs, we propose an approach to their high-level formal verification so that their correctness is verified for all bit widths at once, instead of for each bit width separately. The key idea is to transform arithmetic Chisel designs into Scala software programs that simulate their behaviors, where the high-level features are preserved, then resort to Stainless, a deductive formal verification tool for Scala. We validate the effectiveness of this approach by formally verifying the correctness of dividers and multipliers in two representative open source RISC-V processors, namely, RocketChip and XiangShan. Compared to the existing proof-assistant-based parameterized verification approaches for arithmetic designs (e.g. Kami), the verification cost in our approach is much lower on average.
- Open Access
- 22 December 2023
- Published by Linkoping University Electronic Press in Swedish Aerospace Conference, FT2025
- p. 577-588
Integration of Heat Flow through Borders between Adjacent Zones in AixLib's Reduced-Order Model
For dynamically simulating the thermal behavior of a building, the reduced-order model (ROM) implemented in the Modelica IBPSA and AixLib libraries provides a time-efficient calculation method based on the standard VDI 6007-1. Additionally, the Python package TEASER features a possilibity to fill the model parameters with automatically generated typical and/or enriched building data. So far, both have not been capable of modelling heat flow through borders between thermal zones. In this contribution, we present the integration of this feature into the open-source software combination. Additional new features include non-constant soil temperatures and a new approach to estimate interior building elements in cases without proper knowledge. Calculation results are presented for an exemplary application and show satisfactory agreement with measured values. The respective code (including the example presented here) is in the process of being published as part of the AixLib and TEASER open-source repositiories.
- 22 December 2023
- Published by Linkoping University Electronic Press in Swedish Aerospace Conference, FT2025
- p. 577-588
Open AccessIntegration of Heat Flow through Borders between Adjacent Zones in AixLib's Reduced-Order Model
For dynamically simulating the thermal behavior of a building, the reduced-order model (ROM) implemented in the Modelica IBPSA and AixLib libraries provides a time-efficient calculation method based on the standard VDI 6007-1. Additionally, the Python package TEASER features a possilibity to fill the model parameters with automatically generated typical and/or enriched building data. So far, both have not been capable of modelling heat flow through borders between thermal zones. In this contribution, we present the integration of this feature into the open-source software combination. Additional new features include non-constant soil temperatures and a new approach to estimate interior building elements in cases without proper knowledge. Calculation results are presented for an exemplary application and show satisfactory agreement with measured values. The respective code (including the example presented here) is in the process of being published as part of the AixLib and TEASER open-source repositiories.
- Open Access
- 22 December 2023
- Published by Linkoping University Electronic Press in Swedish Aerospace Conference, FT2025
- Vol. 204, 521-530
MoCITempGen: Modelica Continuous Integration Template Generator
Modelica enables an object-oriented approach to model complex systems in product development and research, and, thus, the development of various model libraries. Library development requires collaborative development in a team of multiple developers. A typical challenge in collaborative development, especially in the area of open source, is to create models of uniform quality despite different levels of knowledge among developers. Techniques such as Continuous Integration (CI) from the field of software development, can help to solve these challenges. However, the adaptation of CI for the area of Modelica model development currently requires the manual creation of complex templates and a high degree of manual configuration. In this paper we present MoCITempGen, an open source tool for automated generation of CI structures for the widely used modeling language Modelica. The tool is succesfully applied on two Modelica libraries to demonstrate the functionality.
- 22 December 2023
- Published by Linkoping University Electronic Press in Swedish Aerospace Conference, FT2025
- Vol. 204, 521-530
Open AccessMoCITempGen: Modelica Continuous Integration Template Generator
Modelica enables an object-oriented approach to model complex systems in product development and research, and, thus, the development of various model libraries. Library development requires collaborative development in a team of multiple developers. A typical challenge in collaborative development, especially in the area of open source, is to create models of uniform quality despite different levels of knowledge among developers. Techniques such as Continuous Integration (CI) from the field of software development, can help to solve these challenges. However, the adaptation of CI for the area of Modelica model development currently requires the manual creation of complex templates and a high degree of manual configuration. In this paper we present MoCITempGen, an open source tool for automated generation of CI structures for the widely used modeling language Modelica. The tool is succesfully applied on two Modelica libraries to demonstrate the functionality.
- Open Access
- 20 November 2023
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 35 (4) , 1-21
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS
Branching bisimilarity is a well-known equivalence relation for labelled transition systems. Based on this equivalence relation, with an additional simple rootedness condition, a congruence relation for calculus of communication system (CCS) processes can be obtained. However, neither branching bisimilarity nor the corresponding congruence relation preserves divergence, and it is still a question whether, based on a divergence-preserving variant of branching bisimilarity, a divergence-preserving congruence relation for CCS processes can be obtained by introducing the same simple rootedness condition. In this article, we present a partial solution by showing that rooted divergence-preserving branching bisimilarity is preserved under the usual CCS operators, including prefixing, summation, parallel composition, relabelling, restriction, and (weakly) guarded recursion.
- 20 November 2023
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 35 (4) , 1-21
Open AccessRooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS
Branching bisimilarity is a well-known equivalence relation for labelled transition systems. Based on this equivalence relation, with an additional simple rootedness condition, a congruence relation for calculus of communication system (CCS) processes can be obtained. However, neither branching bisimilarity nor the corresponding congruence relation preserves divergence, and it is still a question whether, based on a divergence-preserving variant of branching bisimilarity, a divergence-preserving congruence relation for CCS processes can be obtained by introducing the same simple rootedness condition. In this article, we present a partial solution by showing that rooted divergence-preserving branching bisimilarity is preserved under the usual CCS operators, including prefixing, summation, parallel composition, relabelling, restriction, and (weakly) guarded recursion.
- 1 October 2022
- Published by Springer Nature
- p. 324-331
CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper)
- 1 October 2022
- Published by Springer Nature
- p. 324-331
CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper)