Joost-Pieter Katoen
Four Papers at CAV 2018
Four papers with involvement of the MOVES group have been accepted at CAV 2018: “Sound Value Iteration” by Tim Quatmann and Joost-Pieter Katoen “Let this Graph be your Witness! An Attestor for Verifying Java Pointer Programs” by Hannah Arndt, Christina Jansen, Joost-Pieter Katoen, Christoph Matheja and Thomas Noll “Monitoring CTMCs By Multi-Clock Timed Automata” by […]
Paper accepted at DSN 2018
The paper “Branching Bisimulation and Concurrent Object Verification” by Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Gaoang Liu, and Hao Wu has been accepted for the 48th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2018) in Luxemburg. The paper, a result of the cooperation within the CDZ project CAP with the Institute of Software, […]
Paper accepted at Petri Nets 2018
The paper “One Nets Fits All — A unifying semantics of Dynamic Fault Trees using GSPNs” by Sebastian Junges, Joost-Pieter Katoen, Marielle Stoelinga and Matthias Volk has been accepted for Petri Nets 2018. The paper presents a simple, compositional GSPN semantics for DFTs that unifies all existing DFT semantics from the literature.
Paper accepted at TACAS 2018
The paper “Multi-Cost Bounded Reachability in MDPs” by Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen and Tim Quatmann has been accepted for TACAS 2018. The paper presents an efficient algorithm for multi-objective model checking problems on Markov decision processes (MDPs) with multiple cost structures.
Paper accepted at ESOP 2018
The paper “How long, O Bayesian network, will I sample thee?” by Kevin Batz, Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja has been accepted at the European Symposium on Programming (ESOP 18). The paper shows how to use deductive program verification to deduce the expected time to obtain a single i.i.d-sample from a Bayesian network […]
Kickoff Meeting RTG UnRAVeL
On November 10 the official kick-off meeting of the Research Training Group UnRAVeL (Uncertainty and Randomness in Algorithms, Verification and Logic) will take place in room 9222, E3 Building. The program includes invited talks by the renowned researchers Prof. Marta Kwiatkowska (University of Oxford) and Prof. Rolf Möhring (TU Berlin), two-minutes talks by the UnRAVeL […]
Young Researcher Award for Sebastian Junges
Sebastian Junges today received the Young Research Award, a prize for excellent young researchers (students and Ph.D. students) in the ICT field, awarded by the ICT Profile Area of RWTH Aachen University. The prize comes with a financial support for Sebastian’s career.
Christina Jansen defended her PhD dissertation
Thursday October 19, Christina Jansen successfully defended her PhD dissertation, entitled “Static Analysis of Pointer Programs: Linking Graph Grammars and Separation Logic” for a jury consisting of Marieke Huisman (University of Twente, NL), Gerhard Woeginger, Horst Lichter, Thomas Noll, and Joost-Pieter Katoen (all Aachen). Christina’s dissertation is concerned with establishing a connection between data structure […]
Paper accepted at POPL 2018
The paper entitled “A new proof rule for almost-sure termination” by Annabelle McIver, Carroll Morgan, Benjamin Kaminski, and Joost-Pieter Katoen has been accepted for POPL 2018. The paper presents a proof rule to verify whether a probabilistic program (possibly including non-determinacy) almost surely terminates. The new proof rule enables to capture a larger class of […]
Paper accepted in ACM TOPLAS
The paper “Conditioning in Probabilistic Programming” by Federico Olmedo, Friedrich Gretz, Nils Jansen, Benjamin L. Kaminski, Joost-Pieter Katoen and Annabelle McIver has been accepted for the journal ACM Transactions on Programming Languages and Systems. The paper treats the semantic intricacies of introducing conditioning in a probabilistic programming language, its interference with non-determinacy, and divergence.