Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11
LibreCat: https://research-explorer.ista.ac.at/record/1387
DOI: 10.1007/978-3-642-39212-2_11

Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109
LibreCat: https://research-explorer.ista.ac.at/record/2181
DOI: 10.1145/2429069.2429109

Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085
LibreCat: https://research-explorer.ista.ac.at/record/2182
DOI: 10.1145/2429069.2429085

Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:10.1007/978-3-642-45221-5_13
LibreCat: https://research-explorer.ista.ac.at/record/2237
DOI: 10.1007/978-3-642-45221-5_13

Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563
LibreCat: https://research-explorer.ista.ac.at/record/2243
DOI: 10.4230/LIPIcs.CSL.2013.563

Henzinger TA. Quantitative reactive modeling and verification. Computer Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7
LibreCat: https://research-explorer.ista.ac.at/record/2289
DOI: 10.1007/s00450-013-0251-7

Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6
LibreCat: https://research-explorer.ista.ac.at/record/2288
DOI: 10.1007/978-3-642-40708-6

Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10
LibreCat: https://research-explorer.ista.ac.at/record/2298
DOI: 10.1007/978-3-642-38856-9_10

Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 10.1007/s10009-011-0207-9

Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184
LibreCat: https://research-explorer.ista.ac.at/record/2301
DOI: 10.1145/2491956.2462184

Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18
LibreCat: https://research-explorer.ista.ac.at/record/2328
DOI: 10.1007/978-3-642-40184-8_18

Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:10.1007/978-3-642-39799-8_54
LibreCat: https://research-explorer.ista.ac.at/record/2447
DOI: 10.1007/978-3-642-39799-8_54

Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:10.1007/978-3-642-39212-2_3
LibreCat: https://research-explorer.ista.ac.at/record/2517
DOI: 10.1007/978-3-642-39212-2_3

Chatterjee K, De Alfaro L, Henzinger TA. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 2013;79(5):640-657. doi:10.1016/j.jcss.2012.12.001
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 10.1016/j.jcss.2012.12.001

Kucera A, Henzinger TA, Nesetril J, Vojnar T, Antos D, eds. Mathematical and Engineering Methods in Computer Science. Vol 7721. Springer; 2013:1-228. doi:10.1007/978-3-642-36046-6
LibreCat: https://research-explorer.ista.ac.at/record/2885
DOI: 10.1007/978-3-642-36046-6

Henzinger TA, Sezgin A. How Free Is Your Linearizable Concurrent Data Structure? IST Austria; 2013. doi:10.15479/AT:IST-2013-123-v1-1
LibreCat: https://research-explorer.ista.ac.at/record/5402
DOI: 10.15479/AT:IST-2013-123-v1-1

Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: 13th International Conference on Formal Methods in Computer-Aided Design. IEEE; 2013:18-25. doi:10.1109/FMCAD.2013.6679386
LibreCat: https://research-explorer.ista.ac.at/record/1376
DOI: 10.1109/FMCAD.2013.6679386

Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed Synthesis for LTL Fragments. IST Austria; 2013. doi:10.15479/AT:IST-2013-130-v1-1
LibreCat: https://research-explorer.ista.ac.at/record/5406
DOI: 10.15479/AT:IST-2013-130-v1-1

Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:10.1007/978-3-642-40184-8_20
LibreCat: https://research-explorer.ista.ac.at/record/2327
DOI: 10.1007/978-3-642-40184-8_20

Henzinger TA, Payer H, Sezgin A. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria; 2013. doi:10.15479/AT:IST-2013-124-v1-1
LibreCat: https://research-explorer.ista.ac.at/record/6440
DOI: 10.15479/AT:IST-2013-124-v1-1

Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:10.1007/978-3-642-39799-8_11
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 10.1007/978-3-642-39799-8_11

Zufferey D. Analysis of dynamic message passing programs. 2013. doi:10.15479/at:ista:1405
LibreCat: https://research-explorer.ista.ac.at/record/1405
DOI: 10.15479/at:ista:1405

Bansal K, Koskinen E, Wies T, Zufferey D. Structural Counter Abstraction. Piterman N, Smolka S, eds. 2013;7795:62-77. doi:10.1007/978-3-642-36742-7_5
LibreCat: https://research-explorer.ista.ac.at/record/2847
DOI: 10.1007/978-3-642-36742-7_5

Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. Efficient synthesis for concurrency by semantics-preserving transformations. In: Vol 8044. Springer; 2013:951-967. doi:10.1007/978-3-642-39799-8_68
LibreCat: https://research-explorer.ista.ac.at/record/2445
DOI: 10.1007/978-3-642-39799-8_68

Beyer D, Henzinger TA, Keremoglu M, Wendler P. 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. ACM; 2012. doi:10.1145/2393596.2393664
LibreCat: https://research-explorer.ista.ac.at/record/1384
DOI: 10.1145/2393596.2393664

Henzinger TA, Mateescu M. The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. 2012;10(2):310-322. doi:10.1109/TCBB.2012.91
LibreCat: https://research-explorer.ista.ac.at/record/2302
DOI: 10.1109/TCBB.2012.91
PMID: 22778152

Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 2012;301:161-173. doi:10.1016/j.jtbi.2012.02.021
LibreCat: https://research-explorer.ista.ac.at/record/2848
DOI: 10.1016/j.jtbi.2012.02.021
PMID: 22394652

Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: Leibniz International Proceedings in Informatics. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:10.4230/LIPIcs.FSTTCS.2012.362
LibreCat: https://research-explorer.ista.ac.at/record/2891
DOI: 10.4230/LIPIcs.FSTTCS.2012.362

Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: Proceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:53-62. doi:10.1145/2380356.2380371
LibreCat: https://research-explorer.ista.ac.at/record/2890
DOI: 10.1145/2380356.2380371

Henzinger TA. Quantitative reactive models. In: Conference Proceedings MODELS 2012. Vol 7590. Springer; 2012:1-2. doi:10.1007/978-3-642-33666-9_1
LibreCat: https://research-explorer.ista.ac.at/record/2888
DOI: 10.1007/978-3-642-33666-9_1

Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS; 2012:29-42. doi:10.4204/EPTCS.96.3
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: Roceedings of the Tenth ACM International Conference on Embedded Software. ACM; 2012:43-52. doi:10.1145/2380356.2380370
LibreCat: https://research-explorer.ista.ac.at/record/2936
DOI: 10.1145/2380356.2380370

Henzinger TA, Nickovic D. Independent implementability of viewpoints. In: 10.1007/978-3-642-34059-8_20__Conference Proceedings Monterey Workshop 2012. Vol 7539. Springer; 2012:380-395. doi:10.1007/978-3-642-34059-8_20
LibreCat: https://research-explorer.ista.ac.at/record/2942
DOI: 10.1007/978-3-642-34059-8_20

Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. Delayed continuous time Markov chains for genetic regulatory circuits. In: Vol 7358. Springer; 2012:294-309. doi:10.1007/978-3-642-31424-7_24
LibreCat: https://research-explorer.ista.ac.at/record/3136
DOI: 10.1007/978-3-642-31424-7_24

Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:10.1007/978-3-642-29860-8_12
LibreCat: https://research-explorer.ista.ac.at/record/3162
DOI: 10.1007/978-3-642-29860-8_12

Bouajjani A, Dragoi C, Enea C, Sighireanu M. Abstract domains for automated reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer; 2012:1-22. doi:10.1007/978-3-642-27940-9_1
LibreCat: https://research-explorer.ista.ac.at/record/3253
DOI: 10.1007/978-3-642-27940-9_1

Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. Theoretical Computer Science. 2012;431:137-164. doi:10.1016/j.tcs.2011.12.059
LibreCat: https://research-explorer.ista.ac.at/record/3168
DOI: 10.1016/j.tcs.2011.12.059

Chatterjee K, Henzinger TA. A survey of stochastic <9 regular games. Journal of Computer and System Sciences. 2012;78(2):394-413. doi:10.1016/j.jcss.2011.05.002
LibreCat: https://research-explorer.ista.ac.at/record/3846
DOI: 10.1016/j.jcss.2011.05.002

Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 2012;43(2):268-284. doi:10.1007/s10703-012-0164-2
LibreCat: https://research-explorer.ista.ac.at/record/3128
DOI: 10.1007/s10703-012-0164-2

Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218. doi:10.1007/978-3-642-30793-5_13
LibreCat: https://research-explorer.ista.ac.at/record/3155
DOI: 10.1007/978-3-642-30793-5_13

Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 2012;77(2):96-112. doi:10.1016/j.scico.2010.06.004
LibreCat: https://research-explorer.ista.ac.at/record/3836
DOI: 10.1016/j.scico.2010.06.004

Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 2012;13(3). doi:10.1145/2287718.2287727
LibreCat: https://research-explorer.ista.ac.at/record/2967
DOI: 10.1145/2287718.2287727

Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 2012;13(4). doi:10.1145/2362355.2362357
LibreCat: https://research-explorer.ista.ac.at/record/494
DOI: 10.1145/2362355.2362357

Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. Theoretical Computer Science. 2012;413(1):21-35. doi:10.1016/j.tcs.2011.08.002
LibreCat: https://research-explorer.ista.ac.at/record/3249
DOI: 10.1016/j.tcs.2011.08.002

Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:10.1007/978-3-642-33386-6_14
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 10.1007/978-3-642-33386-6_14

Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. Tools and Algorithms for the Construction and Analysis of Systems. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:10.1007/978-3-642-28756-5_46
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 10.1007/978-3-642-28756-5_46

Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:10.1007/978-3-642-33386-6_10
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 10.1007/978-3-642-33386-6_10

Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:10.1007/978-3-642-27940-9_29
LibreCat: https://research-explorer.ista.ac.at/record/3251
DOI: 10.1007/978-3-642-27940-9_29

Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:10.1007/978-3-642-25318-8_16
LibreCat: https://research-explorer.ista.ac.at/record/3264
DOI: 10.1007/978-3-642-25318-8_16

Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: USENIX; 2011:1-6.
LibreCat: https://research-explorer.ista.ac.at/record/3302

Henzinger TA, Mateescu M. Tail approximation for the chemical master equation. In: Tampere International Center for Signal Processing; 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3301

Henzinger TA, Mateescu M. Propagation models for computing biochemical reaction networks. In: Springer; 2011:1-3. doi:10.1145/2037509.2037510
LibreCat: https://research-explorer.ista.ac.at/record/3299
DOI: 10.1145/2037509.2037510

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered robustness. In: 6th IEEE International Symposium on Industrial and Embedded Systems. IEEE; 2011:176-185. doi:10.1109/SIES.2011.5953660
LibreCat: https://research-explorer.ista.ac.at/record/3316
DOI: 10.1109/SIES.2011.5953660

Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 2011;33(4). doi:10.1145/1985342.1985345
LibreCat: https://research-explorer.ista.ac.at/record/3353
DOI: 10.1145/1985342.1985345

Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40
LibreCat: https://research-explorer.ista.ac.at/record/3355
DOI: 10.1109/QEST.2011.40

Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

Fisher J, Harel D, Henzinger TA. Biology as reactivity. Communications of the ACM. 2011;54(10):72-82. doi:10.1145/2001269.2001289
LibreCat: https://research-explorer.ista.ac.at/record/3352
DOI: 10.1145/2001269.2001289

Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:10.1007/978-3-642-23217-6_27
LibreCat: https://research-explorer.ista.ac.at/record/3362
DOI: 10.1007/978-3-642-23217-6_27

Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24
LibreCat: https://research-explorer.ista.ac.at/record/3365
DOI: 10.1007/978-3-642-19835-9_24

Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 2011;22(4):823-841. doi:10.1142/S0129054111008441
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454
LibreCat: https://research-explorer.ista.ac.at/record/3325
DOI: 10.1145/1926385.1926454

Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82

Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:10.1109/CSF.2011.21
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:10.1145/1966445.1966476
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:10.1145/2038642.2038666
LibreCat: https://research-explorer.ista.ac.at/record/3359
DOI: 10.1145/2038642.2038666

Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 2011;412(21):2128-2141. doi:10.1016/j.tcs.2010.10.022
LibreCat: https://research-explorer.ista.ac.at/record/3364
DOI: 10.1016/j.tcs.2010.10.022

Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. Formal Methods in System Design. 2011;39(3):297-331. doi:10.1007/s10703-011-0131-3
LibreCat: https://research-explorer.ista.ac.at/record/531
DOI: 10.1007/s10703-011-0131-3

Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:10.1109/LICS.2011.33
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal Specifications with Accumulative Values. IST Austria; 2011. doi:10.15479/AT:IST-2011-0003
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005
LibreCat: https://research-explorer.ista.ac.at/record/5383
DOI: 10.15479/AT:IST-2011-0005

Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36
LibreCat: https://research-explorer.ista.ac.at/record/3323
DOI: 10.1007/978-3-642-22438-6_36

Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:10.1007/978-3-642-22110-1_20
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule-based systems. In: Vol 40. Open Publishing Association; 2010:142-161.
LibreCat: https://research-explorer.ista.ac.at/record/3719
arXiv: 1011.0496

Didier F, Henzinger TA, Mateescu M, Wolf V. SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: IEEE; 2010:193-194. doi:10.1109/QEST.2010.33
LibreCat: https://research-explorer.ista.ac.at/record/3847
DOI: 10.1109/QEST.2010.33

Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:10.1007/978-3-642-16242-8_25
LibreCat: https://research-explorer.ista.ac.at/record/3845
DOI: 10.1007/978-3-642-16242-8_25

Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 2010;4(6):441-452. doi:10.1049/iet-syb.2010.0005
LibreCat: https://research-explorer.ista.ac.at/record/3842
DOI: 10.1049/iet-syb.2010.0005

Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:10.1007/978-3-642-15155-2_23
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23

Chatterjee K, Henzinger TA, eds. Formal Modeling and Analysis of Timed Systems. Vol 6246. Springer; 2010. doi:10.1007/978-3-642-15297-9
LibreCat: https://research-explorer.ista.ac.at/record/3859
DOI: 10.1007/978-3-642-15297-9

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:10.1007/978-3-642-14295-6_36
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:10.1007/978-3-642-15297-9_13
LibreCat: https://research-explorer.ista.ac.at/record/4369
DOI: 10.1007/978-3-642-15297-9_13

Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. BMC Systems Biology. 2010;4(42):1-19. doi:10.1186/1752-0509-4-42
LibreCat: https://research-explorer.ista.ac.at/record/3834
DOI: 10.1186/1752-0509-4-42

Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:10.1145/1706299.1706319
LibreCat: https://research-explorer.ista.ac.at/record/3840
DOI: 10.1145/1706299.1706319

Henzinger TA, Hottelier T, Kovács L, Voronkov A. Invariant and type inference for matrices. In: Vol 5944. Springer; 2010:163-179. doi:10.1007/978-3-642-11319-2_14
LibreCat: https://research-explorer.ista.ac.at/record/3839
DOI: 10.1007/978-3-642-11319-2_14

Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:10.1145/1839764.1839772
LibreCat: https://research-explorer.ista.ac.at/record/3838
DOI: 10.1145/1839764.1839772

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:10.1007/978-3-642-15375-4_19
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:10.4230/LIPIcs.FSTTCS.2010.505
LibreCat: https://research-explorer.ista.ac.at/record/3860
DOI: 10.4230/LIPIcs.FSTTCS.2010.505

Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:10.1007/978-3-642-14295-6_34
LibreCat: https://research-explorer.ista.ac.at/record/3864
DOI: 10.1007/978-3-642-14295-6_34

Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. Information and Computation. 2010;208(10):1206-1220. doi:10.1016/j.ic.2009.09.006
LibreCat: https://research-explorer.ista.ac.at/record/3863
DOI: 10.1016/j.ic.2009.09.006

Chatterjee K, Henzinger TA, Piterman N. Strategy logic. Information and Computation. 2010;208(6):677-693. doi:10.1016/j.ic.2009.07.004
LibreCat: https://research-explorer.ista.ac.at/record/3861
DOI: 10.1016/j.ic.2009.07.004

Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:10.1007/978-3-642-16612-9_32
LibreCat: https://research-explorer.ista.ac.at/record/4362
DOI: 10.1007/978-3-642-16612-9_32

Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:10.1007/978-3-642-11319-2_6
LibreCat: https://research-explorer.ista.ac.at/record/4378
DOI: 10.1007/978-3-642-11319-2_6

Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning of resources in a cloud environment. In: IEEE; 2010:83-90. doi:10.1109/CLOUD.2010.71
LibreCat: https://research-explorer.ista.ac.at/record/4381
DOI: 10.1109/CLOUD.2010.71

Guerraoui R, Henzinger TA, Kapalka M, Singh V. Transactions in the jungle. In: ACM; 2010:263-272. doi:10.1145/1810479.1810529
LibreCat: https://research-explorer.ista.ac.at/record/4382
DOI: 10.1145/1810479.1810529

Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:10.1145/1879021.1879022
LibreCat: https://research-explorer.ista.ac.at/record/4380
DOI: 10.1145/1879021.1879022