Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
415 Publications
2024 | Published | Conference Paper | IST-REx-ID: 15377 |

R. Majumdar, I. Sağlam, and K. S. Thejaswini, “Rabin games and colourful universal trees,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2024, vol. 14572, pp. 213–231.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 18530 |

S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata,” Logical Methods in Computer Science, vol. 20, no. 4. EPI Sciences, pp. 1–28, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18066 |

G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in 35th International Conference on Concurrency Theory, Calgary, Canada, 2024, vol. 311.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 17094 |

E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Information-flow interfaces,” Formal Methods in System Design. Springer Nature, 2024.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15321 |

G. Trinh, B. Benhamou, S. Pastva, and S. Soliman, “Scalable enumeration of trap spaces in boolean networks via answer set programming,” in Proceedings of the 38th AAAI Conference on Artificial Intelligence, 2024, vol. 38, no. 9, pp. 10714–10722.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2024 | Research Data Reference | IST-REx-ID: 19800 |

V. G. trinh, K. H. Park, S. Pastva, and J. Rozum, “Mapping the attractor landscape of Boolean networks.” Zenodo, 2024.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2024 | Published | Conference Paper | IST-REx-ID: 17898
M. Lechner, R. Hasani, A. Amini, T. H. Wang, T. A. Henzinger, and D. Rus, “Overparametrization helps offline-to-online generalization of closed-loop control from pixels,” in Proceedings of the 2024 IEEE International Conference on Robotics and Automation, Yokohama, Japan, 2024, pp. 2774–2782.
View
| DOI
2024 | Published | Conference Paper | IST-REx-ID: 17634 |

M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “QuAK: Quantitative Automata Kit,” in 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, Crete, Greece, 2024, vol. 15222, pp. 3–20.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13141 |

A. Anand, K. Mallik, S. P. Nayak, and A. K. Schmuck, “Computing adequately permissive assumptions for synthesis,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 211–228.
[Published Version]
View
| Files available
| DOI
2023 | Published | Conference Paper | IST-REx-ID: 13228 |

T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Runtime monitoring of dynamic fairness properties,” in FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Chicago, IL, United States, 2023, pp. 604–614.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13310 |

T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in Computer Aided Verification, Paris, France, 2023, vol. 13965, pp. 358–382.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14454 |

T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness under partial observations,” in 23rd International Conference on Runtime Verification, Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 12467 |

T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in 26th International Conference Foundations of Software Science and Computation Structures, Paris, France, 2023, vol. 13992, pp. 349–370.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 12854 |

M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 535–540.
[Published Version]
View
| Files available
| DOI
2023 | Published | Conference Paper | IST-REx-ID: 14758 |

R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties,” in 35th International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 3–15.
[Published Version]
View
| Files available
| DOI
2023 | Published | Journal Article | IST-REx-ID: 14920 |

T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “Fast symbolic algorithms for mega-regular games under strong transition fairness,” TheoretiCS, vol. 2. EPI Sciences, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Research Data Reference | IST-REx-ID: 14994 |

R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties.” Zenodo, 2023.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)