Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.”https://doi.org/10.1145/2380356.2380370__In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012.https://doi.org/10.1145/2380356.2380370 .

Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.”https://doi.org/10.1007/978-3-642-34059-8_20__In https://doi.org/10.1007/978-3-642-34059-8_20__Conference Proceedings Monterey Workshop 2012, 7539:380–95. Springer, 2012.https://doi.org/10.1007/978-3-642-34059-8_20 .

Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,”https://doi.org/10.1007/978-3-642-31424-7_24__7358:294–309. Springer, 2012.https://doi.org/10.1007/978-3-642-31424-7_24 .

Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,”https://doi.org/10.1007/978-3-642-29860-8_12__7186:147–60. Springer, 2012.https://doi.org/10.1007/978-3-642-29860-8_12 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,”https://doi.org/10.1007/978-3-642-27940-9_1__7148:1–22. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_1 .

Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.”https://doi.org/10.1016/j.tcs.2011.12.059__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2011.12.059 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic <9 Regular Games.”https://doi.org/10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences. Elsevier, 2012.https://doi.org/10.1016/j.jcss.2011.05.002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.”https://doi.org/10.1007/s10703-012-0164-2__Formal Methods in System Design. Springer, 2012.https://doi.org/10.1007/s10703-012-0164-2 .

Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,”https://doi.org/10.1007/978-3-642-30793-5_13__7273:203–18. Springer, 2012.https://doi.org/10.1007/978-3-642-30793-5_13 .

Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.”https://doi.org/10.1016/j.scico.2010.06.004__Science of Computer Programming. Elsevier, 2012.https://doi.org/10.1016/j.scico.2010.06.004 .

Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.”https://doi.org/10.1145/2287718.2287727__ACM Transactions on Computational Logic (TOCL). ACM, 2012.https://doi.org/10.1145/2287718.2287727 .

Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.”https://doi.org/10.1145/2362355.2362357__ACM Transactions on Computational Logic (TOCL). ACM, 2012.https://doi.org/10.1145/2362355.2362357 .

Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.”https://doi.org/10.1016/j.tcs.2011.08.002__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2011.08.002 .

Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”https://doi.org/10.1007/978-3-642-33386-6_14__In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_14 .

Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.”https://doi.org/10.1007/978-3-642-28756-5_46__In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-28756-5_46 .

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”https://doi.org/10.1007/978-3-642-33386-6_10__In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.https://doi.org/10.1007/978-3-642-33386-6_10 .

Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,”https://doi.org/10.1007/978-3-642-27940-9_29__7148:445–60. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_29 .

Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.”https://doi.org/10.1007/978-3-642-25318-8_16__edited by Hongseok Yang, 7078:188–203. Springer, 2011.https://doi.org/10.1007/978-3-642-25318-8_16 .

Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.

Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011.