• Keine Ergebnisse gefunden

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

N/A
N/A
Protected

Academic year: 2022

Aktie "Organisational Details Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt)"

Copied!
4
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Organisational Details

Specification and Verification with Higher-Order Logic

Arnd Poetzsch-Heffter (Slides by Jens Brandt)

Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern

Sommersemester 2008

Arnd Poetzsch-Heffter (Slides by Jens Brandt) ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Organisational Details Sommersemester 2008 1 / 4

(2)

Organisation Overview

Overview

Contact

Arnd Poetzsch-Heffter Jan Olaf Blech Marek J. Gawkowski

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

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

Tuesday, 15:30-17:00, room 34-420 Thursday, 15:30-17:00, room 34-420

Arnd Poetzsch-Heffter (Slides by Jens Brandt) ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Organisational Details Sommersemester 2008 2 / 4

(3)

Organisation Overview

Overview

Course Webpage

softech.informatik.uni-kl.de/twiki/bin/view/Homepage/SVHOL08

Literature

R. Harper. Programming in Standard ML. 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

Arnd Poetzsch-Heffter (Slides by Jens Brandt) ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Organisational Details Sommersemester 2008 3 / 4

(4)

Organisation Overview

Overview

Course Outline

Introduction to Standard ML Theorem Proving Fundamentals

Theorem Prover Architecture and Working Principles Higher-Order Logic

The HOL System (and other Theorem Provers) Specifying and Verifying with Higher-Order Logic Selected Theorem Proving Applications

Arnd Poetzsch-Heffter (Slides by Jens Brandt) ( Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern)Organisational Details Sommersemester 2008 4 / 4

Referenzen

ÄHNLICHE DOKUMENTE

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

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

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

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

c) Insbesondere dann, wenn eine große Anzahl an Gleichheitstests für Strings durchgeführt werden muß, macht es Sinn, den Aufwand für die Durchführung des Vergleichs zu

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

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

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