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.




385 Publications

2012 | Conference Paper | IST-REx-ID: 2942
Independent implementability of viewpoints
T.A. Henzinger, D. Nickovic, in:, Conference Proceedings Monterey Workshop 2012, Springer, 2012, pp. 380–395.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3136
Delayed continuous time Markov chains for genetic regulatory circuits
C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3162 | OA
Parametric identification of temporal properties
E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.
[Submitted Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3253
Abstract domains for automated reasoning about list manipulating programs with infinite data
A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp. 1–22.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3168
Lumpability abstractions of rule based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3846 | OA
A survey of stochastic ω regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2012 | Journal Article | IST-REx-ID: 3128 | OA
A survey of partial-observation stochastic parity games
K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.
[Submitted Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3155 | OA
Synchronous interface theories and time triggered scheduling
B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218.
[Submitted Version] View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3836
Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code
A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 2967
Algorithmic analysis of array-accessing programs
R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 494
Translating to Co-Büchi made tight, unified, and useful
U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3249
Simulation distances
P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 10903
Accurate invariant checking for programs manipulating lists and arrays with infinite data
A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 10906 | OA
HSF(C): A software verifier based on Horn clauses
S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.
[Published Version] View | DOI | Download Published Version (ext.)
 
2012 | Book Chapter | IST-REx-ID: 5745 | OA
Improved Single Pass Algorithms for Resolution Proof Reduction
A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3251 | OA
Ideal abstractions for well structured transition systems
D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3264
Solving recursion-free Horn clauses over LI+UIF
A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3302 | OA
Static scheduling in clouds
T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.
[Submitted Version] View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3301 | OA
Tail approximation for the chemical master equation
T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.
[Submitted Version] View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3299 | OA
Propagation models for computing biochemical reaction networks
T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Journal Article | IST-REx-ID: 3353 | OA
A theory of synchronous relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3355 | OA
Quantitative evaluation of BFT protocols
R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3354
Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3352
Biology as reactivity
J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3362 | OA
Dynamic reactive modules
J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3365 | OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
[Submitted Version] View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3381 | OA
Formalisms for specifying Markovian population models
T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3315 | OA
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3326 | OA
What’s decidable about weighted automata
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3325 View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3360 | OA
Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361 | OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3359
From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3364 | OA
Approximation of event probabilities in noisy cellular processes
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
Verification of STM on relaxed memory models
R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
[Submitted Version] View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5383 | OA
On an efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3323
An efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 10908 | OA
ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2010 | Conference Paper | IST-REx-ID: 3719 | OA
Lumpability abstractions of rule-based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, in:, Open Publishing Association, 2010, pp. 142–161.
[Submitted Version] View | Files available | arXiv
 
2010 | Conference Paper | IST-REx-ID: 3847 | OA
SABRE: A tool for the stochastic analysis of biochemical reaction networks
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3845 | OA
Aligators for arrays
T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.
[Submitted Version] View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3842 | OA
Fast adaptive uniformization of the chemical master equation
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications