Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

9198 Publications


1998 |Published| Conference (Editor) | IST-REx-ID: 4430
HSCC: Hybrid Systems—Computation and Control
T.A. Henzinger, ed., HSCC: Hybrid Systems—Computation and Control, Springer, 1998.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4486
An assume-guarantee rule for checking simulation
T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Springer, 1998, pp. 421–432.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4490
The regular real-time languages
T.A. Henzinger, J. Raskin, P. Schobbens, in:, Proceedings of the 25th International Colloqium on Automata, Languages and Programming, Springer, 1998, pp. 580–591.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4489
From pre-historic to post-modern symbolic model checking
T.A. Henzinger, O. Kupferman, S. Qadeer, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 195–206.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4488
You assume, we guarantee: Methodology and case studies
T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 440–451.
View | DOI
 

1998 |Published| Journal Article | IST-REx-ID: 4491
Algorithmic analysis of nonlinear hybrid systems
T.A. Henzinger, P. Ho, H. Wong Toi, IEEE Transactions on Automatic Control 43 (1998) 540–554.
View | DOI
 

1998 |Published| Journal Article | IST-REx-ID: 4492 | OA
What's decidable about hybrid automata?
T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, Journal of Computer and System Sciences 57 (1998) 94–124.
[Published Version] View | DOI | Download Published Version (ext.)
 

1998 |Published| Conference Paper | IST-REx-ID: 4515
It's about time: Real-time logics reviewed
T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–454.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4606
Symbolic exploration of transition hierarchies
R. Alur, T.A. Henzinger, S. Rajamani, in:, Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1998, pp. 330–344.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4603
Alternating refinement relations
R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–178.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4604
Mocha: Modularity in model checking
R. Alur, T.A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 521–525.
View | DOI
 

1998 |Published| Conference Paper | IST-REx-ID: 4639
Concurrent reachability games
L. De Alfaro, T.A. Henzinger, O. Kupferman, in:, Proceedings 39th Annual Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–575.
View | DOI
 

1998 |Published| Journal Article | IST-REx-ID: 6160 View | DOI | PubMed | Europe PMC
 

1997 |Published| Journal Article | IST-REx-ID: 11666
Continuous profiling: Where have all the cycles gone?
J.M. Anderson, L.M. Berc, J. Dean, S. Ghemawat, M.H. Henzinger, S.-T.A. Leung, R.L. Sites, M.T. Vandevoorde, C.A. Waldspurger, W.E. Weihl, ACM Transactions on Computer Systems 15 (1997) 357–390.
View | DOI
 

1997 |Published| Journal Article | IST-REx-ID: 11767 | OA
Faster shortest-path algorithms for planar graphs
M.H. Henzinger, P. Klein, S. Rao, S. Subramanian, Journal of Computer and System Sciences 55 (1997) 3–23.
[Published Version] View | DOI | Download Published Version (ext.)
 

1997 |Published| Journal Article | IST-REx-ID: 11765 View | DOI
 

1997 |Published| Conference Paper | IST-REx-ID: 11803
Maintaining minimum spanning trees in dynamic graphs
M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.
View | DOI
 

1997 |Published| Journal Article | IST-REx-ID: 11849 | OA
Continuous profiling: Where have all the cycles gone?
J.M. Anderson, L.M. Berc, J. Dean, S. Ghemawat, M.H. Henzinger, S.-T.A. Leung, R.L. Sites, M.T. Vandevoorde, C.A. Waldspurger, W.E. Weihl, ACM SIGOPS Operating Systems Review 31 (1997) 1–14.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

1997 |Published| Journal Article | IST-REx-ID: 11883
Sampling to provide or to bound: With applications to fully dynamic graph algorithms
M.H. Henzinger, M. Thorup, Random Structures and Algorithms 11 (1997) 369–379.
View | DOI
 

1997 |Published| Journal Article | IST-REx-ID: 2493
Immunostaining for substance P receptor labels GABAergic cells with distinct termination patterns in the hippocampus
L. Acsády, I. Katona, A. Gulyás, R. Shigemoto, T. Freund, Journal of Comparative Neurology 378 (1997) 320–336.
View | DOI | PubMed | Europe PMC
 

Search

Filter Publications