• Keine Ergebnisse gefunden

Specification and Verification with Higher-Order Logic Organisation and Overview Arnd Poetzsch-Heffter

N/A
N/A
Info
Herunterladen
Protected

Academic year: 2022

Aktie "Specification and Verification with Higher-Order Logic Organisation and Overview Arnd Poetzsch-Heffter"

Copied!
4
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Jetzt herunterladen ( 4 Seite )

Volltext

(1)

Specification and Verification with Higher-Order Logic

Organisation and Overview

Arnd Poetzsch-Heffter

Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern

Sommersemester 2010

Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Specification and Verification with Higher-Order Logic Sommersemester 2010 1 / 1

(2)

Organisation and Overview Organisation

Organisation

Contact

Arnd Poetzsch-Heffter Patrick Michel

Christoph Feller

http://softech.informatik.uni-kl.de/

Dates, Time, and Location 3C + 3R (8 ECTS-LP)

Monday, 11:45-13:15, room 48-462

Wednesday, 11:45-13:15, room 48-462 or room 32-411 Friday, 11:45-13:15, room 32-411

Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Specification and Verification with Higher-Order Logic Sommersemester 2010 2 / 1

(3)

Organisation and Overview Organisation

Organisation

Course Webpage

softech.informatik.uni-kl.de/Homepage/SVHOL10

Literature

L. C. Paulson. ML for the Working Programmer. Cambridge University Press, 1996.

R. Harper. Programming in Standard ML. Available at

http://www.cs.cmu.edu/ rwh/smlbook/offline.pdf. Carnegie Mellon University, 2004.

T. Nipkow, L. C. Paulson and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Springer LNCS 2283, 2002

Acknowledgements

to Dr. Jens Brandt who designed most of the slides to the Isabelle/HOL community

Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Specification and Verification with Higher-Order Logic Sommersemester 2010 3 / 1

(4)

Organisation and Overview Overview

Overview

Course Outline Introduction

Concepts of functinal programming Higher-order logic

Verification in Isabelle/HOL (and other theorem provers) Verification of algorithms: A case study

Modeling and verification of finite software systems: A case study Specification of programming languages

Verification of a Hoare logics Beyond interactive theorem proving

Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Specification and Verification with Higher-Order Logic Sommersemester 2010 4 / 1

Referenzen

Jetzt herunterladen ( PDF - 4 Seite - 59.84 KB )

ÄHNLICHE DOKUMENTE

Syntax and Type Analysis Lecture Compilers Summer Term 2011 Prof. Dr. Arnd Poetzsch-Heffter

If there are more than one token matching the longest input prefix, procedure token nondeterministically returns one of them... Lexical Analysis Implementation

Prof. Dr. Arnd Poetzsch-Heffter

XPath has a large set of built-in functions (even more in XPath 2.0) that can be used in XPath predicates and in XSLT scripts for computing values from document nodes.

Specification and Verification in Higher-order Logic Lecture SS 2010 Prof. Dr. A. Poetzsch-Heffter

4.1 The structure of theory Main 4.2 Set construction in Isabelle/HOL 4.3 Natural numbers in Isabelle/HOL 5.. Case analysis and structural

Functional Programming A Brief Introduction to Standard ML Arnd Poetzsch-Heffter

2 Standard ML in Examples Evalutation and Bindings Operations and Functions Standard Data Types.. Polymorphism and Type

Higher-Order Logic Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter

Having variables that range over predicates allows to write terms like. Ω def =

Programming in Standard ML: Continued Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt)

This Lecture: Deeper Insight pattern matching case analysis data type definitions

Implementing a Simple Theorem Prover Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt)

Data Types of a Theorem Prover formulas, terms and types axioms and theorems deduction rules proofs.. Basic Data Structures Theorems

Hardware Verification Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt)

The input line datain accepts a stream of bits, and the output line dataout emits the same stream delayed by four cycles. The bus out is four