��이�
vse Загesta danš sätt,
srečno pleče
stranča
paino
Samozrej. Mislim, da
Ma samo pouštenja bolj vopam skvarila.
Kontent ali je
vsun Bali eništo potkaj.
ČeCTO
expertiki i obočode izprašanje in zdradil sem takihAss absoluplih skav noč takko crumbs vasto
več kot si notified aim shyro
relaxed nekih prewas просme.
Especially tij estate na toliko včeraj.
V these last Bye, trub Discovera gu začali načšiti, da nzhgrana
ostava neka
po scheme skupall ngthenikinje stari ver Η
Hradce extreme z vseh BILL KEWIS.
M здесь apperununje enjoysit včasih
Takšno naprav vones você nema製 tortino,
Tier bomo mene lokalni treble na kualizaciji vterilov.
prizes
Bolj raz v storedljanju na
postavljanju.
шrh
Tukaj z Ginger vse to nEskoj vورat logivinga zelo ne practive enodominousa.
Onest swo se povsem sredj spinčio.
disappointmento si da apo ez tušac temneče se milo Heroes preko tega vedno iz 외šaj prihajsonje.
Ali obličena je, da možemo odstaviti p Creat
kaj bo vzpomagali partialno funkcijo z stani do stani
in produčiti drugo partialno funkcijo z stani do stani.
In možda, kaj bi lahko potrebno
vzpomagali vsega tako,
to bi bilo dobro...
Vzpomagali vsega,
to bi bilo element vzpomagalnih vzpomagalnih vzpomagalnih sprem.
In možda, da ena z vsega vzpomagalnih
semanstvi boste dobro semanstvi
za početek.
V generali, semanstvo je
način način način na prekursivno semanstvo.
Je to tudi to,
kaj smo tukaj dvaj?
In je to samo
zemljena in imitacija?
Tako,
ta
semanstva
in semanstva, ki
sem poskušam
Presenters
Zugänglich über
Offener Zugang
Dauer
01:29:07 Min
Aufnahmedatum
2016-12-07
Hochgeladen am
2019-04-11 17:09:02
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.