16 - Formale Methoden der Softwareentwicklung [ID:10445]
50 von 1061 angezeigt

三知ored nepkommen

ENG. www. Yoshi.org

declare

general business of reasoning about programs involving

shared meetable data structures, and today we are going to see much more of it,

or at least principles behind it when one is doing this reasoning in a style of separation.

Aha.

Potrabo��šče zato pa šele runoče.

Robis operacija je delala.

Treba začeti.

Selo sem prizapravil med嘅enem za solely.

Saj tukimo igrati sen na sestavi meseci, ki me uspečno nal Czechiki splisli sden Tukor recovery.

Mi preoped z prašnje plesno test ob Representative Lee IMP,

ne 70 goden, tukaj je prec olmaz,

so je od playinga už deadly kje so visok zda Ign限 impossible.

Gdje si opstupili��� to na sestavniji tukuli?

V samoijo objav Steve, anje

Islamopološ occasionalna ladeň v lieberi evokesko 1930

Pred pumo rast hospitality podaj za domutter č рукиニ distractor tie tako

Slišamo pri v veinu imen kada pom�emo ja paper roš variants kot smo mega uspselves kar

in lahko je lahko uspiljali in tako je bilo uspiljali v tudi tudi paskali,

ali tudi v C, kje je vzpiljali pojter aritmetika.

Tukaj se vse pojter aritmetika vzpiljajo.

To je ena komanda, ki je vzpiljali lokalizacijo.

To komanda je vzpiljali lokalizacijo.

To je vse, ki je vzpiljali lokalizacijo.

Aha, to so zelo zelo zelo.

To ne je dobro.

To komanda je vzpiljali lokalizacijo.

To, kaj je vzpiljali, je, da se vzpiljali

zame, ki so vzpiljali pod adresem a,

v programu variablex.

In to je inače mutacijo

zame, ki so vzpiljali pod adresem a,

v adresem a.

Ali to ni vzpiljali.

Inače komanda, ki je vzpiljali vzpiljali,

je ta.

In to komanda sem se povseče,

da se vzpiljali adresem a,

nothing so delok Nestog de conPer ex pedix v

k 87 prav na

K

11 Corporate

We was pregnantley trying to make this distinction

chuckles s terčini trenutni tal Memory.

S stretchémi potuj inclusive trajعce je Virgy KravET,

wažna sestrljanja Tempo omord u portrayncija emergentne

in sweetpost surprisinges.

Widitelja z ot asylumya govorljuje obmedi in

Zugänglich über

Offener Zugang

Dauer

01:29:26 Min

Aufnahmedatum

2017-01-20

Hochgeladen am

2019-04-11 09: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.

Verstehen The students understand the workings of state of the art automatic frameworks, clarifying the role of model checking algorithms, semantics and Hoare calculi in formal verification. Anwenden In a series of exercises, the students use state of the art tools for
  • model checking

  • specification and verification of reactive systems,

  • verification of functional correctness or memory safety of simple programs.

Analysieren
  • Choose the optimal tool for a given verification or specification problem.
  • Differentiate between safety and liveness properties.

Einbetten
Wordpress FAU Plugin
iFrame
Teilen