A CSC2108F Conference on Automated Verification
February 19, 2000
Final Program
The aim of this conference is to bring together students and faculty interested in application of formal methods to specification and verification of software systems.  The conference will consist of a series of presentations by students of CSC2108, Fall'99.  The presentations are based on projects that the students worked on between 12/1999-1/2000 either on their own or in groups of two.  Projects done by one person will be presented in 25 minutes followed by a 15-minute question period.  Two-person projects will be presented in 35 minutes followed by a 15-minute question period.  The program below gives the schedule of these talks and their abstracts.  Everyone is welcome to attend.  Proceedings of this conference will be published as a DCS technical report.
Conference Venue:  The conference will take place in PT266 (Pratt Bldg.) at the University of Toronto.

Program
9:30-9:45  Setup, coffee + donuts 
9:45-10:00  Introduction by Marsha Chechik, course instructor
10:00-10:40  William Andreopoulos, "Defining Formal Semantics for the Unified Modelling Language"
10:40-10:45  Break
10:45-11:35  Jeffrey Tang, Wei Zhou, TBA.
11:35-11:45  Break
11:45-12:25  Ariel Fuxman, "Software Architectures".
12:25-12:30  Break
12:30-1:10  Tsuyoshi Morioka, "Automatic Verification of Probabilistic Systems".
1:10-2:15  Lunch
2:15-2:55  Sean Thompson, "Verifying Java Programs".
2:55-3:00  Break
3:00-3:50  Jingjing Lu, Yuxiang Zhu, "Automatic Verification of Transmission Control Protocol Using NuSMV".
3:50-4:00  Break
4:00-4:40  Cosmin Truta, TBA.
4:40-4:45  Break
4:45-5:35  Christin Hofstee, Peeter Piegaze, TBA.
5:35-5:40  Break
5:40-6:20  Benet Devereux, "Reasoning about Hybrid Systems".
6:20-6:30 Closing remarks by Marsha Chechik
6:30 Conference ends

Abstracts of the Talks
William Andreopoulos, "Defining Formal Semantics for the Unified Modelling Language"
The Unified Modelling Language (UML) has become a standard diagrammatic notation for describing object-oriented (OO) models and designs. UML suffers from a lack of a formal (or precise) semantics. UML semantics is mostly described using lengthy paragraphs of often ambiguous informal English, or is totally missing. This paper examines the research conducted at present by the PUML (Precise UML) group towards formalising UML. We present the three main approaches that have been identified for UML formalisation; the supplemental approach, the OO-extended formal language approach, and the methods integration approach. We illustrate the approaches with specific examples from published sources. Finally, we explain the reasons for which UML formalisation is such a difficult topic and we discuss what the future might look like as a result.
Jingjing Lu, Yuxiang Zhu, "Automatic Verification of Transmission Control Protocol Using NuSMV"
In this report we construct a model to simulate the TCP state machine using NuSMV. Also we try to find some possible flaws in TCP. Finally we address if NuSMV is a proper model checker for complex systems like TCP.
Tsuyoshi Morioka, "Automatic Verification of Probabilistic Systems"
Probabilistic model checking is a natural extenstion of model checking to probabilistic systems. In order to model-check probabilistic systems, we need formal models that capture a probabilistic behaviour of a system and probabilistic temporal logics that allow us to make statememts about the likelihood that a system follows a certain execution sequence. In this paper we present three formal models of probabilistic systems: Markov chains, which can be used to model purely probabilistic systems, Probabilistic Nondeterministic Systems (PNSs), which capture both a probabilistic behaviour and a nondeterministic behaviour of a system, and Timed Probabilistic Nondeterministic Systems, which extend PNSs by modelling the passage of time explicitly.

 
We also present three probabilistic temporal logics PCTL*, PBTL, and pTL*. PCTL* extends a traditional temporal logic CTL*, and PBTL and pTL* are further extensions of PCTL*. We briefly dicuss the model checking procedures for these logics.
Ariel Fuxman, TBA
TBA
Jeffrey Tang, Wei Zhou, TBA.
TBA
Sean Thompson, "Verifying Java Programs"
TBA
Christin Hofstee, Peeter Piegaze, TBA
TBA
Benet Devereux, "Reasoning about Hybrid Systems"
TBA

Cosmin Truta, TBA
 
TBA

For more information or to request a copy of conference proceedings, send mail to chechik@cs.toronto.edu.  Information about CSC2108 "Automated Verification" is available at www.cs.toronto.edu/~chechik/courses99/csc2108.