Die Suche ergab 140 Treffer

von AlexanderF
6. Feb 2018 18:41
Forum: Archiv
Thema: Some Remarks on Module 8
Antworten: 2
Zugriffe: 260

Re: Some Remarks on Module 8

On slide 56 in the definition of lambda specific bisimulation on configurations, the second bullet point does not need to contain (L1, sigma1, st1) R (L1', sigma1', st1') since it already occurs ahead of the bullet points. And the reflexivity, transitivity and symmetry (1. bullet point) could be wri...
von AlexanderF
6. Feb 2018 16:18
Forum: Archiv
Thema: Module 9 - Usefulness of Compositionality Result - Definition: Globally Sound Use of Modes
Antworten: 0
Zugriffe: 139

Module 9 - Usefulness of Compositionality Result - Definition: Globally Sound Use of Modes

The theorem on slide 22 ensures SIFUM-security for a multithreaded program where all threads are SIFUM-secure, if for every state, the global configuration pairing all single threads with the initial mode mods_0 state ensures a sound use of modes. A global configuration ensures a sound use of modes ...
von AlexanderF
5. Feb 2018 19:03
Forum: Archiv
Thema: Some Remarks on Module 8
Antworten: 2
Zugriffe: 260

Re: Some Remarks on Module 8

And on slides 42ff, I think, brackets around the statements are missing.
von AlexanderF
5. Feb 2018 12:40
Forum: Archiv
Thema: Some Remarks on Module 8
Antworten: 2
Zugriffe: 260

Some Remarks on Module 8

I think on slide 33 of Module 8, it is possible to weaken the requirement that the union of R and "low bisimilarity" is symmetric to the one that R is symmetric. Since if R is symmetric and "low bisimilarity" is symmetric, (which we can conclude from the second theorem on slide 18) I think, it follo...
von AlexanderF
5. Feb 2018 12:19
Forum: Archiv
Thema: Questions and Remarks on slides about Runtime Monitoring and Enforcement
Antworten: 2
Zugriffe: 475

Re: Questions and Remarks on slides about Runtime Monitoring and Enforcement

hello, I agree on the last observation and also have something to add: On Slide 24, Notation, there are a P and a Tr mentioned, without saying what P and Tr are. Is P a process (like defined in the slide above) and is Tr := traces(P)? but then Tr should by definition be a subset of E*, and hence I d...
von AlexanderF
24. Jan 2018 16:20
Forum: Archiv
Thema: Exercise Sheet 10
Antworten: 1
Zugriffe: 165

Exercise Sheet 10

hello,

will there be a lecture or an exercise tomorrow on thursday?

And what is the definition of SI-secure in exercise 10.6?

best regards,
Alexander
von AlexanderF
22. Jan 2018 15:15
Forum: Archiv
Thema: Strong Low Bisimulation on Configurations and Strong Low Bisimulation on Programs
Antworten: 1
Zugriffe: 223

Strong Low Bisimulation on Configurations and Strong Low Bisimulation on Programs

hello, in Exercise 9.2 there are no strong low bisimulations on programs for: a) ii) ([skip], [l1 := 0]) iii) ([l1 := 0||l1 := 1], [l1 :=1||l1 := 0]) b) i) ([S], [S]) where S = (l2 := 0; if l2 = 0 then l1 := 0 else l1 := h1 fi) But do I see right that there are actually strong low bisimulations on c...
von AlexanderF
22. Dez 2017 18:12
Forum: Archiv
Thema: Questions and Remarks on slides about Runtime Monitoring and Enforcement
Antworten: 2
Zugriffe: 475

Questions and Remarks on slides about Runtime Monitoring and Enforcement

hello, I have some questions and remarks on some slides from the slides set of Module 6 on Runtime Monitoring and Enforcement. On slide 13 in the third text line between sigma' and delta' I think it should be mu' instead of mu. On slide 19, I think it is a little bit silly to give the set {0, ..., n...
von AlexanderF
6. Dez 2017 14:45
Forum: Archiv
Thema: Error in Sample Solution of Exercise 5.2
Antworten: 1
Zugriffe: 202

Error in Sample Solution of Exercise 5.2

hello, Exercise 5.2 a) requires the abstract interpretation functions for assignments to be optimal. I think the given functions for assignments S1 and S2 in the sample solution are not optimal. For example for f_S1, there is a more informative function f'_S1 (f_S1 is not at least as informative as ...
von AlexanderF
4. Dez 2017 14:37
Forum: Archiv
Thema: Remark on Sample Solution of Exercise 3.1
Antworten: 1
Zugriffe: 221

Remark on Sample Solution of Exercise 3.1

hello,
I think in the sample solution of exercise 3.1 d) on page 3,
it should not be S_C^1 = S_C^0, but S_C^2 = S_C^1.

best regards,
Alexander
von AlexanderF
4. Dez 2017 14:28
Forum: Archiv
Thema: Remarks and Questions on the Monotone Framework
Antworten: 2
Zugriffe: 338

Re: Remarks and Questions on the Monotone Framework

I think in my first question I should have argued with the finite branching factor instead of the finiteness of the sets. Also I have seen in the meanwhile that we need the complete lattice in the Tarski’s Fixed Point Theorem to ensure that we have fixpoints and a least fixpoint. And thank you for t...
von AlexanderF
4. Dez 2017 14:00
Forum: Archiv
Thema: Question about exercise 2.3c
Antworten: 1
Zugriffe: 271

Re: Question about exercise 2.3c

No, I think, you did not make a mistake.
It results in the same set, as you say.
The solution just presents the simplified equations.
I think, that is actually the case for all sample solutions of this exercise sheet.

best regards,
Alexander
von AlexanderF
10. Nov 2017 21:23
Forum: Archiv
Thema: Remarks and Questions on the Monotone Framework
Antworten: 2
Zugriffe: 338

Remarks and Questions on the Monotone Framework

hello, In the Monotone Framework (Module 2, slide 68) we assume a complete lattice where each subset of L has a least upper bound and a greatest lower bound (slide 52). In the presented analyses (slides 73ff) we only use finite sets (like the power set of all variables resp. nontrivial subexpression...
von AlexanderF
10. Nov 2017 21:14
Forum: Archiv
Thema: Questions and remarks about modeling of probabilistic schedulers
Antworten: 2
Zugriffe: 260

Re: Questions and remarks about modeling of probabilistic schedulers

Thank you for the answer!

best regards,
Alexander
von AlexanderF
1. Nov 2017 15:37
Forum: Archiv
Thema: Questions and remarks about modeling of probabilistic schedulers
Antworten: 2
Zugriffe: 260

Questions and remarks about modeling of probabilistic schedulers

hello, on slide 25 of Module 1, a scheduler is defined as a triple (St, Sin, lambda), consisting of a set of possible scheduler states, a set of possible scheduler inputs, and a scheduling algorithm. Is it not necessary to specify also a start state or a set of possible start states, for example for...

Zur erweiterten Suche