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.




427 Publications

2018 | Published | Conference Paper | IST-REx-ID: 5959 | OA
Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: Embedded Software, 1–10.
[Published Version] View | Files available | DOI | WoS
 
2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.
[Published Version] View | Files available | DOI
 
2018 | Published | Journal Article | IST-REx-ID: 434
Jiang Y, Liu H, Song H, Kong H, Wang R, Guan Y, Sha L. 2018. Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. 19(10), 3320–3333.
View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 743
Gottlob G, Henzinger TA, Weißenbacher G. 2017. Preface of the special issue in memoriam Helmut Veith. Formal Methods in System Design. 51(2), 267–269.
View | DOI | WoS
 
2017 | Published | Conference (Editor) | IST-REx-ID: 638
Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.
View | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 1116 | OA
Avni G, Goel S, Henzinger TA, Rodríguez Navas G. 2017. Computing scores of forwarding schemes in switched networks with probabilistic faults. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10206, 169–187.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 942
Le X, Chu DH, Lo D, Le Goues C, Visser W. 2017. S3: Syntax- and semantic-guided repair synthesis via programming by examples. FSE: Foundations of Software Engineering vol. F130154, 593–604.
View | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 962
Trinh M, Chu DH, Jaffar J. 2017. Model counting for recursively-defined strings. CAV: Computer Aided Verification, LNCS, vol. 10427, 399–418.
View | DOI | WoS
 
2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.
[Submitted Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 1196
Henzinger TA, Otop J. 2017. Model measuring for discrete and hybrid systems. Nonlinear Analysis: Hybrid Systems. 23, 166–190.
View | DOI | WoS
 
2017 | Published | Technical Report | IST-REx-ID: 6426 | OA
Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1066 | OA
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1351 | OA
Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2017. Model checking the evolution of gene regulatory networks. Acta Informatica. 54(8), 765–787.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 711 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85, 5.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 37.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed