Alur, Rajeev, et al. Model Checking on Trees with Path Equivalences. Springer, 2007, pp. 664–78, doi:1544.

Manevich, Roman, et al. “Abstract Counterexample-Based Refinement for Powerset Domains.”10.1007/978-3-540-71322-7_13__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–92, doi:10.1007/978-3-540-71322-7_13.

Henzinger, Thomas A., and Christoph Kirsch. “The Embedded Machine: Predictable, Portable Real-Time Code.”10.1145/1286821.1286824__ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 29, no. 393, ACM, 2007, doi:10.1145/1286821.1286824.

Henzinger, Thomas A. Games, Time, and Probability: Graph Models for System Design and Analysis. Vol. 4362, Springer, 2007, pp. 103–10, doi:10.1007/978-3-540-69507-3_7.

Henzinger, Thomas A. Quantitative Generalizations of Languages. Vol. 4588, Springer, 2007, pp. 20–22, doi:10.1007/978-3-540-73208-2_2.

Fisher, Jasmin, et al. “Predictive Modeling of Signaling Crosstalk during C. Elegans Vulval Development.”10.1371/journal.pcbi.0030092__PLoS Computational Biology, vol. 3(5):e92, Public Library of Science, 2007, doi:10.1371/journal.pcbi.0030092.

Fisher, Jasmin, and Thomas A. Henzinger. “Executable Cell Biology.”10.1038/nbt1356__Nature Biotechnology, vol. 25, Nature Publishing Group, 2007, pp. 1239–49, doi:10.1038/nbt1356.

Duparc, Jacques, and Thomas A. Henzinger. “CSL: Computer Science Logic .”10.1007/978-3-540-74915-8__CSL: Computer Science Logic, vol. 4646, Springer, 2007, doi:10.1007/978-3-540-74915-8.

Chatterjee, Krishnendu, and Thomas A. Henzinger. Assume-Guarantee Synthesis. Vol. 4424, Springer, 2007, pp. 261–75, doi:10.1007/978-3-540-71209-1_21.

Chatterjee, Krishnendu, et al. “Algorithms for Omega-Regular Games with Imperfect Information.”10.2168/LMCS-3(3:4)2007__Logical Methods in Computer Science, vol. 3, no. 184, International Federation of Computational Logic, 2007, pp. 1–23, doi:10.2168/LMCS-3(3:4)2007.

Chatterjee, Krishnendu. Stochastic <9-Regular Games. University of California, Berkeley, 2007, pp. 1–247.

Chakrabarti, Arindam. A Framework for Compositional Design and Analysis of Systems. University of California, Berkeley, 2007, pp. 1–244.

Beyer, Dirk, et al. “The Software Model Checker BLAST: Applications to Software Engineering.”10.1007/s10009-007-0044-z__International Journal on Software Tools for Technology Transfer, vol. 9, no. 5, Springer, 2007, pp. 505–25, doi:10.1007/s10009-007-0044-z.

Brihaye, Thomas, et al. Minimum-Time Reachability in Timed Games. Vol. 4596, Springer, 2007, pp. 825–37, doi:10.1007/978-3-540-73420-8_71.

Beyer, Dirk, et al. Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis. Vol. 4590, Springer, 2007, pp. 504–18, doi:10.1007/978-3-540-73368-3_51.

Beyer, Dirk, et al. Invariant Synthesis for Combined Theories. Vol. 4349, Springer, 2007, pp. 378–94, doi:10.1007/978-3-540-69738-1_27.

Beyer, Dirk, et al. Path Invariants. ACM, 2007, pp. 300–09, doi:10.1145/1250734.1250769.

Beyer, Dirk, et al. An Application of Web-Service Interfaces. IEEE, 2007, pp. 831–38, doi:10.1109/ICWS.2007.32 .

De Alfaro, Luca, et al. “Concurrent Reachability Games.”10.1016/j.tcs.2007.07.008__Theoretical Computer Science, vol. 386, no. 3, Elsevier, 2007, pp. 188–217, doi:10.1016/j.tcs.2007.07.008.

Hosten, Onur, and Paul Kwiat. Observing the Spin Hall Effect of Light via Quantum Weak Measurements. OSA, 2007, doi:10.1364/FIO.2007.JTuA4.