‣Sekerinski, E., and Zhang, T. Verification Rules for Exception Handling in Eiffel. In Formal Methods: Foundations and Applications (2012), R. Gheyi and D. Naumann, Eds., vol. 7498 of Lecture Notes in Computer Science, Springer, pp. 179–193.

‣Sekerinski, E., and Zhang, T. Partial correctness for exception handling. In Logical Aspects of Fault Tolerance (2011), B. Bonakdarpour and T. Maibaum, Eds., in print.

‣Sekerinski, E. Exceptions for dependability. In Dependability and Computer Engineering: Concepts for Software-Intensive Systems—a Handbook on Dependability Research, L. Petre, K. Sere, and E. Troubitsyna, Eds. IGI Global, 2011.

‣Nokovic, B., and Sekerinski, E. Analysis of Interrogator-tag Communication Protocols. SQRL Report 60, McMaster University, November 2010.

‣Sekerinski, E. Design verification with state invariants. In UML 2 Semantics and Applications, K. Lano, Ed. John Wiley & Sons, October 2009, pp. 317–347.

‣Sekerinski, E., and Zhang, T. Finitary fairness in Event-B (extended abstract). In Dagstuhl Seminar on Refinement Based Methods for the Construction of Dependable Systems (Dagstuhl, Germany, September 2009), J.-R. Abrial, M. Butler, R. Joshi, E. Troubitsyna, and J. C. P. Woodcock, Eds., 5 pages, Leibniz-Zentrum für Informatik, Germany.

‣Cui, X.-l., and Sekerinski, E. An experimental implementation of action-based concurrency. SQRL Report 58, McMaster University, Hamilton, Ontario, Canada, July 2009.

‣Sekerinski, E. Teaching the unifying mathematics of software design. In WCCCE ’09: Proceedings of the 14th Western Canadian Conference on Computing Education (Burnaby, British Columbia, Canada, May 2009), R. Brouwer, D. Cukierman, and G. Tsiknis, Eds., ACM, pp. 109–115.

‣Sekerinski, E. An algebraic approach to refinement with fair choice. Electronic Notes in Theoretical Computer Science 214 (June 2008), 51–79.

‣Sekerinski, E. Verifying statecharts with state invariants. In ICECCS ’08—13th IEEE International Conference on Engineering of Complex Computer Systems (Belfast, Northern Ireland, March 2008), K. Breitman, J. Woodcock, R. Sterritt, and M. Hinchey, Eds., IEEE Computer Society, pp. 7–14.

‣Sekerinski, E. Teaching the mathematics of software design. SQRL Report 49, McMaster University, Hamilton, Ontario, Canada, December 2007.

‣Sekerinski, E., and Zingaro, D. Pascal0 Compiler. Unpublished, McMaster University, Department of Computing and Software, 2007.

‣Le, D. T. M., Sekerinski, E., and West, S. Statechart verification with iState. In FM 2006: Formal Methods–Posters and Research Tools (Hamilton, Ontario, Canada, August 2006), M. Chechik, Ed., p. 6.

‣Misra, J., Nipkow, T., and Sekerinski, E., Eds. FM 2006: Formal Methods–14th International Symposium on Formal Methods (Hamilton, Ontario, Canada, August 2006), vol. 4085 of Lecture Notes in Computer Science, Springer.

‣Sekerinski, E. Teaching the mathematics of software design. In Formal Methods in the Teaching Lab, Workshop at FM 2006: Formal Methods Symposium (August 2006), R. T. Boute and J. N. Oliveira, Eds., pp. 53–58.

‣Sekerinski, E., Ed. Topics in Software Design. Volume 2 (June 2006), SQRL Report 35, McMaster University.

‣Sekerinski, E., Ed. Topics in Software Design. Volume 1 (June 2005), SQRL Report 34, McMaster University.

‣Sekerinski, E. Verification and refinement with fine-grained action-based concurrent objects. Theoretical Computer Science 331, 2–3 (February 2005), 429–455.

‣Liang, J. and Sekerinski, E. Integrating Specification and Documentation in an Object-Oriented language. In SAVCBS 2004, Specification and Verification of Component-Based Systems, Workshop of SIGSOFT 2004/FSE-12, 12th ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 126–129, Newport Beach, California, USA, November 2004.

‣Sekerinski, E. Exploring Tabular Verification and Refinement. Formal Aspects of Computing, 15(2):215–236, 2003.

‣Sekerinski, E. Concurrent object-oriented programs: from specification to code. In Formal Methods for Components and Objects, First International Symposium, FMCO 02 (Leiden, The Netherlands, 2003), F. S. d. Boer, M. Bonsangue, S. Graf, and W.-P. d. Roever, Eds., vol. 2852 of Lecture Notes in Computer Science, Springer-Verlag, pp. 403–423.

‣Sekerinski, E., and Zurob, R. Translating statecharts to B. In Third International Conference on Integrated Formal Methods (Turku, Finland, 2002), M. Butler, L. Petre, and K. Sere, Eds., vol. 2335 of Lecture Notes in Computer Science, Springer-Verlag, pp. 128–144.

‣Sekerinski, E., and Zurob, R. iState: A statechart translator. In UML 2001 – The Unified Modeling Language, 4th International Conference (Toronto, Canada, 2001), M. Gogolla and C. Kobryn, Eds., vol. 2185 of Lecture Notes in Computer Science, Springer-Verlag, pp. 376–390.

‣Sekerinski, E., and Zurob, R. From Statecharts to Code: A tool for the Graphical Design of Reactive Systems. Unpublished, McMaster University, 2001.

‣Janicki, R., and Sekerinski, E. Foundations of the trace assertion method of module interface specification. IEEE Transactions on Software Engineering 27 (July 2001), 577–598.

‣Büchi, M., and Sekerinski, E. A Foundation for Refining Concurrent Object. Fundamenta Informaticae 44, 1,2 (2000), 25–61.

‣Sekerinski, E. On Guarded Commands with Fair Choice. In R. Backhouse and J. Oliveira, editors, 5th International Conference on the Mathematics of Program Construction, MPC 2000, volume 1837 of Lecture Notes in Computer Science, pages 127–139, Ponte de Lima, Portugal, 2000. Springer-Verlag.

‣Mikhajlov, L., Sekerinski, E., and Laibinis, L. Developing Components in Presence of Re-entrance. In J. Wing, J. Woodcock, and J. Davis, editors, FM’99 — Formal Methods, volume 1709 of Lecture Notes in Computer Science, pages 721–721, Toulouse, France, 1999. Springer-Verlag.

‣Mikhajlova, A. and Sekerinski, E. Ensuring Correctness of Java Frameworks: A Formal Look at JCF. Technical Report 250, TUCS, March 1999.

‣Mikhajlov, L. and Sekerinski, E. A Study of the Fragile Base Class Problem. In E. Jul, editor, ECOOP’98 — 12th European Conference on Object-Oriented Programming, volume 1709 of Lecture Notes in Computer Science, pages 721–721, Toulouse, France, 1999. Springer-Verlag.

‣Sekerinski, E.. Production Cell. In E. Sekerinski and K. Sere, editors, Program Development by Stepwise Refinement: Case Studies Using the B Method, Formal Approaches to Computing and Information Technology Series, pages 193–252. Springer-Verlag, 1998.

‣Sekerinski, E. and Sere, K., editors. Prorgram Development by Stepwise Refinement: Case Studies Using the B Method. Formal Approaches to Computing and Information Technology. Springer-Verlag, 1998.

‣Mikhajlova, A. and Sekerinski, E. Class Refinement and Interface Refinement in Object-Oriented Programs. In J. Fitzgerald, C. Jones, and P, Lucas, editors, FME ’97: Industrial Applications and Strengthened Foundations of Formal Methods, volume 1313 of Lecture Notes in Computer Science, pages 82–101, Graz, Austria, 1997. Springer-Verlag.

‣Sekerinski, E. and Sere, K. A Theory of Prioritising Composition. The Computer Journal, 39(8):701–712, 1996.

‣Butler, M., Sekerinski, E., and Sere, K. An Action System Approach to the Steam Boiler Problem. In J.-R. Abrial, E. Börger, and H. Langmaack, editors, Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, volume 1165 of Lecture Notes in Computer Science, pages 129–148. Springer-Verlag, 1996.

‣Rönkkö, M., Sekerinski, E., and Sere, K. Control Systems as Action Systems. In R. Smedinga, M.P. Spathopoulos, and P. Kozák, editors, WODES 96 – Workshop on Discrete Event Systems, pages 362–367, Edinburgh, 1996. IEEE Press.

‣Sekerinski, E. A Type-Theoretic Basis for an Object-Oriented Refinement Calculus. In S. J. Goldsack and S. J. H. Kent, editors, Formal Methods and Object Technology, pages 317–335. Springer-Verlag, 1996.

‣Sekerinski, E. Deriving Control Programs by Weakest Preconditions. Technical Report 4, TUCS, April 1996.