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.




300 Publications

2012 | Conference Paper | IST-REx-ID: 3162 | OA
Asarin, E., Donzé, A., Maler, O., & Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-642-29860-8_12
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3168
Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science, 431, 137–164. https://doi.org/10.1016/j.tcs.2011.12.059
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3249
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science, 413(1), 21–35. https://doi.org/10.1016/j.tcs.2011.08.002
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3251 | OA
Zufferey, D., Wies, T., & Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_29
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3253
Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Abstract domains for automated reasoning about list manipulating programs with infinite data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3836
Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., & Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming, 77(2), 96–112. https://doi.org/10.1016/j.scico.2010.06.004
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences, 78(2), 394–413. https://doi.org/10.1016/j.jcss.2011.05.002
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design, 39(3), 297–331. https://doi.org/10.1007/s10703-011-0131-3
View | DOI | Download Published Version (ext.)
 
2011 | Technical Report | IST-REx-ID: 5383 | OA
Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005
View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3264
Gupta, A., Popeea, C., & Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3299 | OA
Henzinger, T. A., & Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. https://doi.org/10.1145/2037509.2037510
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3301 | OA
Henzinger, T. A., & Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.
View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, T. A., Singh, A., Singh, V., Wies, T., & Zufferey, D. (2011). Static scheduling in clouds (pp. 1–6). Presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, USENIX.
View | Files available
 
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science, 7(4). https://doi.org/10.2168/LMCS-7(4:8)2011
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., & Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE. https://doi.org/10.1109/SIES.2011.5953660
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3323
Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. https://doi.org/10.1007/978-3-642-18275-4_26
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3325
Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3326 | OA
Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. https://doi.org/10.1007/978-3-642-24372-1_37
View | Files available | DOI
 

Search

Display / Sort

Citation Style: APA

Export / Embed