David N. Jansen

Orcid: 0000-0002-6636-3301

According to our database1, David N. Jansen authored at least 53 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Formally Verifying Arithmetic Chisel Designs for All Bit Widths at Once.
Proceedings of the 61st ACM/IEEE Design Automation Conference, 2024

2023
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS.
Formal Aspects Comput., December, 2023

Linear-Time-Branching-Time Spectroscopy Accounting for Silent Steps.
CoRR, 2023

2022
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy.
Log. Methods Comput. Sci., 2022

CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper).
Proceedings of the Software Engineering and Formal Methods - 20th International Conference, 2022

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence: A Simpler Proof.
Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021
What do all these Buttons do? Statically Mining Android User Interfaces at Scale.
CoRR, 2021

Frontmatter: mining Android user interfaces at scale.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Formal Verification of Consensus in the Taurus Distributed Database.
Proceedings of the Formal Methods - 24th International Symposium, 2021

2020
An O(m log n) algorithm for branching bisimilarity on labelled transition systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Accelerated Verification of Parametric Protocols with Decision Trees.
Proceedings of the 38th IEEE International Conference on Computer Design, 2020

A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems.
CoRR, 2019

An Axiomatisation of the Probabilistic \mu -Calculus.
Proceedings of the Formal Methods and Software Engineering, 2019

2018
An Automatic Proving Approach to Parameterized Verification.
ACM Trans. Comput. Log., 2018

Probabilistic bisimulation for realistic schedulers.
Acta Informatica, 2018

2017
An <i>O</i>(<i>m</i>log<i>n</i>) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation.
ACM Trans. Comput. Log., 2017

On Equivalence Checking of Nondeterministic Finite Automata.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

Distribution-Based Bisimulation for Labelled Markov Processes.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Finding Polynomial Loop Invariants for Probabilistic Programs.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
Multiphase until formulas over Markov reward models: An algebraic approach.
Theor. Comput. Sci., 2016

A space-efficient simulation algorithm on probabilistic automata.
Inf. Comput., 2016

Stuttering equivalence is too slow!
CoRR, 2016

Minimal Separating Sequences for All Pairs of States.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2015

Applying Automata Learning to Embedded Control Software.
Proceedings of the Formal Methods and Software Engineering, 2015

2013
Revisiting Weak Simulation for Substochastic Markov Chains.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

More or Less True DCTL for Continuous-Time MDPs.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

2012
On Abstraction of Probabilistic Systems.
Proceedings of the Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems, 2012

Belief Bisimulation for Hidden Markov Models - Logical Characterisation and Decision Algorithm.
Proceedings of the NASA Formal Methods, 2012

2011
The ins and outs of the probabilistic model checker MRMC.
Perform. Evaluation, 2011

Automata-Based CSL Model Checking
Log. Methods Comput. Sci., 2011

Erratum to: Model-checking continuous-time Markov chains by Aziz et al
CoRR, 2011

2010
Synthesis and stochastic assessment of cost-optimal schedules.
Int. J. Softw. Tools Technol. Transf., 2010

The axiomatization of override and update.
J. Appl. Log., 2010

Fortuna: Model Checking Priced Probabilistic Timed Automata.
Proceedings of the QEST 2010, 2010

2009
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.
Log. Methods Comput. Sci., 2008

2007
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison.
Proceedings of the Hardware and Software: Verification and Testing, 2007

07101 Working Group Report -- Performance Measures Other Than Time.
Proceedings of the Quantitative Aspects of Embedded Systems, 04.03. - 09.03.2007, 2007

2006
Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata.
Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

2005
QoS modelling and analysis with UML-statecharts: the StoCharts approach.
SIGMETRICS Perform. Evaluation Rev., 2005

From StoCharts to MoDeST: a comparative reliability analysis of train radio communications.
Proceedings of the Fifth International Workshop on Software and Performance, 2005

Logic and Model Checking for Hidden Markov Models.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004
Dependability Checking with StoCharts: Is Train Radio Reliable Enough for Trains?
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

An industrial-strength formal method -- A Modest survey.
Proceedings of the International Symposium on Leveraging Applications of Formal Methods, 2004

2003
Extensions of Statecharts with probability, time, and stochastic timing.
PhD thesis, 2003

A QoS-Oriented Extension of UML Statecharts.
Proceedings of the «UML» 2003, 2003

2002
Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts.
Requir. Eng., 2002

Extending CTL with Actions and Real Time.
J. Log. Comput., 2002

A Probabilistic Extension of UML Statecharts.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

2001
Techniques for Reactive System Design: The Tools in TRADE.
Proceedings of the Advanced Information Systems Engineering, 13th International Conference, 2001


  Loading...