Download presentation

Presentation is loading. Please wait.

Published byJalynn Moger Modified over 3 years ago

1
1212 Formal Methods Jos Baeten, TU/e

2
1212 Formal methods Is the mathematics of software engineering. Modeling, calculation.

3
1212 Formal Methods Research in Formal Methods is a systematic and scientific study of issues in computer science, based on solid mathematical principles. Formal Methods apply to systems and constructions used in computer science. These constructions are described exactly in a formal syntax and are supplied with a formal semantics whenever appropriate.

4
1212 Formal Methods increase understanding of systems, increase clarity of description and help solve problems and remove errors. Use of Formal Methods increases dependability and usability of constructions and systems in computer science. Why Formal Methods?

5
1212 Software (+ hardware) Engineering is craft, not science. -Complex -No margin of error -Local action has global consequences -Discrete -(no intra-, extrapolation, some statistics possible)

6
1212 Quality control Process Product Quality assurance safety + liveness

7
1212 Formal Methods Specification - descriptive Verification - analysis

8
1212 Specification Communication between designers. Control and data. “What” over “how”. Reactive, parallel, distributed systems.

9
1212 Verification Not pde but discrete math calculation. Logic and deduction. All behaviours. Parameters. Hierarchy of abstraction. Model needs to be validated against reality.

10
1212 Issues and choices Selection: -Level of formality: 1. Math. argument 2. Formal spec. 3. Verif. system -Part of system, selected components -Selected properties -Part of lifecycle -Level of abstraction

11
1212 Specification: varieties Model-oriented: operational. Z. Property-oriented: logical. CTL/LTL. Concurrency. Process algebra.

12
1212 Verification: varieties. Consistency analysis and type checking Validation: animation, challenges. Predicting behaviour and verifying refinement –State space exploration, model checking, language inclusion –Theorem proving, proof checking

13
1212 Certification of critical systems Can never achieve failure rate of 10 -9.

14
1212 User req. def. Sw. req. def. Arch. design Detailed design Code Acceptance tests System tests Integration tests Unit tests Docs Verif.

15
1212 Alexander theory EREA, PVS ADL SDL, MSC, Spin, PVS, Z Invariants, PVS RPA Spin, PVS, TTCN, TorX Docs Verif.

16
1212 Advantages of FM Precision engineering Complexity engineering Correctness engineering Automation engineering

17
1212 History 1956 Noam Chomsky models language 1957 John Backus defines Fortran syntax 1958 Haskel Curry and Robert Feys describe propositions-as-types analogy 1960 Peter Naur applies BNF to ALGOL60 1968 Adriaan van Wijngaarden defines ALGOL68, experiments with, 2 l. grammar 1968 Donald Knuth invents attribute grammars

18
1212 History 1968 Dana Scott denotational sem. for 1969 Tony Hoare axiomatic semantics 1970 N.G. de Bruijn Automath 1972 IBM Vienna: FM for PL/I design 1974 Goguen Thatcher init. alg. sem. data types 1977 Joseph Stoy book denotational sem. 1978 Dines Bjørner, Cliff Jones VDM 1979 Philips Brussels CHILL design

19
1212 History 1980 Robin Milner CCS 1980 Jean-Raymond Abrial Z 1980-1990 Gerard Holzmann SPIN 1983 Jan Bergstra ACP 1985 Ed Brinksma LOTOS 1985-1995 ESPRIT: CIP, OBJ, PLUSS, ASL, Larch, SDL, ExSpect, ADJ, ASF, SDF, PSF, PVS, COLD, SPRINT, ERAE, CLEAR, …

20
1212 History 1993 VDM Europe becomes FME 1997 Intel establishes FM group after Pentium 1999 FM World Commercial firms offering FM (Verum, FDR) FMICS, IFM

21
1212 Ingredients SyntaxStates LogicTransitions ProofExecution Data typesCommunication ModularisationAbstraction Type systemTiming Object orientationHybrid systems

22
1212 Semantics Denotational De Bakker, Rozenberg Operational Axiomatic - assertional Kuiper, Jonkers, De Boer

23
1212 Varieties Logic Logic: thm proving PVS, COQ Hooman, Poll, Barendregt, Hesselink Temporele logica: CTL, LTL: Kuiper Game theory: v.d. Herik, De Bruin Categories, co-algebras: Rutten, Jacobs Multi-agent systems: Renardel

24
1212 Varieties Equational Equational: -calculus Barendregt term rewriting Klop, v. Oostrom, Zantema type theory: Barendregt, Swierstra ASF+SDF: Klint Program derivation: Meertens Process algebra: Bergstra, Fokkink, Baeten, Groote, Brinksma

25
1212 Varieties Operational Operational: sequential: Z, VDM, Larch SOS Fokkink, Reniers I/O automata Vaandrager Petri nets Van Hee, Van der Aalst Model checking Larsen Katoen Graphs Rozenberg Rensink Rooda TorX Tretmans

26
1212 Varieties Visual Visual: MSC, Petri nets

27
1212 Applications Software Engineering, in particular components, coordination Embedded Systems (hybrid systems) Business Processes Biological Processes Security Web services & grid computing Agents, games, quantum & relativistic comput.

Similar presentations

OK

MFoCS Mathematical Foundations of Computer Science Tom Heskes and Jasper Derikx.

MFoCS Mathematical Foundations of Computer Science Tom Heskes and Jasper Derikx.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Free download ppt online shopping project Ppt on fire extinguisher types a b Ppt on company act 2013 Ppt on airbag working principle Download ppt on new invention of computer technology Ppt on electricity for class 10 Ppt on linear equations in two variables class 9 Ppt on learning styles Ppt on extranuclear inheritance Ppt on channels of distribution strategy