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.

Pavol Kebis

Konstantin Kueffner

Stefanie Muroya Lei

Anton Varonka

Filip Cano Cordoba

Fabian Kresse

Leonard Brice

Ana Oliveira da Costa

Thomas Henzinger

Jan Kretinsky

Kaushik Mallik

Jakob Ruess

Roopsha Samanta

Tatjana Petrov

Duc Hiep Chu

Marek Chalupa

Vasu Singh

Singh, Anmol

Dejan Nickovic

Luka Zeleznik

Anmol Tomar

Thomas Wies

N. Ege Saraç

Jessica Davies

Sergiy Bogomolov

Mirco Giacobbe

Samuel Pastva

Abhinav Verma

Miriam García Soto

Nicolas Mazzocchi

Ashutosh Gupta

Oliveira da Costa, Ana

K. S. Thejaswini

Mathias Lechner

Thomas Ferrère

Halalai, Raluca

Guy Avni

Jan Otop

Christian Schilling

Andrey Kupriyanov

Pavol Cerny

Joost Katoen

Damien Zufferey

Udi Boker

Hui Kong

Adrian Elgyütt

Arjun Radhakrishna

Mahyar Karimi

Anna Lukina

Bernhard Kragl

Ali Sezgin

Cezara Dragoi

Fabian Mühlböck

Emily Yu

Thorsten Tarrach

Przemyslaw Daca



436 Publications

2018 | Published | Conference Paper | IST-REx-ID: 140 | OA
Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer, 2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.
[Published Version] View | Files available | DOI | WoS
 
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1196
Henzinger, Thomas A., and Jan Otop. “Model Measuring for Discrete and Hybrid Systems.” Nonlinear Analysis: Hybrid Systems, vol. 23, Elsevier, 2017, pp. 166–90, doi:10.1016/j.nahs.2016.09.001.
View | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1338 | OA
Cerny, Pavol, et al. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design, vol. 50, no. 2–3, Springer, 2017, pp. 97–139, doi:10.1007/s10703-016-0256-5.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2017 | Published | Journal Article | IST-REx-ID: 1351 | OA
Giacobbe, Mirco, et al. “Model Checking the Evolution of Gene Regulatory Networks.” Acta Informatica, vol. 54, no. 8, Springer, 2017, pp. 765–87, doi:10.1007/s00236-016-0278-x.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1066 | OA
Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” Information and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1003 | OA
Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:10.1007/978-3-662-54434-1_11.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 941 | OA
Le, Xuan, et al. “JFIX: Semantics-Based Repair of Java Programs via Symbolic  PathFinder.” Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2017, pp. 376–79, doi:10.1145/3092703.3098225.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 942
Le, Xuan, et al. S3: Syntax- and Semantic-Guided Repair Synthesis via Programming by Examples. Vol. F130154, ACM, 2017, pp. 593–604, doi:10.1145/3106237.3106309.
View | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 963 | OA
Avni, Guy, et al. Timed Network Games with Clocks. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.37.
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 471 | OA
Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic, vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 549 | OA
Finkbeiner, Bernd, and Andrey Kupriyanov. “Causality-Based Model Checking.” Electronic Proceedings in Theoretical Computer Science, vol. 259, Open Publishing Association, 2017, pp. 31–38, doi:10.4204/EPTCS.259.3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
[Submitted Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 633
Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.
View | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 636 | OA
Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed