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.




311 Publications

2012 | Conference Paper | IST-REx-ID: 2891 | OA
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.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2916 | OA
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.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2936 | OA
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.
View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2942
T. A. Henzinger and D. Nickovic, “Independent implementability of viewpoints,” in Conference proceedings Monterey Workshop 2012, Oxford, UK, 2012, vol. 7539, pp. 380–395.
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: 494
U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4. ACM, 2012.
View | DOI
 
2012 | Book Chapter | IST-REx-ID: 5745 | OA
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: 1384 | OA
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.
View | DOI | Download Preprint (ext.)
 
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: 3846 | OA
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.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3128 | OA
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.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3136
C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3155 | OA
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.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3162 | OA
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.
View | Files available | 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: 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: 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 | Conference Paper | IST-REx-ID: 3251 | OA
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.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.
View | DOI | Download Published Version (ext.)
 
2011 | Technical Report | IST-REx-ID: 5383 | OA
T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.
View | Files available | DOI
 

Search

Filter Publications