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.
386 Publications
2013 | Conference Paper | IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 5406 | 
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2327 |
T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.
[Submitted Version]
View
| Files available
| DOI
2013 | Technical Report | IST-REx-ID: 6440 |
T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 | Book Chapter | IST-REx-ID: 5747 |
C. Dragoi, A. Gupta, and T. A. Henzinger, “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates,” in Computer Aided Verification, vol. 8044, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 174–190.
View
| Files available
| DOI
2013 | Thesis | IST-REx-ID: 1405 |
D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2013 | Conference Paper | IST-REx-ID: 2847 |
K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2013 | Conference Paper | IST-REx-ID: 2445 |
P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.
[Submitted Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 1384 |
D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model checking: A technique to pass information between verifiers,” in Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, Cary, NC, USA, 2012.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Journal Article | IST-REx-ID: 2302
T. A. Henzinger and M. Mateescu, “The propagation approach for computing biochemical reaction networks,” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2. IEEE, pp. 310–322, 2012.
View
| DOI
| PubMed | Europe PMC
2012 | Journal Article | IST-REx-ID: 2848 |
K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier, pp. 161–173, 2012.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Conference Paper | IST-REx-ID: 2891 |
U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in Leibniz International Proceedings in Informatics, Hyderabad, India, 2012, vol. 18, pp. 362–373.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2916 |
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 2936 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 3162 |
E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification of temporal properties,” presented at the RV: Runtime Verification, San Francisco, CA, United States, 2012, vol. 7186, pp. 147–160.
[Submitted Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3253
A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for automated reasoning about list manipulating programs with infinite data,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 1–22.
View
| DOI
2012 | Journal Article | IST-REx-ID: 3168
J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier, pp. 137–164, 2012.
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3846 |
K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Journal Article | IST-REx-ID: 3128 |
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2. Springer, pp. 268–284, 2012.
[Submitted Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3155 |
B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous interface theories and time triggered scheduling,” presented at the FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273, pp. 203–218.
[Submitted Version]
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3836
A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code,” Science of Computer Programming, vol. 77, no. 2. Elsevier, pp. 96–112, 2012.
View
| DOI
2012 | Journal Article | IST-REx-ID: 2967
R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3. ACM, 2012.
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3249
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 10903
A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.
View
| DOI
2012 | Conference Paper | IST-REx-ID: 10906 |
S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 | Book Chapter | IST-REx-ID: 5745 |
A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in Automated Technology for Verification and Analysis, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 3251 |
D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3302 |
T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.
[Submitted Version]
View
| Files available
2011 | Conference Paper | IST-REx-ID: 3301 |
T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.
[Submitted Version]
View
| Files available
2011 | Conference Paper | IST-REx-ID: 3299 |
T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3316 |
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Journal Article | IST-REx-ID: 3353 |
S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3355 |
R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3362 |
J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3365 |
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
[Submitted Version]
View
| Files available
| DOI
2011 | Preprint | IST-REx-ID: 3363 |
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Journal Article | IST-REx-ID: 3381 |
T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3315 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3326 |
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3324 |
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3360 |
U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.
[Published Version]
View
| Files available
| DOI