Barton NH. 1998. The geometry of adaptation. Nature. 395(6704), 751–752.

Barton NH. 1998. Genetics and analysis of quantitative traits. Genetical Research. 72(1), 73–73.

Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. 1998. An algorithm for the approximative analysis of rectangular automata. Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS, vol. 1486, 228–240.

Raskin J, Schobbens P, Henzinger TA. 1998. Axioms for real-time logics. Proceedings of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1466, 219–236.

Henzinger TA, Rusu V. 1998. Reachability verification for hybrid automata. Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 1386, 190–204.

Henzinger TA ed. 1998. HSCC: Hybrid Systems—Computation and Control, Springer,p.

Henzinger TA, Qadeer S, Rajamani S, Tasiran S. 1998. An assume-guarantee rule for checking simulation. Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, LNCS, vol. 1522, 421–432.

Henzinger TA, Raskin J, Schobbens P. 1998. The regular real-time languages. Proceedings of the 25th International Colloqium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 1443, 580–591.

Henzinger TA, Kupferman O, Qadeer S. 1998. From pre-historic to post-modern symbolic model checking. Proceedings of the 10th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 195–206.

Henzinger TA, Qadeer S, Rajamani S. 1998. You assume, we guarantee: Methodology and case studies. Proceedings of the 10th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 440–451.

Henzinger TA, Ho P, Wong Toi H. 1998. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control. 43(4), 540–554.

Henzinger TA, Kopke P, Puri A, Varaiya P. 1998. What’s decidable about hybrid automata? Journal of Computer and System Sciences. 57(1), 94–124.

Henzinger TA. 1998. It’s about time: Real-time logics reviewed. Proceedings of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1466, 439–454.

Alur R, Henzinger TA, Rajamani S. 1998. Symbolic exploration of transition hierarchies. Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 1384, 330–344.

Alur R, Henzinger TA, Kupferman O, Vardi M. 1998. Alternating refinement relations. Proceedings of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1466, 163–178.

Alur R, Henzinger TA, Mang F, Qadeer S, Rajamani S, Tasiran S. 1998. Mocha: Modularity in model checking. Proceedings of the 10th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 521–525.

De Alfaro L, Henzinger TA, Kupferman O. 1998. Concurrent reachability games.  Proceedings 39th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 564–575.

de Bono M, Bargmann CI. 1998. Natural variation in a neuropeptide Y receptor homolog modifies social behavior and food response in C. elegans. Cell. 94(5), 679–689.