Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




405 Publications

2018 | Published | Journal Article | IST-REx-ID: 6006 | OA
An abstraction-refinement methodology for reasoning about network games
G. Avni, S. Guha, O. Kupferman, Games 9 (2018).
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
Faster algorithms for weighted recursive state machines
K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
A new proof rule for almost-sure termination
A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1066
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.
View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Infinite-duration bidding games
G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 962
Model counting for recursively-defined strings
M. Trinh, D.H. Chu, J. Jaffar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 399–418.
View | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Timed network games with clocks
G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 941 | OA
JFIX: Semantics-based repair of Java programs via symbolic PathFinder
X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–379.
[Published Version] View | DOI | Download Published Version (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 942
S3: Syntax- and semantic-guided repair synthesis via programming by examples
X. Le, D.H. Chu, D. Lo, C. Le Goues, W. Visser, in:, ACM, 2017, pp. 593–604.
View | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1338 | OA
From non-preemptive to preemptive scheduling using synchronization synthesis
P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta, T. Tarrach, Formal Methods in System Design 50 (2017) 97–139.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1351 | OA
Model checking the evolution of gene regulatory networks
M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, Acta Informatica 54 (2017) 765–787.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1407 | OA
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
Computing scores of forwarding schemes in switched networks with probabilistic faults
G. Avni, S. Goel, T.A. Henzinger, G. Rodríguez Navas, in:, Springer, 2017, pp. 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1196
Model measuring for discrete and hybrid systems
T.A. Henzinger, J. Otop, Nonlinear Analysis: Hybrid Systems 23 (2017) 166–190.
View | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 471 | OA
Faster statistical model checking for unbounded temporal properties
P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 549 | OA
Causality-based model checking
B. Finkbeiner, A. Kupriyanov, in:, Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2017, pp. 31–38.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | Published | Journal Article | IST-REx-ID: 743
Preface of the special issue in memoriam Helmut Veith
G. Gottlob, T.A. Henzinger, G. Weißenbacher, Formal Methods in System Design 51 (2017) 267–269.
View | DOI | WoS
 
2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed