A practical approach to formal methods Lecturer: Ralph Back Place: A5059 Time:e very second Monday, 13 - 16 Dates: 28.1, 11.2, 25.2, 10.3, 31.3, 14.4,

Slides:



Advertisements
Similar presentations
Central Baltic program 2011 – 2013 Ralph-Johan Back.
Advertisements

Teaching Formal Methods for the Unconquered Territory Nestor Catano Madeira ITI, Portugal Camilo Rueda Pontificia Universidad Javeriana (PUJ), Cali, Colombia.
Mathematics in Engineering Education N. Grünwald & V. Konev Hochschule Wismar – University of Technology, Business and Design, Wismar, Germany Tomsk Polytechnic.
BEST PRACTICES IN TEACHING INTRODUCTORY PROGRAMMING Beth Simon, Computer Science and Engineering UC, San Diego.
European Computer competence Certificate in eccc standard.
What is Further Mathematics? is an AS/A level qualification is designed to be studied alongside standard the standard Maths AS/A levels has content which.
Catching Bugs in Software Rajeev Alur Systems Design Research Lab University of Pennsylvania
TAP: Tests and Proofs, 12 February Testing and Verifying Invariant Based Programs in the SOCOS Environment Ralph-Johan Back, Johannes Eriksson and.
1 Mechanical Verification of Timed Automata Myla Archer and Constance Heitmeyer Presented by Rasa Bonyadlou 24 October 2002.
CR ST CREST Centre for Reliable Software Technology Ralph Back Director.
VIDE als voortzetting van Cocktail SET Seminar 11 september 2008 Dr. ir. Michael Franssen.
Software Reliability CIS 640 Adapted from the lecture notes by Doron Pelel (
Formal Methods in Software Engineering Credit Hours: 3+0 By: Qaisar Javaid Assistant Professor Formal Methods in Software Engineering1.
Software Testing and Quality Assurance
“Procedural” is not enough B. Abramovitz, M. Berezina, A. Berman, L. Shvartsman 4 th MEDITERRANEAN CONFERENCE ON MATHEMATICS EDUCATION University of Palermo.
The Classroom Presenter Project Richard Anderson University of Washington.
TR1413: Discrete Mathematics For Computer Science Lecture 3: Formal approach to propositional logic.
Invariant Based Programming, March 20101/ Teaching the construction of correct programs using invariant based programming Ralph-Johan Back Johannes Eriksson.
1 Introduction to Software Engineering Lecture 42 – Communication Skills.
Overview Discrete Mathematics and Its Applications Baojian Hua
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 18 Program Correctness To treat programming.
Data Structures, Spring 2004 © L. Joskowicz 1 DAST – Final Lecture Summary and overview What we have learned. Why it is important. What next.
Masters in Information Science and Technology (IST) Thesis and Non-Thesis Option (30 Credits)
TR1413: Discrete Mathematics For Computer Science Lecture 1: Mathematical System.
SEEFM 07, Thessaloniki, Nov 20071/ Teaching the construction of correct programs using invariant based programming Ralph-Johan Back Johannes Eriksson Linda.
TR1413: Discrete Math for Computer Science Lecture 0: Introduction.
MCA –Software Engineering Kantipur City College. Topics include  Formal Methods Concept  Formal Specification Language Test plan creation Test-case.
Average Income Advantages Educational Requirements.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
28 August 2015T Kari Laitinen1 T Seminar on Wireless Future 3 ECTS cr Dr. Kari Laitinen Principal Lecturer Oulu University of Applied Sciences.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Structure of Study Programmes
Project MLExAI Machine Learning Experiences in AI Ingrid Russell, University.
Invariant Based Programming in Education Tutorial, FM’08 Linda Mannila
Introduction CS 3358 Data Structures. What is Computer Science? Computer Science is the study of algorithms, including their  Formal and mathematical.
Richard Wilfred Yelle Collaborative Computing in Higher Education: Peer-to-Peer and Beyond Internet2 January 31, 2002 Parsons School of Design at New School.
Foundations of Technology Pythagorean Theorem
Computational models of the living cell Ralph Back Dept. of Information Technologies Åbo Akademi Ralph Back Dept. of Information Technologies Åbo Akademi.
New teachers seminar August 22, 2012 Jens Chr. Godskesen Head of Department.
Formal Verification Lecture 9. Formal Verification Formal verification relies on Descriptions of the properties or requirements Descriptions of systems.
Lecture Introduction to Proofs 1.7 Proof Methods and Strategy.
Common Software Mathematics Education Common Software for Mathematics Education Vladimir Nodelman Holon Institute of Technology, Israel.
CS Data Structures I Chapter 2 Principles of Programming & Software Engineering.
ENEE244-02xx Digital Logic Design Lecture 12. Announcements HW4 due today HW5 is up on course webpage. Due on 10/16. Recitation quiz on Monday, 10/13.
Software Debugging, Testing, and Verification Presented by Chris Hundersmarck November 10, 2004 Dr. Bi’s SE516.
Announcements Reading for Monday –4.6 Homework 3 – Due 9/29.
Chapter 13: Software Life Cycle Models Omar Meqdadi SE 273 Lecture 13 Department of Computer Science and Software Engineering University of Wisconsin-Platteville.
Postgraduate Courses in the College of Arts, Celtic Studies, and Social Sciences Dr Alan Gibbs Associate Dean for Graduate Studies, CACSSS.
Static Techniques for V&V. Hierarchy of V&V techniques Static Analysis V&V Dynamic Techniques Model Checking Simulation Symbolic Execution Testing Informal.
ECE/CS 584: Verification of Embedded Computing Systems Model Checking Timed Automata Sayan Mitra Lecture 09.
Course: Software Engineering – Design I IntroductionSlide Number 1 What is a specification Description of a (computer) system, which:  is precise;  defines.
NPQ Instructor II. Introduction  The NPQ Instructor II program is designed for individuals that are interested in the Fire and Emergency Services Training.
Career and Technical Education CAREER PATHWAYS TO SUCCESS Dr. Rhinnie Scott, Director Career and Technical Education January 3, 2012.
Frederico Araujo CS6362 – Fall 2010 Automated Theorem Proving.
Computer Software engineer By: Eric Musser. What is This? Computer engineers make programs to run a computer. Computer engineers make programs to run.
Soft Skills: Where Do We Teach Them in a 4-Year Environment Kathy Winters University of Tennessee, Chattanooga.
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
NDA Coaching in Chandigarh
Chapter 10: Mathematical proofs
Dynamic Simulation and Control Design (IA5617)
IS 2935: Developing Secure Systems
Programming Languages 2nd edition Tucker and Noonan
Clark Barrett Analysis of Computer Systems Group
Module Description: This course intends to introduce special topics of current trends in information technology. Topics covered in this course should be.
Department of Computer Science Abdul Wali Khan University Mardan
Introduction to Proofs Proof Methods and Strategy
Department of Mathematics
Programming Languages 2nd edition Tucker and Noonan
Presentation transcript:

A practical approach to formal methods Lecturer: Ralph Back Place: A5059 Time:e very second Monday, Dates: 28.1, 11.2, 25.2, 10.3, 31.3, 14.4, 28.4, 12.5, 19.5 Credits: 5 points Working methods: lectures, seminar presentations, hands on training on selected problems

Purpose of course The course describes a practical approach to building software that is correct by construction. The course covers three main topics: –how to write mathematical proofs in a systematic manner using structured derivations, –how to use automatic and interactive theorem provers for proving matematical theorems, and –how to build verified software using invariant based programming. We will study these issues from different points of view: –basic methods, –theoretical foundations, –tool support, and –teaching experiences

Intended audience Students working on their masters degree in –Computer Science, –Computer Engineering, and –Mathematics. The course serves as a special course in – Computer Science (informationsbehandling) – Computer Engineering (datateknik) at Abo Akademi. Preliminaries: A basic understanding of formal methods and some mathematical maturity is an advantage.

Contents Systematic construction of mathematical proofs – using structured derivations Automatic and interactive proofs in higher order logic –using PVS Constructing programs that are correct by construction –using invariant based programming

Litterature To be announced