Prof. Shmuel Katz

Prof. Shmuel Katz

Contact information
Homepage:
http://www.cs.technion.ac.il/~katz/
Email:
katz[at]cs.technion.ac.il
Office:
635
Phone:
4322
Office Hours:
Tuesday, 9:30-10:30, room 37 מזכירות לימודי הסמכה; Monday, 11:00-12:00, room 635
Research interests
Program verification; Formal specification methods; Aspect-oriented software develompment; Distributed systems; Programming methodology; Temporal logic; Partial orders; Programming languages; Software engineering.
Selected publications

KATZ, S., and PELED, D., "Defining conditional independence using collapses", Theoretical Computer Science, Vol. 101, No. 2, pp. 337-359, 1992.

KATZ, S., and PELED, D., "Verification of distributed programs using representative interleaving sequences", Distributed Computing, Vol. 6, No. 2, pp. 107-120, 1992.

KATZ, S., "A superimposition control construct for distributed systems", ACM Trans. on Programming Languages and Systems, Vol. 15, No. 2, pp. 337-356, 1993.

KATZ, S., and PERRY, K., "Self-stabilizing extensions for message-passing systems", Distributed Computing, Vol. 7, No. 1, pp. 17-26, 1993.

HOWARD, J., and KATZ, S., "Reconciliations", Proceedings of Thirteenth ACM Symposium on Principles of Distributed Computing, 1994.

TAUBENFELD, G., KATZ, S., and MORAN, S., "Impossibility results in the presence of multiple faulty processes", Information and Computation, Vol. 113, No. 2, pp. 173-198, 1994.

KATZ, S., "Refinement with global equivalence proofs in temporal logic", Partial Order Methods in Verification, D. Peled, V. Pratt, and G. Holzmann, (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 29, AMS, pp. 59-78, 1996.

KATZ, S., LINCOLN, P., and RUSHBY, J., "Low-overhead time-triggered group membership", Proceedings of Workshop on Distributed Algorithms (WDAG), LNCS 1320, 1997.

MILLER, H., and KATZ, S., "Saving space by fully exploiting invisible transitions", Formal Methods in System Design, Vol. 14, pp. 311-332, 1999.

COLLIN, Z., DECHTER, R., and KATZ, S., "Self-stabilizing constraint satisfaction", Chicago Journal of Theoretical Computer Science, Vol. 5, 1999.

GLUSMAN, M., and KATZ, S., "Mechanizing proofs of computation equivalence", Proceedings of CAV-99 (Conference on Computer-Aided Verification), LNCS 1633, pp. 354-367, 1999.