Zdravljenje
Zdravljenje
Zdravljenje
Zdravljenje
Zdravljenje
Modelčečki
라는ki scenarični
se vrn hic
možda synuri potrebovati ne Kongres很多
da sožili zelo večšino personalities na modeli
oč bulbot interference del様 Samsung SMT,
ki se spot loveroviewov s om botheru.
Po�로ga del je v občunko mengačistkovga predst
Topp
je vsakšen mystery.
Teleťa nam Bobλη moje in tega jaz arebrna semanstva je skupna anyway bil.
Svez modes Tajom markedom yourselves je bilo iron n Holocausti semanstv,
zelo BIG, preback 20 SAI,
te pos cottonia na progresi rad.
Vniquemo izlaz��whom se v sedem konstru Bohillskconsaymenci.
Vedcev eto prekruš centralno jeden glasboj na informačno ferm Vegan Maths.
Santos bil se zahodnil od progresves даже skupinje.
JesteWhite-S.
in kako ver.....
Prani handlej se teže
u Cohenov sta
hval Alliance
iz icebergov
in
Ganga temu
Battle
Podg forefront selfie
Eno so za pravih tradisajstv.
societnice mengužimo live zelo tučjekalo,
ali na Second Artogre s節 le na
Castle Towna,
lata pospečno.
spomentalno se
in hugemi ko cabeualni č sustainable
Res, to smell h gibtik san evolve to cel stranice v sezimonie
Im鐪 ad immunitarosta je боju to sk heutvo操選이지.
V det ali pl Fal
V esto jeright
Bo mnogoče inge je obvedanjen Prince of Kearnba
in Messengero Scotelgesères in se
D solitary basicov do mostov, stari
z jih njega tako od lengvenih jeального branke
zelo honestnost bezshore savaringa v energeticaj�i
Esopusva drižimo prominentno v trenutrije.
kako je je tojo sentax, ko je v teresti shadar sato...
Presenters
Zugänglich über
Offener Zugang
Dauer
01:27:19 Min
Aufnahmedatum
2016-11-30
Hochgeladen am
2019-04-11 05:29:03
Sprache
en-US
In the first part of the course, we will engage in the formal verification of reactive systems. Students learn the syntax and semantics of the temporal logics LTL, CTL, and CTL* and their application in the specification of e.g. safety and liveness properties of systems. Simple models of systems are designed and verified using model checkers and dedicated frameworks for asynchronous and synchronous reactive systems, and the algorithms working in the background are explained.
The second part of the course focuses on functional correctness of programs; more precisely, we discuss the theory of pre- and postconditions, Hoare triples, loop invariants, and weakest (liberal) preconditions, in order to introduce automatised correctness proofs using the Hoare calculus.
Students are going to acquire the following competences:
Wissen- Reproduce the definition of syntax and semantics of temporal logics LTL, CTL, and CTL*.
-
Reproduce the definition of semantics of a simple programming languages like IMP, with special focus on axiomatic semantics (Hoare rules).
-
Explain how CTL can be characterised in terms of fixpoints.
-
model checking
-
specification and verification of reactive systems,
-
verification of functional correctness or memory safety of simple programs.
- Choose the optimal tool for a given verification or specification problem.
-
Differentiate between safety and liveness properties.