EECS4315

Weekly Calendar

Anonymous (anonymous@undisclosed.example.com) — 2016-03-30T02:27:34+00:00

Weekly Calendar January 4 Title: Bugs are everywhere Reading material: page 1-2, 4-6 of the textbook Slides: [lecture1.pdf] January 5 Title: Testing on steriods Reading material: JUnit website Slides: [lecture2.pdf] January 7 Lab: Lab1 January 11 Title: Concurrency Reading material:

Contact

Anonymous (anonymous@undisclosed.example.com) — 2007-08-01T13:57:34+00:00

Contact Course Director * Bob J. Smith * Office: CSE 999 (Computer Science and Engineering Building) * Phone: (416) 736-2100 x. 11111 * Email: bobsmith AT cse DOT yorku DOT ca You may contact the course director by e-mail at any time. Teaching Assistants

Course Outline

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T19:53:17+00:00

Course Outline The course outline is a guideline to topics that will be discussed in the course, and when they will be discussed: Week 1 Your notes here. Week 2 Midterm Drop Deadline Week 13 Final Exam

Frequently Asked Questions

Anonymous (anonymous@undisclosed.example.com) — 2007-08-01T14:34:50+00:00

Frequently Asked Questions Here, you can list frequently asked questions from your students along with responses. General Do I need to register for a CSE Computer Account? Yes. Do I need to attend class? If you wish to pass. Tests Do I need to write all tests?

Forums

Anonymous (anonymous@undisclosed.example.com) — 2007-08-02T17:22:57+00:00

Forums This page acts as a future placeholder for a link to a forum system.

Grades

Anonymous (anonymous@undisclosed.example.com) — 2007-08-03T19:04:58+00:00

Grades The weight distribution of the course components is as follows: * 25% - Assignment 1 * 25% - Midterm * 25% - Assignment 2 * 25% - Final Exam You can view your marks here. Conversion from numeric to letter grade is applied to the overall mark only and in accordance with the following departmental standard:

Important Dates

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T17:53:24+00:00

Important Dates Here, you would list important dates for your course. * Sept 1 - Assignment 1 Due * Oct 1 - Course finished

Anonymous (anonymous@undisclosed.example.com) — 2016-01-05T16:19:20+00:00

Write a JUnit test case to test the class Byte, whose API can be found here. The JAR for the Byte class can be found here.

Anonymous (anonymous@undisclosed.example.com) — 2016-01-13T17:13:21+00:00

Read the notes. Install Java PathFinder (JPF), either on your own machine or in your EECS account. Create the HelloWorld example. Run JPF on the example, both from the command line and from either Eclipse or NetBeans. If you use your own machine, bring it to the lab on Thursday for the Quiz.

Anonymous (anonymous@undisclosed.example.com) — 2016-01-18T20:20:16+00:00

In 1994, John Trono introduced the Santa Claus problem. Its description can be found in John Trono. A new exercise in concurrency. ACM SIGCSE Bulletin, 26(3):8-10, September 1994. The paper also contains a solution. Implement this solution in Java. In particular, create the classes Santa, Reindeer, and Elf. Use the Semaphore class whose

Anonymous (anonymous@undisclosed.example.com) — 2016-01-27T22:02:51+00:00

JPF in its basic form is a state exploring Java virtual machine (JVM) which can systematically explore all potential executions of Java code. There are many different ways to explore the executions. For example, JPF can use different search strategies such as breadth-first search (BFS) and depth-first search (DFS). Consider a Java code that gives rise to the following state space diagram.

Anonymous (anonymous@undisclosed.example.com) — 2016-02-03T13:08:16+00:00

Create a Listener, named MnemonicPrinter, that prints the mnemonics of the bytecode instructions that are executed by JPF. Consider, for example, Given a configuration file similar to JPF produces something similar to

Anonymous (anonymous@undisclosed.example.com) — 2016-02-08T22:33:49+00:00

Implement a simplified version of breadth first search. Implement it in a class called BFSearch. Only add notifications related to SearchListeners (no need for dealing with the attribute done, etcetera).

Anonymous (anonymous@undisclosed.example.com) — 2016-02-24T14:05:11+00:00

Consider the following app. * Develop a model class so that the above app can be verified with JPF. This Wikipedia page might be helpful. * Develop a native peer so that the above app can be verified with JPF.

Anonymous (anonymous@undisclosed.example.com) — 2016-03-03T13:46:04+00:00

Implement a listener and publisher that, given the following app, and the application configuration file produces output similar to That is, JPF reports the maximum amount of nondeterminism (maximum number of outgoing transitions from any state of the system under test). Apart from the classes that have been discussed in the lectures, also the class ChoiceGenerator, which is part of the package gov.nasa.jpf.vm, may be useful.

Policies

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T18:55:53+00:00

Policies Here, you can list specific course policies. Academic Dishonesty For more information on Academic Dishonesty, click here.

Resources

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T18:59:29+00:00

Resources Use this page to list additional Resources that may be helpful to your students. * Department of CSE Home Page * York Exam Schedule

Anonymous (anonymous@undisclosed.example.com) — 2024-03-08T14:02:31+00:00

* Weekly Calendar * Course Syllabus

Mission Critical Systems

Anonymous (anonymous@undisclosed.example.com) — 2016-03-26T14:06:26+00:00

Mission Critical Systems Jason, Jonathan, Amgad, Drew, Skyler, Franck

Course Syllabus

Anonymous (anonymous@undisclosed.example.com) — 2016-01-05T21:09:43+00:00

Course Syllabus Lectures Time: Mondays, 10:30-12:00 and Tuesdays, 14:30-16:00 Location: Stong College, room 211 (Mondays) and TEL Building, room 0004 (Tuesdays) Instructor: Franck van Breugel, Office Hours: Lassonde Building, room 3046, Fridays, 14:00-15:00 Labs

Textbook

Anonymous (anonymous@undisclosed.example.com) — 2007-07-31T18:42:03+00:00

Textbook You will require the following textbook for this course: * Jane Doe. Absolute Computing. Second edition. Addison Wesley, 2007. You may purchase this book through the York University Bookstore.

What's New?

Anonymous (anonymous@undisclosed.example.com) — 2007-08-02T18:27:52+00:00

What's New? Here, you can list what's new in your course. 07-31-07 Assignment 1 is now due. If you have not submitted it, you will score 0. 07-28-07 Assignment 1 is coming due shortly. Please ensure that you submit it on time.