ABOUT NEWS PEOPLE RESEARCH TEACHING JOBS
Research
Formal Methods in Security and Privacy

Using formal methods we are able to provide strong mathematical guarantees for security and privacy. This can be achieved through manual proofs, or automated techniques such as model checking or type systems. Formal methods can be applied to all areas of security and privacy research.

PEOPLE
Krishnendu Chatterjee
Krishnendu Chatterjee
Professor (IST Austria) ↗
Monika Henzinger
Monika Henzinger
Professor (Uni Wien) ↗
Thomas Henzinger
Thomas Henzinger
Professor (IST Austria) ↗
Laura Kovács
Laura Kovács
Professor (TU Wien) ↗
Matteo Maffei
Matteo Maffei
Professor (TU Wien) ↗
PUBLICATIONS

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai (SIAM J. Comput.)
Algebra-Based Synthesis of Loops and Their Invariants (Invited Paper). Andreas Humenberger, Laura Kovács (VMCAI)
Algebra-based Synthesis of Loops and their Invariants (Invited Paper). Andreas Humenberger, Laura Kovács (eprint)
Algorithms and conditional lower bounds for planning problems. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil (Artif. Intell.)
Automated Generation of Exam Sheets for Automated Deduction. Petra Hozzová, Laura Kovács, Jakob Rath (CICM)
Automated Termination Analysis of Polynomial Probabilistic Programs. Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács (ESOP)
Automating Induction by Reflection. Johannes Schoisswohl, Laura Kovács (eprint)
Automating Induction by Reflection. Johannes Schoisswohl, Laura Kovács (eprint)
Bidding mechanisms in graph games. Guy Avni, Thomas A. Henzinger, Dorde Zikelic (J. Comput. Syst. Sci.)
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory. Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid (eprint)
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson (eprint)
Determinacy in Discrete-Bidding Infinite-Duration Games. Milad Aghajohari, Guy Avni, Thomas A. Henzinger (Log. Methods Comput. Sci.)
Differentially Private Algorithms for Graphs Under Continual Observation. Hendrik Fichtenberger, Monika Henzinger, Wolfgang Ost (ESA)
Differentially Private Algorithms for Graphs Under Continual Observation. Hendrik Fichtenberger, Monika Henzinger, Wolfgang Ost (eprint)
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. Sebastian Forster, Gramoz Goranci, Monika Henzinger (SODA)
Dynamic Set Cover - Improved Amortized and Worst-Case Update Time. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu (SODA)
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil (ICALP)
Flavours of Sequential Information Flow. Ezio Bartocci, Thomas Ferrère, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa (eprint)
Formalizing Graph Trail Properties in Isabelle/HOL. Laura Kovács, Hanna Lachnitt, Stefan Szeider (eprint)
Fully Dynamic Four-Vertex Subgraph Counting. Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua (eprint)
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil (ALENEX)
GoTube - Scalable Stochastic Verification of Continuous-Depth Models. Sophie Gruenbacher, Mathias Lechner, Ramin M. Hasani, Daniela Rus, Thomas A. Henzinger, Scott A. Smolka, Radu Grosu (eprint)
Inductive Benchmarks for Automated Reasoning. Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov (CICM)
Integer Induction in Saturation. Petra Hozzová, Laura Kovács, Andrei Voronkov (CADE)
MORA - Automatic Generation of Moment-Based Invariants. Ezio Bartocci, Laura Kovács, Miroslav Stankovic (eprint)
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein (SODA)
On Lexicographic Proof Rules for Probabilistic Termination. Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic (eprint)
On Satisficing in Quantitative Games. Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi (TACAS)
On Satisficing in Quantitative Games. Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi (eprint)
Optimal strategies for selecting coordinators. Martin Zeiner, Ulrich Schmid, Krishnendu Chatterjee (Discret. Appl. Math.)
Polynomial reachability witnesses via Stellensätze. Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi (PLDI)
Practical Fully Dynamic Minimum Cut Algorithms. Monika Henzinger, Alexander Noe, Christian Schulz (eprint)
Practical and Provably Sound Static Analysis of Ethereum Smart Contracts. Matteo Maffei (ICISSP)
Proving Non-termination by Program Reversal. Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic (eprint)
Proving non-termination by program reversal. Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic (PLDI)
Quantitative analysis of assertion violations in probabilistic programs. Jinyi Wang, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady (PLDI)
Quantitative and Approximate Monitoring. Thomas A. Henzinger, N. Ege Saraç (LICS)
Quantitative and Approximate Monitoring. Thomas A. Henzinger, N. Ege Saraç (eprint)
Random Rank-Based, Hierarchical or Trivial - Which Dynamic Graph Algorithm Performs Best in Practice? Monika Henzinger, Alexander Noe (eprint)
Recent Advances in Fully Dynamic Graph Algorithms. Kathrin Hanauer, Monika Henzinger, Christian Schulz (eprint)
Scalable Verification of Quantized Neural Networks. Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic (AAAI)
Solving Partially Observable Stochastic Shortest-Path Games. Petr Tomásek, Karel Horák, Aditya Aradhye, Branislav Bosanský, Krishnendu Chatterjee (IJCAI)
Stateless Model Checking Under a Reads-Value-From Equivalence. Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman (CAV)
Stateless Model Checking under a Reads-Value-From Equivalence. Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman (eprint)
Stochastic Processes with Expected Stopping Time. Krishnendu Chatterjee, Laurent Doyen (LICS)
Stochastic Processes with Expected Stopping Time. Krishnendu Chatterjee, Laurent Doyen (eprint)
Summing Up Smart Transitions. Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv (eprint)
Summing up Smart Transitions. Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv (CAV)
Symbolic Time and Space Tradeoffs for Probabilistic Verification. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil (LICS)
Symbolic Time and Space Tradeoffs for Probabilistic Verification. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil (eprint)
Synthesis of Hybrid Automata with Affine Dynamics from Time-Series Data. Miriam García Soto, Thomas A. Henzinger, Christian Schilling (eprint)
Synthesis of hybrid automata with affine dynamics from time-series data. Miriam García Soto, Thomas A. Henzinger, Christian Schilling (HSCC)
The Probabilistic Termination Tool Amber. Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács (eprint)
Towards a Game-Theoretic Security Analysis of Off-Chain Protocols. Sophie Rain, Zeta Avarikioti, Laura Kovács, Matteo Maffei (eprint)
Transforming OPC UA Information Models into Domain-Specific Ontologies. Gernot Steindl, Wolfgang Kastner (ICPS)
Upper and Lower Bounds for Fully Retroactive Graph Problems. Monika Henzinger, Xiaowei Wu (WADS)
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. Monika Henzinger, Billy Jin, David P. Williamson (eprint)
A Quantitative Analysis of Security, Anonymity and Scalability for the Lightning Network. Sergei Tikhomirov, Pedro Moreno-Sanchez, Matteo Maffei (EuroS&P Workshops)
A Quantitative Analysis of Security, Anonymity and Scalability for the Lightning Network. Sergei Tikhomirov, Pedro Moreno-Sanchez, Matteo Maffei (eprint)
A Survey of Bidding Games on Graphs (Invited Paper). Guy Avni, Thomas A. Henzinger (CONCUR)
Algebra-Based Loop Synthesis. Andreas Humenberger, Nikolaj Bjørner, Laura Kovács (IFM)
Algebra-based Loop Synthesis. Andreas Humenberger, Laura Kovács (eprint)
An Improved Algorithm for Dynamic Set Cover. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu (eprint)
Analysis of Bayesian Networks via Prob-Solvable Loops. Ezio Bartocci, Laura Kovács, Miroslav Stankovic (ICTAC)
Analysis of Bayesian Networks via Prob-Solvable Loops. Ezio Bartocci, Laura Kovács, Miroslav Stankovic (eprint)
Approximating Values of Generalized-Reachability Stochastic Games. Pranav Ashok, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger, Tobias Winkler (LICS)
Automated Termination Analysis of Polynomial Probabilistic Programs. Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács (eprint)
Can I Take Your Subdomain? Exploring Related-Domain Attacks in the Modern Web. Marco Squarcina, Mauro Tempesta, Lorenzo Veronese, Stefano Calzavara, Matteo Maffei (eprint)
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. Jinyi Wang, Yican Sun, Hongfei Fu, Mingzhang Huang, Amir Kafshdar Goharshady, Krishnendu Chatterjee (eprint)
Constant-Time Dynamic (Δ+1)-Coloring. Monika Henzinger, Pan Peng (STACS)
Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest. Monika Henzinger, Pan Peng (eprint)
Deterministic Dynamic Matching in O(1) Update Time. Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger (Algorithmica)
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. Monika Henzinger, Stefan Neumann, Andreas Wiese (SoCG)
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. Monika Henzinger, Stefan Neumann, Andreas Wiese (eprint)
Dynamic Clustering to Minimize the Sum of Radii. Monika Henzinger, Dariusz Leniowski, Claire Mathieu (Algorithmica)
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. Sebastian Forster, Gramoz Goranci, Monika Henzinger (eprint)
Dynamic Matching Algorithms in Practice. Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz (ESA)
Dynamic Matching Algorithms in Practice. Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz (eprint)
Dynamic resource allocation games. Guy Avni, Thomas A. Henzinger, Orna Kupferman (Theor. Comput. Sci.)
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. Monika Henzinger, Stefan Neumann, Andreas Wiese (eprint)
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak (FOCS)
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak (eprint)
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis (ATVA)
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis (eprint)
Faster Fully Dynamic Transitive Closure in Practice. Kathrin Hanauer, Monika Henzinger, Christian Schulz (SEA)
Faster Fully Dynamic Transitive Closure in Practice. Kathrin Hanauer, Monika Henzinger, Christian Schulz (eprint)
Faster Parallel Multiterminal Cuts. Monika Henzinger, Alexander Noe, Christian Schulz (eprint)
Finding All Global Minimum Cuts In Practice. Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash (eprint)
Finding All Global Minimum Cuts in Practice. Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash (ESA)
Formal Methods with a Touch of Magic. Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina (FMCAD)
Formal Methods with a Touch of Magic. Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina (eprint)
Formalizing Graph Trail Properties in Isabelle/HOL. Laura Kovács, Hanna Lachnitt, Stefan Szeider (CICM)
Fully Dynamic Single-Source Reachability in Practice - An Experimental Study. Kathrin Hanauer, Monika Henzinger, Christian Schulz (ALENEX)
Fully-Dynamic Coresets. Monika Henzinger, Sagar Kale (ESA)
Fully-Dynamic Coresets. Monika Henzinger, Sagar Kale (eprint)
How Many Bits Does it Take to Quantize Your Neural Network? Mirco Giacobbe, Thomas A. Henzinger, Mathias Lechner (TACAS)
Improved Guarantees for Vertex Sparsification in Planar Graphs. Gramoz Goranci, Monika Henzinger, Pan Peng (SIAM J. Discret. Math.)
Induction with Generalization in Superposition Reasoning. Márton Hajdú, Petra Hozzová, Laura Kovács, Johannes Schoisswohl, Andrei Voronkov (CICM)
Inductive Reachability Witnesses. Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi (eprint)
Inductive sequentialization of asynchronous programs. Bernhard Kragl, Constantin Enea, Thomas A. Henzinger, Suha Orhun Mutluergil, Shaz Qadeer (PLDI)
Information-Flow Interfaces. Ezio Bartocci, Thomas Ferrère, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa (eprint)
Interactive Visualization of Saturation Attempts in Vampire. Bernhard Gleiss, Laura Kovács, Lena Schnedlitz (eprint)
Language-Based Web Session Integrity. Stefano Calzavara, Riccardo Focardi, Niklas Grimm, Matteo Maffei, Mauro Tempesta (CSF)
Language-Based Web Session Integrity. Stefano Calzavara, Riccardo Focardi, Niklas Grimm, Matteo Maffei, Mauro Tempesta (eprint)
Limits on amplifiers of natural selection under death-Birth updating. Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak (PLoS Comput. Biol.)
Local Flow Partitioning for Faster Edge Connectivity. Monika Henzinger, Satish Rao, Di Wang (SIAM J. Comput.)
Monitorability Under Assumptions. Thomas A. Henzinger, N. Ege Saraç (RV)
Monitoring Event Frequencies. Thomas Ferrère, Thomas A. Henzinger, Bernhard Kragl (CSL)
Mora - Automatic Generation of Moment-Based Invariants. Ezio Bartocci, Laura Kovács, Miroslav Stankovic (TACAS)
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop (CONCUR)
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States. Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop (eprint)
Multiple-Environment Markov Decision Processes - Efficient Analysis and Applications. Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer (ICAPS)
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein (eprint)
eThor - Practical and Provably Sound Static Analysis of Ethereum Smart Contracts. Clara Schneidewind, Ilya Grishchenko, Markus Scherer, Matteo Maffei (eprint)
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis (ESOP)
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis (eprint)
Outside the Box - Abstraction-Based Monitoring of Neural Networks. Thomas A. Henzinger, Anna Lukina, Christian Schilling (ECAI)
Polynomial invariant generation for non-deterministic recursive programs. Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady (PLDI)
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. Andreas Pavlogiannis, Nico Schaumberger, Ulrich Schmid, Krishnendu Chatterjee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.)
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning. Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic (eprint)
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, Ming Xu (Proc. ACM Program. Lang.)
Quantitative Analysis of Assertion Violations in Probabilistic Programs. Jinyi Wang, Yican Sun, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee (eprint)
Refinement for Structured Concurrent Programs. Bernhard Kragl, Shaz Qadeer, Thomas A. Henzinger (CAV)
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala (AAAI)
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala (eprint)
Scalable Verification of Quantized Neural Networks (Technical Report). Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic (eprint)
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. Monika Henzinger, Alexander Noe, Christian Schulz (ALENEX)
Simplified Game of Life - Algorithms and Complexity. Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda (MFCS)
Stochastic Games with Lexicographic Reachability-Safety Objectives. Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler (CAV)
Stochastic Games with Lexicographic Reachability-Safety Objectives. Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler (eprint)
Subsumption Demodulation in First-Order Theorem Proving. Bernhard Gleiss, Laura Kovács, Jakob Rath (IJCAR)
Subsumption Demodulation in First-Order Theorem Proving. Bernhard Gleiss, Laura Kovács, Jakob Rath (eprint)
The Good, The Bad and The Ugly - Pitfalls and Best Practices in Automated Sound Static Analysis of Ethereum Smart Contracts. Clara Schneidewind, Markus Scherer, Matteo Maffei (ISoLA)
The Reads-From Equivalence for the TSO and PSO Memory Models. Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman (eprint)
Trace Logic for Inductive Loop Reasoning. Pamina Georgiou, Bernhard Gleiss, Laura Kovács (FMCAD)
Trace Logic for Inductive Loop Reasoning. Pamina Georgiou, Bernhard Gleiss, Laura Kovács (eprint)
Vienna Graph Clustering. Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster (Protein-Protein Interaction Networks)
eThor - Practical and Provably Sound Static Analysis of Ethereum Smart Contracts. Clara Schneidewind, Ilya Grishchenko, Markus Scherer, Matteo Maffei (CCS)
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. Aaron Bernstein, Sebastian Forster, Monika Henzinger (SODA)
A New Deterministic Algorithm for Dynamic Set Cover. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai (FOCS)
A New Deterministic Algorithm for Dynamic Set Cover. Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai (eprint)
A Tree Structure For Dynamic Facility Location. Gramoz Goranci, Monika Henzinger, Dariusz Leniowski (eprint)
Algorithms and Hardness for Diameter in Dynamic Graphs. Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein (ICALP)
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops. Ezio Bartocci, Laura Kovács, Miroslav Stankovic (ATVA)
Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops. Ezio Bartocci, Laura Kovács, Miroslav Stankovic (eprint)
Bidding Games on Markov Decision Processes. Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný (RP)
Bidding Mechanisms in Graph Games. Guy Avni, Thomas A. Henzinger, Dorde Zikelic (MFCS)
Bidding Mechanisms in Graph Games. Guy Avni, Thomas A. Henzinger, Dorde Zikelic (eprint)
Combinations of Qualitative Winning for Stochastic Parity Games. Krishnendu Chatterjee, Nir Piterman (CONCUR)
Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady (eprint)
Compositional Specifications for ioco Testing. Przemyslaw Daca, Thomas A. Henzinger, Willibald Krenn, Dejan Nickovic (eprint)
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest - Dynamic Algorithms Meet Property Testing. Monika Henzinger, Pan Peng (eprint)
Continuous-Time Models for System Design and Analysis. Rajeev Alur, Mirco Giacobbe, Thomas A. Henzinger, Kim G. Larsen, Marius Mikucionis (Computing and Software Science)
Cost Analysis of Nondeterministic Probabilistic Programs. Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi (eprint)
Cost analysis of nondeterministic probabilistic programs. Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, Wenjun Shi (PLDI)
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan (ATVA)
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan (eprint)
Determinacy in Discrete-Bidding Infinite-Duration Games. Milad Aghajohari, Guy Avni, Thomas A. Henzinger (CONCUR)
Determinacy in Discrete-Bidding Infinite-Duration Games. Milad Aghajohari, Guy Avni, Thomas A. Henzinger (eprint)
Distributed Edge Connectivity in Sublinear Time. Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak (eprint)
Distributed edge connectivity in sublinear time. Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak (STOC)
Efficient parameterized algorithms for data packing. Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati, Andreas Pavlogiannis (Proc. ACM Program. Lang.)
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst.)
Fully Dynamic Single-Source Reachability in Practice - An Experimental Study. Kathrin Hanauer, Monika Henzinger, Christian Schulz (eprint)
Fully Dynamic k-Center Clustering in Doubling Metrics. Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil (eprint)
Graph Planning with Expected Finite Horizon. Krishnendu Chatterjee, Laurent Doyen (LICS)
Infinite-duration Bidding Games. Guy Avni, Thomas A. Henzinger, Ventsislav Chonev (J. ACM)
Interactive Visualization of Saturation Attempts in Vampire. Bernhard Gleiss, Laura Kovács, Lena Schnedlitz (IFM)
Lonely Points in Simplices. Maximilian Jaroschek, Manuel Kauers, Laura Kovács (eprint)
Long-Run Average Behavior of Vector Addition Systems with States. Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop (CONCUR)
Long-Run Average Behavior of Vector Addition Systems with States. Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop (eprint)
Membership-Based Synthesis of Linear Hybrid Automata. Miriam García Soto, Thomas A. Henzinger, Christian Schilling, Luka Zeleznik (CAV)
Modular verification for almost-sure termination of probabilistic programs. Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady (Proc. ACM Program. Lang.)
Monitoring Event Frequencies. Thomas Ferrère, Thomas A. Henzinger, Bernhard Kragl (eprint)
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil (CONCUR)
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil (eprint)
New Amortized Cell-Probe Lower Bounds for Dynamic Problems. Sayan Bhattacharya, Monika Henzinger, Stefan Neumann (eprint)
New amortized cell-probe lower bounds for dynamic problems. Sayan Bhattacharya, Monika Henzinger, Stefan Neumann (Theor. Comput. Sci.)
Non-polynomial Worst-Case Analysis of Recursive Programs. Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady (ACM Trans. Program. Lang. Syst.)
Optimal Dyck Reachability for Data-Dependence and Alias Analysis. Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis (eprint)
Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty. Hui Kong, Ezio Bartocci, Yu Jiang, Thomas A. Henzinger (FORMATS)
Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty. Hui Kong, Ezio Bartocci, Yu Jiang, Thomas A. Henzinger (eprint)
Polynomial Invariant Generation for Non-deterministic Recursive Programs. Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady (eprint)
Portfolio SAT and SMT Solving of Cardinality Constraints in Sensor Network Optimization. Gergely Kovásznai, Krisztián Gajdár, Laura Kovács (SYNASC)
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time. Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Kangli He, Ming Xu (eprint)
Quantitative Automata under Probabilistic Semantics. Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop (Log. Methods Comput. Sci.)
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil (eprint)
Run-Time Optimization for Learned Controllers Through Quantitative Games. Guy Avni, Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Bettina Könighofer, Stefan Pranger (CAV)
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. Monika Henzinger, Alexander Noe, Christian Schulz (eprint)
Shared-Memory Exact Minimum Cuts. Monika Henzinger, Alexander Noe, Christian Schulz (IPDPS)
Strategy Representation by Decision Trees with Linear Classifiers. Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman (QEST)
Strategy Representation by Decision Trees with Linear Classifiers. Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman (eprint)
Superposition Reasoning about Quantified Bitvector Formulas. David Damestani, Laura Kovács, Martin Suda (SYNASC)
Termination of Nondeterministic Probabilistic Programs. Hongfei Fu, Krishnendu Chatterjee (VMCAI)
The Complexity of POMDPs with Long-run Average Objectives. Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto (eprint)
The Evolutionary Price of Anarchy - Locally Bounded Agents in a Dynamic Virus Game. Laura Schmid, Krishnendu Chatterjee, Stefan Schmid (OPODIS)
The Evolutionary Price of Anarchy - Locally Bounded Agents in a Dynamic Virus Game. Krishnendu Chatterjee, Laura Schmid, Stefan Schmid (eprint)
The treewidth of smart contracts. Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady (SAC)
Transient Memory in Gene Regulation. Calin C. Guet, Thomas A. Henzinger, Claudia Igler, Tatjana Petrov, Ali Sezgin (CMSB)
Upper and Lower Bounds for Fully Retroactive Graph Problems. Monika Henzinger, Xiaowei Wu (eprint)
Value-centric Dynamic Partial Order Reduction. Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman (eprint)
Value-centric dynamic partial order reduction. Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman (Proc. ACM Program. Lang.)
Verifying Relational Properties using Trace Logic. Gilles Barthe, Renate Eilers, Pamina Georgiou, Bernhard Gleiss, Laura Kovács, Matteo Maffei (FMCAD)
Verifying Relational Properties using Trace Logic. Gilles Barthe, Renate Eilers, Pamina Georgiou, Bernhard Gleiss, Laura Kovács, Matteo Maffei (eprint)
Members
Partners