Publications
A. Full Articles
1. S. Katz and Z. Manna, A closer look at termination, Acta Informatica, 5, December 1975, pp. 333-352.
2. S. Katz and Z. Manna, Logical analysis of programs, CACM, 19, 4, April 1976, pp. 188-206.
3. S. Katz, Program optimization using invariants, IEEE Transactions on Software Engineering, vol. SE-4, no. 5, September 1978, pp. 378-389.
4. S. Katz, L. Risman and M. Rodeh, A system for constructing linear programming models, IBM Systems Journal, vol. 19, no. 4, November 1980, pp. 505-520.
5. N. Francez, O. Grumberg, and S. Katz, A complete rule for equifair termination, Journal of Computer and System Sciences, vol. 33, December 1986, pp. 312-332.
6. S. Katz and O. Shmueli, A cooperative distributed algorithm for dynamic cycle prevention, IEEE Transactions on Software Engineering, vol. SE-13, no. 5, May 1987, pp. 540-552.
7. N. Francez and S. Katz, Fairness and the axioms of control predicates, International Journal of Parallel Programming, vol. 16, no. 4, August 1987, pp. 263-278.
8. O. Baruch and S. Katz, Partially interpreted schemas for CSP programming, The Science of Computer Programming, vol. 10, no. 1, February 1988, pp. 1-18.
9. K. Apt, N. Francez, and S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, vol. 2, no. 4, August 1988, pp. 226-241.
10. M. Evangelist, N. Francez, and S. Katz, Multiparty interactions for interprocess communication and synchronization, IEEE Transactions on Software Engineering, vol. 15, no. 11, November 1989, pp. 1417-1426.
11. G. Taubenfeld, S. Katz, and S. Moran, Initial failures in distributed computations, International Journal of Parallel Programming, vol. 18, no. 4, August 1989, pp. 255-276.
12. S. Katz and D. Peled, Interleaving set temporal logic, Theoretical Computer Science, vol. 75, October 1990, pp. 263-287.
13. G. Goldszmidt, S. Katz, and S. Yemini, High level language debugging for concurrent programs, ACM Transactions on Computer Systems, vol. 8, no. 4, November 1990, pp. 311-336.
14. S. Katz and D. Peled, Defining conditional independence using collapses, Theoretical Computer Science, vol. 101, no. 2, July 1992, pp. 337-359.
15. S. Katz and D. Peled, Verification of distributed programs using representative interleaving sequences, Distributed Computing, vol. 6, no. 2, September 1992, pp. 107-120.
16. S. Katz, A superimposition control construct for distributed systems, ACM Trans. on Programming Languages and Systems, vol. 15, no. 2, April 1993, pp. 337-356.
17. S. Katz and K. Perry, Self-stabilizing extensions for message-passing systems, Distributed Computing, vol. 7, no. 1, 1993, pp. 17-26.
18. G. Taubenfeld, S. Katz, and S. Moran, Impossibility results in the presence of multiple faulty processes, Information and Computation, vol. 113, no. 2, September 1994, pp. 173-198.
19. S. Katz and R. Zimmermann-Gal, An advisory system for developing data representations, accepted by Science of Computer Programming.
20. S. Katz, Refinement with global equivalence proofs in temporal logic, in Partial Order Methods in Temporal Logic (D. Peled, V. Pratt, G. Holzmann, eds.), DIMACS Series in Descrete Mathematics and Theoretical Computer Science, vol. 29, AMS, 1996, pp. 59-78.
21. H. Miller and S. Katz, Saving space by fully exploiting invisible transitions, Formal Methods in System Design, vol. 14, 1999, pp. 311-332.
22. Z. Collin, R. Dechter, and S. Katz, Self-stabilizing constraint satisfaction, Chicago Journal of Theoretical Computer Science, vol. 5, 1999.
23. I. Reinhartz-Berger, D, Dori, and S. Katz, OPM/Web-Object-Process Methodology for developing Web applications, The Annals of Software Engineering, vol. 13, 2002, pp. 141-161.
24. M. Glusman and S. Katz, A mechanized proof environment for the convenient computations proof method, Formal Methods in System Design, vol. 25, 2003, pp. 115-142.
25. M. Sihman and S. Katz, Superimposition and aspect-oriented programming, BCS Computer Journal, vol. 46, 2003, pp.529-541.
26. I. Reinhartz-Berger, D. Dori, and S. Katz, Modeling code mobility and migration: an OPM/Web approach, to appear in International Journal on Web Engineering Technology (IJWET).
B. Articles in Refereed Conference Proceedings
1. S. Katz and Z. Manna, A heuristic approach to program verification, Proceedings of Third International Conference on Artificial Intelligence, Stanford, August 1973, pp. 500-512.
2. S. Katz and Z. Manna, Towards automatic debugging of programs, Proceedings of International Conference on Reliable Software, Sigplan Notices, June 1975, pp. 143-155.
3. S. Katz, Program optimization using invariants, Proceedings of Conference of the ECI, Lecture Notes in Computer Science, Vol. 44, Springer-Verlag, K. Samuelson, ed., August 1976, pp. 287-309, (a preliminary version of A.3 above).
4. S. Rosenschein and S. Katz, Selection of representations for data structures, Proceedings of a Symposium on Artificial Intelligence and Programming Languages, Sigplan Notices, Vol. 12, No. 8, August 1977, pp. 147-154.
5. S. Katz and R. Zimmerman, An advisory system for developing data representations, Proceedings of IJCAI, Vancouver, Canada, August 1981, (a preliminary version of A.19 above).
6. N. Francez, O. Grumberg and S. Katz, A complete proof rule for equifair termination, Proceedings of Second Workshop on Logics of Programs, Carnegie-Mellon University, Lecture Notes in Computer Science, no. 164 (E. Clarke, D. Kozen, eds.), Springer-Verlag, 1983.
7. N. Francez, O. Grumberg, and S. Katz, Fair termination of communicating processes, Proceedings of Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1984, pp. 254-265.
8. N. Francez, O. Grumberg, S. Katz and A. Pnueli, Proving termination of PROLOG programs, Proceedings of Third Workshop on Logics of Programs, Brooklyn, New York, Lecture Notes in Computer Science, no. 193 (R. Parikh, ed.), Springer-Verlag, 1985.
9. S. Katz and G. Taubenfeld, What processes know: definitions and proof methods, Proceedings of Fifth Annual ACM Symposium on Principles of Distributed Computing, Calgary, Canada, August 1986.
10. K. Apt, N. Francez, and S. Katz, Appraising fairness in languages for distributed programming, Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages, Munich, West Germany, January 1987 (a preliminary version of A.9 above).
11. S. Katz, C. Richter, and K.S. The, PARIS: a system for reusing partially interpreted schemas, Proceedings of the Ninth International Conference on Software Engineering, Monterey, California, April 1987.
12. S. Katz and D. Peled, Interleaving set temporal logic, Proceedings of Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August, 1987.
13. S. Katz and D. Peled, An efficient verification method for parallel and distributed programs, Proceedings of Workshop on Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Computer Science, no. 354 (J.W. de Bakker, W.P. de Roever, G. Rozenburg, eds.), Springer-Verlag, June 1988.
14. S. Katz, I. Forman, and M. Evangelist, Language constructs for distributed systems, in Programming Concepts and Methods (Proceedings of IFIP TC2 Working Conference, Sea of Gallilee, Israel, April, 1990), M. Broy and C.B. Jones, eds., North-Holland.
15. S. Katz and D. Peled, Defining conditional independence using collapses, Proceedings of International Workshop on Semantics of Concurrency, Leicester, England, July 1990.
16. S. Katz and K. Perry, Self-stabilizing extensions for message-passing systems, Proceedings of 9th ACM Symposium on Principles of Distributed Computing, Quebec, Canada, August 1990.
17. D. Peled, S. Katz, and A. Pnueli, Specification and verification of serializability in temporal logic, Proceedings of 6th IEEE Symposium on Logic in Computer Science, Amsterdam, Holland, July 1991.
18. Z. Collin, R. Dechter, and S. Katz, On the feasibility of distributed constraint satisfaction, Proceedings of 12th International Joint Conference on Artificial Intelligence (IJCAI-91), Sydney, Australia, August 1991.
19. S. Katz, Global equivalence proofs in ISTL, Proceedings of International Conference on Temporal Logic, Bonn, Germany, July 1994.
20. J. Howard and S. Katz, Reconciliations, Proceedings of Thirteenth ACM Symposium on Principles of Distributed Computing, Los Angeles, August 1994.
21. A. Adir, N. Francez, and S. Katz, Implementing a language for coordinated distributed computing on a transputer multiprocessor, Proceedings of World Transputer Congress '94, IOS Press, Como, Italy, September 1994.
22. S. Katz and H. Miller, Saving space by fully exploiting invisible transitions, Proceedings of CAV-96 (Conference on Computer-Aided Verification), LNCS, July 1996.
23. S. Katz, P. Lincoln, and J. Rushby, Low-overhead time-triggered group membership, Proceedings of Workshop on Distributed Algorithms (WDAG), LNCS 1320, 1997.
24. M. Glusman and S. Katz, Mechanizing proofs of computation equivalence, Proceedings of Conference on Computer-Aided Verification (CAV-99), LNCS 1633, 1999, pp. 354-367.
25. S. Katz, Faithful translations among models and specifications, Proceedings of FME-2001(Formal methods--Europe), LNCS 2021, 2001, pp. 419-434.
26. M. Glusman and S. Katz, Extending memory consistency of finite prefixes to infinite computations, CONCUR-2001(International Conference on Concurrency Theory), LNCS 2154, 2001, pp. 411-425.
27. M. Sihman and S. Katz, A calculus of superimpositions for distributed systems, Proceedings of AOSD-2002 (International Conference on Aspect-Oriented Software Development), ACM Press, April, 2002, pp. 28-41.
28. K. Korenblat, O. Grumberg, and S. Katz, Translations between textual transition systems and Petri nets, Proceedings of IFM2002 (International Conference on Integrated Formal Methods), LNCS 2335, May 2002, pp. 339-359.
29. S. Katz and O. Grumberg, A framework for translating models and specifications, Proceedings of IFM2002 (International Conference on Integrated Formal Methods), LNCS 2335, May 2002, pp. 145-164.
30. I. Reinhartz-Berger, D. Dori, and S. Katz, Open reuse of component designs in OPM/Web, Proceedings of Compsac2002, IEEE Computer Society, August 2002, pp. 19-24.
31. M. Katara and S. Katz, Architectural views of aspects, Proceedings of AOSD-2003 (International Conference on Aspect-Oriented Software Design), March 2003, pp. 1-10.
32. M. Sihman and S. Katz, Model checking applications of aspects and superimpositions, proceedings of FOAL Workshop (Foundations of Aspect-Oriented Languages), March 2003.
C. Chapters or Sections in Books
1. S. Katz and Z. Manna, A closer look at termination, in Current Trends in Programming Methodology: Vol. II, Program Validation, R. Yeh, ed., Prentice-Hall, 1977, pp. 248-268.
2. S. Katz and Z. Manna, Logical analysis of programs, in Studies in Automatic Programming Logic, edited by Z. Manna and R. Waldinger, North-Holland, 1978, pp. 93-140.
3. S. Katz, C. Richter, and K.C. The, PARIS: a system for reusing partially interpreted schemas, in Software Reusability, Volume I: Concepts and Models, T. Biggerstaff and A.J. Perlis, eds., ACM Press (Addison-Wesley), 1989, pp. 257-273.
4. S. Katz, Exploiting independence for verification, refinement, and modularity, in Models, Algebras, and Logic of Engineering Software, ISO publishers, to appear, 2003.
5. S. Katz, On translating models and properties, in Models, Algebras, and Logic of Engineering Software, ISO publishers, to appear, 2003.