C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard, “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, pp. 74–88.

J. Berdine et al., “Shape Analysis for Composite Data Structures,” presented at the CAV: Computer Aided Verification, 2007, pp. 178–192.

M. Schaub, T. A. Henzinger, and J. Fisher, “Qualitative networks: A symbolic approach to analyze biological signaling networks,” BMC Systems Biology, vol. 1, no. 4. BioMed Central, 2007.

R. Alur, P. Cerny, and S. Chaudhuri, “Model Checking on Trees with Path Equivalences,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, pp. 664–678.

R. Manevich, J. Field, T. A. Henzinger, G. Ramalingam, and M. Sagiv, “Abstract counterexample-based refinement for powerset domains,” in Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday, vol. 4444, Springer, 2007, pp. 273–292.

T. A. Henzinger and C. Kirsch, “The embedded machine: Predictable, portable real-time code,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 29, no. 393. ACM, 2007.

T. A. Henzinger, “Games, time, and probability: Graph models for system design and analysis,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, 2007, vol. 4362, pp. 103–110.

T. A. Henzinger, “Quantitative generalizations of languages,” presented at the DLT: Developments in Language Theory, 2007, vol. 4588, pp. 20–22.

J. Fisher, N. Piterman, A. Hajnal, and T. A. Henzinger, “Predictive modeling of signaling crosstalk during C. elegans vulval development,” PLoS Computational Biology, vol. 3(5):e92. Public Library of Science, 2007.

J. Fisher and T. A. Henzinger, “Executable cell biology,” Nature Biotechnology, vol. 25. Nature Publishing Group, pp. 1239–1249, 2007.

J. Duparc and T. A. Henzinger, CSL: Computer Science Logic , vol. 4646. Springer, 2007.

K. Chatterjee and T. A. Henzinger, “Assume-guarantee synthesis,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2007, vol. 4424, pp. 261–275.

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Algorithms for omega-regular games with imperfect information,” Logical Methods in Computer Science, vol. 3, no. 184. International Federation of Computational Logic, pp. 1–23, 2007.

K. Chatterjee, “Stochastic <9-Regular Games,” University of California, Berkeley, 2007.

A. Chakrabarti, “A framework for compositional design and analysis of systems,” University of California, Berkeley, 2007.

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “The software model checker BLAST: Applications to software engineering,” International Journal on Software Tools for Technology Transfer, vol. 9, no. 5. Springer, pp. 505–525, 2007.

T. Brihaye, T. A. Henzinger, V. Prabhu, and J. Raskin, “Minimum-time reachability in timed games,” presented at the ICALP: Automata, Languages and Programming, 2007, vol. 4596, pp. 825–837.

D. Beyer, T. A. Henzinger, and G. Théoduloz, “Configurable software verification: Concretizing the convergence of model checking and program analysis,” presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 504–518.

D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Invariant synthesis for combined theories,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, vol. 4349, pp. 378–394.

D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Path invariants,” presented at the PLDI: Programming Languages Design and Implementation, 2007, pp. 300–309.