best viewed at 1024x768px

Main Content

2011

2010


2009


2008


2007


2006


2005

  • Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Permissive interfaces. Proceedings of the 13th Annual Symposium on Foundations of Software Engineering (FSE), ACM Press, 2005, pp. 31-40.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Counterexample-guided planning. Proceedings of the 21st International Conference on Uncertainty in Artificial Intelligence (UAI), AUAI Press, 2005, pp. 104-111.

  • Thomas A. Henzinger, Rupak Majumdar, and Vinayak Prabhu. Quantifying similarities between timed systems. Proceedings of the Third International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Lecture Notes in Computer Science 3829, Springer, 2005, pp. 226-241.

  • Laurent Doyen, Thomas A. Henzinger, and Jean-Francois Raskin. Automatic rectangular refinement of affine hybrid systems. Proceedings of the Third International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Lecture Notes in Computer Science 3829, Springer, 2005, pp. 144-161.

  • Luca de Alfaro and Thomas A. Henzinger. Interface-based design. In Engineering Theories of Software-intensive Systems (M. Broy, J. Gruenbauer, D. Harel, and C.A.R. Hoare, eds.), NATO Science Series: Mathematics, Physics, and Chemistry, Vol. 195, Springer, 2005, pp. 83-104.

  • Thomas A. Henzinger, Christoph M. Kirsch, and Slobodan Matic. Composable code generation for distributed Giotto. Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), ACM Press, 2005, pp. 21-30.

  • Slobodan Matic and Thomas A. Henzinger. Trading end-to-end latency for composability. Proceedings of the 26th Annual Real-Time Systems Symposium (RTSS), IEEE Computer Society Press, 2005, pp. 99-110.

  • Christoph M. Kirsch, Marco A.A. Sanvido, and Thomas A. Henzinger. A programmable microkernel for real-time systems. Proceedings of the First International Conference on Virtual Execution Environments (VEE), ACM Press, 2005, pp. 35-45.

  • Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. The complexity of stochastic Rabin and Streett games. Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 3580, Springer, 2005, pp. 878-890.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski. Mean-payoff parity games. Proceedings of the 20th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 2005, pp. 178-187.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Semiperfect-information games. Proceedings of the 26th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Computer Science 3821, Springer, 2005, pp. 1-18.

  • Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Checking memory safety with Blast. Proceedings of the International Conference on Fundamental Approaches to Software Engineering (FASE), Lecture Notes in Computer Science 3442, Springer, 2005, pp. 2-18.

  • Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, and Rupak Majumdar. Verifying quantitative properties using bound functions. Proceedings of the 13th International Conference on Correct Hardware Design and Verification Methods (CHARME), Lecture Notes in Computer Science 3725, Springer, 2005, pp. 50-64.

  • Dirk Beyer, Arindam Chakrabarti, and Thomas A. Henzinger. Web service interfaces. Proceedings of the 14th International Word-Wide Web Conference (WWW), 2005, pp. 148-159.

  • Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Marielle Stoelinga. Model checking discounted temporal properties. Theoretical Computer Science 345:139-170, 2005.

  • Thomas A. Henzinger, Rupak Majumdar, and Jean-Francois Raskin. A classification of symbolic transition systems. ACM Transactions on Computational Logic 6:1-32, 2005.

2004

  • Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. Trading memory for randomness. Proceedings of the First Annual Conference on Quantitative Evaluation of Systems (QEST), IEEE Computer Society Press, 2004, pp. 206-217.

  • Thomas A. Henzinger and Christoph M. Kirsch. A typed assembly language for real-time programs. Proceedings of the Fourth Annual Conference on Embedded Software (EMSOFT), ACM Press, 2004, pp. 104-113.

  • Dirk Beyer, Adam J. Chlipala, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. The Blast query language for software verification. Proceedings of the 11th International Static Analysis Symposium (SAS), Lecture Notes in Computer Science 3148, Springer, 2004, pp. 2-18.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski. Games with secure equilibria. Proceedings of the 19th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 2004, pp. 160-169.

  • Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Race checking by context inference. Proceedings of the International Conference on Programming Language Design and Implementation (PLDI), ACM Press, 2004, pp. 1-13.

  • Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. An Eclipse plugin for model checking. Proceedings of the 12th International Workshop on Program Comprehension (IWPC), IEEE Computer Society Press, 2004, pp. 251-257.

  • Dirk Beyer, Adam J. Chlipala, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Generating tests from counterexamples. Proceedings of the 26th Annual International Conference on Software Engineering (ICSE), IEEE Computer Society Press, 2004, pp. 326-335.

  • Arkadeb Ghosal, Thomas A. Henzinger, Christoph M. Kirsch, and Marco A.A. Sanvido. Event-driven programming with logical execution times. Proceedings of the Seventh International Workshop on Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science 2993, Springer, 2004, pp. 357-371.

  • Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Marielle Stoelinga. Model checking discounted temporal properties. Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 2988, Springer, 2004, pp. 77-92.

  • Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Kenneth L. McMillan. Abstractions from proofs. Proceedings of the 31st Annual Symposium on Principles of Programming Languages (POPL), ACM Press, 2004, pp. 232-244.

  • Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Marco A.A. Sanvido. Extreme model checking. In Verification: Theory and Practice, Lecture Notes in Computer Science 2772, Springer, 2004, pp. 332-358.

  • Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, and Jens Palsberg. Stack size analysis for interrupt-driven programs. Information and Computation 194:144-174, 2004.

  • Krishnendu Chatterjee, Marcin Jurdzinski, and Thomas A. Henzinger. Quantitative stochastic parity games. Proceedings of the 15th Annual Symposium on Discrete Algorithms (SODA), ACM Press, 2004, pp. 114-123.

2003

  • Thomas A. Henzinger, Christoph M. Kirsch, and Slobodan Matic. Schedule carrying code. Proceedings of the Third Annual Conference on Embedded Software (EMSOFT), Lecture Notes in Computer Science 2855, Springer, 2003, pp. 241-256.

  • Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, and Marielle Stoelinga. Resource interfaces. Proceedings of the Third Annual Conference on Embedded Software (EMSOFT), Lecture Notes in Computer Science 2855, Springer, 2003, pp. 117-133.

  • Krishnendu Chatterjee, Marcin Jurdzinski, and Thomas A. Henzinger. Simple stochastic parity games. Proceedings of the International Conference for Computer Science Logic (CSL), Lecture Notes in Computer Science 2803, Springer, 2003, pp. 100-113.

  • Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Marielle Stoelinga. The element of surprise in timed games. Proceedings of the 14th International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 2761, Springer, 2003, pp. 144-158.

  • Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Shaz Qadeer. Thread-modular abstraction refinement. Proceedings of the 15th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 2725, Springer, 2003, pp. 262-274.

  • Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Counterexample-guided control. Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 2719, Springer, 2003, pp. 886-902.

  • Luca de Alfaro, Thomas A. Henzinger, and Rupak Majumdar. Discounting the future in systems theory. Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 2719, Springer, 2003, pp. 1022-1037.

  • Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, and Jens Palsberg. Stack size analysis for interrupt-driven programs. Proceedings of the Tenth International Static Analysis Symposium (SAS), Lecture Notes in Computer Science 2694, Springer, 2003, pp. 109-126.

  • Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Gregoire Sutre. Software verification with Blast. Proceedings of the Tenth International Workshop on Model Checking of Software (SPIN), Lecture Notes in Computer Science 2648, Springer, 2003, pp. 235-239.

  • Thomas A. Henzinger, Benjamin Horowitz, and Christoph M. Kirsch. Embedded control systems development with Giotto. In Software-Enabled Control: Information Technology for Dynamical Systems (T. Samad, G. Balas, eds.), IEEE Press and Wiley-Interscience, 2003, pp. 123-146.

  • Thomas A. Henzinger, Benjamin Horowitz, and Christoph M. Kirsch. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE 91:84-99, 2003.

  • Thomas A. Henzinger, Christoph M. Kirsch, Marco A.A. Sanvido, and Wolfgang Pree. From control models to real-time code using Giotto. IEEE Control Systems Magazine 23(1):50-64, 2003.

  • Thomas A. Henzinger, Orna Kupferman, and Rupak Majumdar. On the universal and existential fragments of the mu-calculus. Proceedings of the Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 2619, Springer, 2003, pp. 49-64.

  • Thomas A. Henzinger, Orna Kupferman, and Shaz Qadeer. From prehistoric to postmodern symbolic model checking. Formal Methods in System Design 23:303-327, 2003.

2002

  • Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. Journal of the ACM 49:672-713, 2002.

  • Franck Cassez, Thomas A. Henzinger, and Jean-Francois Raskin. A comparison of control problems for timed and hybrid systems. Proceedings of the Fifth International Workshop on Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science 2289, Springer, 2002, pp. 134-148.

  • Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, Marcin Jurdzinski, and Freddy Y.C. Mang. Interface compatibility checking for software modules. Proceedings of the 14th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 2404, Springer, 2002, pp. 428-441.

  • Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, and Freddy Y.C. Mang. Synchronous and bidirectional component interfaces. Proceedings of the 14th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 2404, Springer, 2002, pp. 414-427.

  • Luca de Alfaro, Thomas A. Henzinger, and Marielle Stoelinga. Timed interfaces. Proceedings of the Second International Workshop on Embedded Software (EMSOFT), Lecture Notes in Computer Science 2491, Springer, 2002, pp. 108-122.

  • Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, George C. Necula, Gregoire Sutre, and Westley Weimer. Temporal safety proofs for systems code. Proceedings of the 14th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 2404, Springer, 2002, pp. 526-538.

  • Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Gregoire Sutre. Lazy abstraction. Proceedings of the 29th Annual Symposium on Principles of Programming Languages (POPL), ACM Press, 2002, pp. 58-70.

  • Thomas A. Henzinger and Christoph M. Kirsch. The Embedded Machine: Predictable, portable real-time code. Proceedings of the International Conference on Programming Language Design and Implementation (PLDI), ACM Press, 2002, pp. 315-326.

  • Thomas A. Henzinger, Christoph M. Kirsch, Rupak Majumdar, and Slobodan Matic. Time-safety checking for embedded programs. Proceedings of the Second International Workshop on Embedded Software (EMSOFT), Lecture Notes in Computer Science 2491, Springer, 2002, pp. 76-92.

  • Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, and Freddy Y.C. Mang. Synthesis of uninitialized systems. Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 2380, Springer, 2002, pp. 644-656.

  • Thomas A. Henzinger, Orna Kupferman, and Sriram K. Rajamani. Fair simulation. Information and Computation 173:64-81, 2002.

  • Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, and Serdar Tasiran. An assume-guarantee rule for checking simulation. ACM Transactions on Programming Languages and Systems 24:51-64, 2002.

  • Benjamin Horowitz, Judith Liebman, Cedric Ma, T. John Koo, Thomas A. Henzinger, Alberto Sangiovanni-Vincentelli, and Shankar Sastry. Embedded software design and system integration for rotorcraft UAV using platforms. Proceedings of the 15th IFAC World Congress on Automatic Control, Elsevier, 2002.

  • Marcin Jurdzinski, Orna Kupferman, and Thomas A. Henzinger. Trading probability for fairness. Proceedings of the International Conference for Computer Science Logic (CSL), Lecture Notes in Computer Science 2471, Springer, 2002, pp. 292-305.

  • Christoph M. Kirsch, Marco A.A. Sanvido, Thomas A. Henzinger, and Wolfgang Pree. A Giotto-based helicopter control system. Proceedings of the Second International Workshop on Embedded Software (EMSOFT), Lecture Notes in Computer Science 2491, Springer, 2002, pp. 46-60.

  • Roberto Passerone, Luca de Alfaro, Thomas A. Henzinger, and Alberto Sangiovanni-Vincentelli. Convertibility verification and converter synthesis: Two faces of the same coin. Proceedings of the International Conference on Computer-Aided Design (ICCAD), IEEE Computer Society Press, 2002, pp. 132-139.

  • Jean-Francois Raskin, Pierre-Yves Schobbens, and Thomas A. Henzinger. Axioms for real-time logics. Theoretical Computer Science 274:151-182, 2002.

2001


2000

  • Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere, and George J. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE 88:971-984, 2000.

  • Luca de Alfaro and Thomas A. Henzinger. Concurrent omega-regular games. Proceedings of the 15th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 2000, pp. 141-154.

  • Luca de Alfaro, Thomas A. Henzinger, and Freddy Y.C. Mang. Detecting errors before reaching them. Proceedings of the 12th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1855, Springer, 2000, pp. 186-201.

  • Luca de Alfaro, Thomas A. Henzinger, and Freddy Y.C. Mang. The control of synchronous systems. Proceedings of the 11th International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1877, Springer, 2000, pp. 458-473.

  • Thomas A. Henzinger. Masaccio: A formal model for embedded components. Proceedings of the First IFIP International Conference on Theoretical Computer Science (TCS), Lecture Notes in Computer Science 1872, Springer, 2000, pp. 549-563.

  • Thomas A. Henzinger. The theory of hybrid automata. In Verification of Digital and Hybrid Systems (M.K. Inan, R.P. Kurshan, eds.), NATO ASI Series F: Computer and Systems Sciences, Vol. 170, Springer, 2000, pp. 265-292.

  • Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar, and Howard Wong-Toi. Beyond HyTech: Hybrid systems analysis using interval numerical methods. Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science 1790, Springer, 2000, pp. 130-144.

  • Thomas A. Henzinger and Rupak Majumdar. A classification of symbolic transition systems. Proceedings of the 17th International Conference on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 1770, Springer, 2000, pp. 13-34.

  • Thomas A. Henzinger and Rupak Majumdar. Symbolic model checking for rectangular hybrid systems. Proceedings of the Sixth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 1785, Springer, 2000, pp. 142-156.

  • Thomas A. Henzinger, Rupak Majumdar, Freddy Y.C. Mang, and Jean-Francois Raskin. Abstract interpretation of game properties. Proceedings of the Seventh International Static Analysis Symposium (SAS), Lecture Notes in Computer Science 1824, Springer, 2000, pp. 220-239.

  • Thomas A. Henzinger, Shaz Qadeer, and Sriram K. Rajamani. Decomposing refinement proofs using assume-guarantee reasoning. Proceedings of the International Conference on Computer-Aided Design (ICCAD), IEEE Computer Society Press, 2000, pp. 245-252.

  • Thomas A. Henzinger and Sriram K. Rajamani. Fair bisimulation. Proceedings of the Sixth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 1785, Springer, 2000, pp. 299-314.

  • Thomas A. Henzinger and Jean-Francois Raskin. Robust undecidability of timed and hybrid systems. Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science 1790, Springer, 2000, pp. 145-159.

1999


1998

  • Rajeev Alur and Thomas A. Henzinger. Finitary fairness. ACM Transactions on Programming Languages and Systems 20:1171-1194, 1998.

  • Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. In Compositionality: The Significant Difference, Lecture Notes in Computer Science 1536, Springer, 1998, pp. 23-60.

  • Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, and Moshe Y. Vardi. Alternating refinement relations. Proceedings of the Ninth International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1466, Springer, 1998, pp. 163-178.

  • Rajeev Alur, Thomas A. Henzinger, Freddy Y.C. Mang, Shaz Qadeer, Sriram K. Rajamani, and Serdar Tasiran. Mocha: Modularity in model checking. Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1427, Springer, 1998, pp. 521-525.

  • Rajeev Alur, Thomas A. Henzinger, and Sriram K. Rajamani. Symbolic exploration of transition hierarchies. Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 1384, Springer, 1998, pp. 330-344.

  • Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent reachability games. Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1998, pp. 564-575.

  • Thomas A. Henzinger. It's about time: Real-time logics reviewed. Proceedings of the Ninth International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1466, Springer, 1998, pp. 439-454.

  • Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control 43:540-554, 1998.

  • Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences 57:94-124, 1998.

  • Thomas A. Henzinger, Orna Kupferman, and Shaz Qadeer. From prehistoric to postmodern symbolic model checking. Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1427, Springer, 1998, pp. 195-206.

  • Thomas A. Henzinger, Shaz Qadeer, and Sriram K. Rajamani. You assume, we guarantee: Methodology and case studies. Proceedings of the Tenth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1427, Springer, 1998, pp. 440-451.

  • Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, and Serdar Tasiran. An assume-guarantee rule for checking simulation. Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design (FMCAD), Lecture Notes in Computer Science 1522, Springer, 1998, pp. 421-432.

  • Thomas A. Henzinger, Jean-Francois Raskin, and Pierre-Yves Schobbens. The regular real-time languages. Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 1443, Springer, 1998, pp. 580-591.

  • Thomas A. Henzinger and Vlad Rusu. Reachability verification for hybrid automata. Proceedings of the First International Workshop on Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science 1386, Springer, 1998, pp. 190-204.

  • Joerg Preussig, Stephan Kowalewski, Howard Wong-Toi, and Thomas A. Henzinger. An algorithm for the approximative analysis of rectangular automata. Proceedings of the Fifth International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), Lecture Notes in Computer Science 1486, Springer, 1998, pp. 228-240.

  • Jean-Francois Raskin, Pierre-Yves Schobbens, and Thomas A. Henzinger. Axioms for real-time logics. Proceedings of the Ninth International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1466, Springer, 1998, pp. 219-236.

1997

  • Rajeev Alur, Robert K. Brayton, Thomas A. Henzinger, Shaz Qadeer, and Sriram K. Rajamani. Partial-order reduction in symbolic state-space exploration. Proceedings of the Ninth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1254, Springer, 1997, pp. 340-351.

  • Rajeev Alur, Costas Courcoubetis, and Thomas A. Henzinger. Computing accumulated delays in real-time systems. Formal Methods in System Design 11:137-156, 1997.

  • Rajeev Alur and Thomas A. Henzinger. Modularity for timed and hybrid systems. Proceedings of the Eighth International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1243, Springer, 1997, pp. 74-88.

  • Rajeev Alur and Thomas A. Henzinger. Real-time system = discrete system + clock variables. Software Tools for Technology Transfer 1:86-109, 1997.

  • Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1997, pp. 100-109.

  • Rajeev Alur, Thomas A. Henzinger, and Howard Wong-Toi. Symbolic analysis of hybrid systems. Proceedings of the 36th Annual Conference on Decision and Control (CDC), IEEE Press, 1997, pp. 702-707.

  • Vineet Gupta, Thomas A. Henzinger, and Radha Jagadeesan. Robust timed automata. Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART), Lecture Notes in Computer Science 1201, Springer, 1997, pp. 331-345.

  • Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. HyTech: A model checker for hybrid systems. Software Tools for Technology Transfer 1:110-122, 1997. A preliminary version appeared in the Proceedings of the Ninth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 1254, Springer, 1997, pp. 460-463.

  • Thomas A. Henzinger and Peter W. Kopke. Discrete-time control for rectangular hybrid automata. Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 1256, Springer, 1997, pp. 582-593.

  • Thomas A. Henzinger and Orna Kupferman. From quantity to quality. Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART), Lecture Notes in Computer Science 1201, Springer, 1997, pp. 48-62.

  • Thomas A. Henzinger, Orna Kupferman, and Sriram K. Rajamani. Fair simulation. Proceedings of the Ninth International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1243, Springer, 1997, pp. 273-287.

1996


1995

  • Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, Thomas A. Henzinger, Pei-Hsin Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138:3-34, 1995.

  • Rajeev Alur and Thomas A. Henzinger. Local liveness for compositional modeling of fair reactive systems. Proceedings of the Seventh International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 939, Springer, 1995, pp. 166-179.

  • Thomas A. Henzinger. Hybrid automata with finite bisimulations. Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 944, Springer, 1995, pp. 324-335.

  • Monika R. Henzinger, Thomas A. Henzinger, and Peter W. Kopke. Computing simulations on finite and infinite graphs. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1995, pp. 453-462.

  • Thomas A. Henzinger and Pei-Hsin Ho. Algorithmic analysis of nonlinear hybrid systems. Proceedings of the Seventh International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 939, Springer, 1995, pp. 225-238.

  • Thomas A. Henzinger and Pei-Hsin Ho. A note on abstract-interpretation strategies for hybrid automata. In Hybrid Systems II, Lecture Notes in Computer Science 999, Springer, 1995, pp. 252-264.

  • Thomas A. Henzinger and Pei-Hsin Ho. HyTech: The Cornell Hybrid Technology Tool. In Hybrid Systems II, Lecture Notes in Computer Science 999, Springer, 1995, pp. 265-294.

  • Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. A user guide to HyTech. Proceedings of the First International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science 1019, Springer, 1995, pp. 41-71.

  • Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi, HyTech: The next generation. Proceedings of the 16th Annual Real-Time Systems Symposium (RTSS), IEEE Computer Society Press, 1995, pp. 56-65.

  • Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's decidable about hybrid automata? Proceedings of the 27th Annual Symposium on Theory of Computing (STOC), ACM Press, 1995, pp. 373-382.

  • Thomas A. Henzinger, Peter W. Kopke, and Howard Wong-Toi. The expressive power of clocks. Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 944, Springer, 1995, pp. 417-428.

1994

  • Rajeev Alur, Costas Courcoubetis, and Thomas A. Henzinger. The observational power of clocks. Proceedings of the Fifth International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 836, Springer, 1994, pp. 162-177.

  • Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, Pei-Hsin Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine. The algorithmic analysis of hybrid systems. Proceedings of the 11th International Conference on Analysis and Optimization of Systems: Discrete-Event Systems (ICAOS), Lecture Notes in Control and Information Sciences 199, Springer, 1994, pp. 331-351.

  • Rajeev Alur, Limor Fix, and Thomas A. Henzinger. A determinizable class of timed automata. Proceedings of the Sixth International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science 818, Springer, 1994, pp. 1-13.

  • Rajeev Alur and Thomas A. Henzinger. A really temporal logic. Journal of the ACM 41:181-204, 1994.

  • Rajeev Alur and Thomas A. Henzinger. Finitary fairness. Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 1994, pp. 52-61.

  • Rajeev Alur and Thomas A. Henzinger. Real-time system = discrete system + clock variables. In Theories and Experiences for Real-Time System Development (T. Rus, C. Rattray, eds.), AMAST Series in Computing, Vol. 2, World Scientific, 1994, pp. 1-29.

  • Thomas A. Henzinger and Peter W. Kopke. Verification methods for the divergent runs of clock systems. Proceedings of the Third International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), Lecture Notes in Computer Science 863, Springer, 1994, pp. 351-372.

  • Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Temporal proof methodologies for timed transition systems. Information and Computation 112:273-337, 1994.

  • Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic model checking for real-time systems. Information and Computation 111:193-244, 1994.

  • Arjun Kapur, Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. Proving safety properties of hybrid systems. Proceedings of the Third International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), Lecture Notes in Computer Science 863, Springer, 1994, pp. 431-454.

1993


1992


1991


1990


1989

  • Rajeev Alur and Thomas A. Henzinger. A really temporal logic. Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1989, pp. 164-169.

Last updated in November 2008.