Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM.https://doi.org/10.1145/2380356.2380370 

Henzinger, T. A., &; Nickovic, D. (2012). Independent implementability of viewpoints. In https://doi.org/10.1007/978-3-642-34059-8_20__Conference proceedings Monterey Workshop 2012 (Vol. 7539, pp. 380–395). Oxford, UK: Springer.https://doi.org/10.1007/978-3-642-34059-8_20 

Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., &; Sezgin, A. (2012). Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358, pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer.https://doi.org/10.1007/978-3-642-31424-7_24 

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 

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 

Feret, J., Henzinger, T. A., Koeppl, H., &; Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2011.12.059 

Chatterjee, K., &; Henzinger, T. A. (2012). A survey of stochastic <9 regular games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2011.05.002 

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0164-2 

Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., &; Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems &; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer.https://doi.org/10.1007/978-3-642-30793-5_13 

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. Elsevier.https://doi.org/10.1016/j.scico.2010.06.004 

Alur, R., Cerny, P., &; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2287718.2287727 

Boker, U., &; Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2362355.2362357 

Cerny, P., Henzinger, T. A., &; Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2011.08.002 

Bouajjani, A., Dragoi, C., Enea, C., &; Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-33386-6_14 

Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &; B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-28756-5_46 

Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-33386-6_10 

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 

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 

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.

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.