David N. Jansen
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
21
Venues
16
Active years
2001–2026
Best venue rank
A*
Where they publish
Papers
21 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESOP | A Formally Verified Procedure for Width Inference in FIRRTL. | Keyin Wang, Xiaomu Shi, Jiaxiang Liu, Zhilin Wu, Fu Song, Taolue Chen, David N. Jansen |
| 2025 | CONCUR | A State-Based O(m log n) Partitioning Algorithm for Branching Bisimilarity. | Jan Friso Groote, David N. Jansen |
| 2024 | DAC | Formally Verifying Arithmetic Chisel Designs for All Bit Widths at Once. | Weizhi Feng, Yicheng Liu, Jiaxiang Liu, David N. Jansen, Lijun Zhang, Zhilin Wu |
| 2022 | SEFM | CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper). | Shizhen Yu, Yifan Dong, Jiuyang Liu, Yong Li, Zhilin Wu, David N. Jansen, Lijun Zhang |
| 2021 | FM | Formal Verification of Consensus in the Taurus Distributed Database. | Song Gao, Bohua Zhan, Depeng Liu, Xuechao Sun, Yanan Zhi, David N. Jansen, Lijun Zhang |
| 2020 | CONCUR | A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. | David N. Jansen, Jan Friso Groote, Ferry Timmers, Pengfei Yang |
| 2020 | ICCD | Accelerated Verification of Parametric Protocols with Decision Trees. | Yongjian Li, Taifeng Cao, David N. Jansen, Jun Pang, Xiaotao Wei |
| 2020 | TACAS | An O(m log n) algorithm for branching bisimilarity on labelled transition systems. | David N. Jansen, Jan Friso Groote, Jeroen J. A. Keiren, Anton Wijs |
| 2019 | ICFEM | An Axiomatisation of the Probabilistic \mu -Calculus. | Junnan Xu, Wanwei Liu, David N. Jansen, Lijun Zhang |
| 2017 | ATVA | Finding Polynomial Loop Invariants for Probabilistic Programs. | Yijun Feng, Lijun Zhang, David N. Jansen, Naijun Zhan, Bican Xia |
| 2017 | SETTA | On Equivalence Checking of Nondeterministic Finite Automata. | Chen Fu, Yuxin Deng, David N. Jansen, Lijun Zhang |
| 2016 | LATA | Minimal Separating Sequences for All Pairs of States. | Rick Smetsers, Joshua Moerman, David N. Jansen |
| 2015 | ICFEM | Applying Automata Learning to Embedded Control Software. | Wouter Smeenk, Joshua Moerman, Frits W. Vaandrager, David N. Jansen |
| 2015 | SETTA | A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking. | Tom van Dijk, Ernst Moritz Hahn, David N. Jansen, Yong Li, Thomas Neele, Marille Stoelinga, Andrea Turrini, Lijun Zhang |
| 2011 | ICALP | Automata-Based CSL Model Checking. | Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns |
| 2009 | TAMC | Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata. | Jasper Berendsen, Taolue Chen, David N. Jansen |
| 2007 | TACAS | Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking. | Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, David N. Jansen |
| 2007 | TACAS | Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. | Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen |
| 2005 | FORTE | Logic and Model Checking for Hidden Markov Models. | Lijun Zhang, Holger Hermanns, David N. Jansen |
| 2004 | ISoLA | An industrial-strength formal method -- A Modest survey. | Henrik C. Bohnenkamp, Holger Hermanns, David N. Jansen, Joost-Pieter Katoen, Yaroslav S. Usenko |
| 2001 | CaiSE | Techniques for Reactive System Design: The Tools in TRADE. | Roel J. Wieringa, David N. Jansen |