This page describes my teaching duty and research effort in Dept. of
Information Management, National Taiwan University.
Last modified on February 28, 2002 (looks better in the usual Western
encoding.)
Teaching
During 2001-2002, I will be teaching the following courses:
- Information
Security (course info., slides, old exams, etc.)
- Distributed
Information Systems
- E-Commerce
Technologies
- Algorithms
- Theory
of Computation
If there is enough demand, I can also offer any of these elective courses:
Software
Specification and Verification , Automated
Verification , and Distributed
Algorithms .
Research
My research interests include Formal Methods, Distributed Algorithms, and
Distributed Systems. Below is a list of my recent publications. On-line
access is not provided due to copyright concerns; reprints available upon
request.
- An Algorithm with Optimal Failure Locality for the Dining Philosophers
Problem
Y.-K. Tsay and R.L. Bagrodia
Proceedings of the 8th
International Workshop on Distributed Algorithms, LNCS 857, 296--310,
September 1994.
- Deducing Fairness Properties in UNITY Logic --- A New Completeness
Result
Y.-K. Tsay and R.L. Bagrodia
ACM Transactions on
Programming Languages and Systems, Vol. 17, No. 1, 16--27, January 1995.
- Assumption/Guarantee Specifications in Linear-Time Temporal Logic
B. Jonsson and Y.-K. Tsay
Theoretical Computer Science, Vol.
167, 47--72, October 1996. An extended abstract appeared in Proceedings of
the 6th International Joint Conference on the Theory and Practice of Software
Development (TAPSOFT), LNCS 915, 262--276, May 1995.
- General Decidability Theorems for Infinite-State Systems
P.A.
Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay
Proceedings of the 11th
IEEE Symposium on Logic in Computer Science (LICS), 313--321, July 1996.
- Deriving a Scalable Algorithm for Mutual Exclusion
Y.-K. Tsay
Proceedings of the 12th International Symposium on Distributed
Computing (DISC), LNCS 1499, 393--407, September 1998.
- Compositional Verification in Linear-Time Temporal Logic
Y.-K.
Tsay
Proceedings of the Conference on Foundations of Software Science
and Computation Structures, LNCS 1784, 344--358, March 2000.
- Algorithmic Analysis of Programs with Well Quasi-Ordered Domains
P.A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay
Information and
Computation, Vol. 160, No. 1/2, 109--127, August 2000.
If you have any questions or requests, please send email to tsay@im.ntu.edu.tw.
BTW, here is My
Map of the Web.