Die Suche ergab 135 Treffer

von LordHoto
5. Jun 2012 23:07
Forum: Secure Coding Lab
Thema: Assignment 4: Faithfullnes
Antworten: 1
Zugriffe: 590

Assignment 4: Faithfullnes

Hi,

I have a short question about when a formalization is faithful to a secure coding guideline: When my formalization is (just a bit) more restrictive than the actual guideline, does that imply that my formalization is faithful?

Thanks in Advance.

// Johannes
von LordHoto
6. Mai 2012 03:13
Forum: Secure Coding Lab
Thema: Ass.2: Omitting labels/brackets
Antworten: 2
Zugriffe: 746

Ass.2: Omitting labels/brackets

Hi, I have a question about the following sentence in the assignment: The user can either explicitly specify labels using the notation " [...]@\pi " for " [...]^{\pi} " or he/she may omit the labels as well as the enclosing brackets. This makes me wonder whether the following is a valid omission of ...
von LordHoto
27. Apr 2012 19:57
Forum: Secure Coding Lab
Thema: Ass.2: Grammar of the WHILE language
Antworten: 1
Zugriffe: 661

Ass.2: Grammar of the WHILE language

Hi,

I have a question about the grammar rules. The given grammar rules allow v (i.e. variable names) to be true, false, and, or, not, skip etc.. Is this intentional or would it be fine, when we don't accept these kind of keywords as variable names?

// Johannes
von LordHoto
23. Apr 2012 16:55
Forum: Automated Software Engineering
Thema: Results of ASE Exam
Antworten: 5
Zugriffe: 3958

Re: Results of ASE Exam

ericbodden hat geschrieben:Hi.

Yes, they should be online any day now. The grades were already entered into TUCAN more than a month ago but there was a problem with a missing paper document...

Eric
Yes, I see my grade now. Thanks!

// Johannes
von LordHoto
22. Apr 2012 19:33
Forum: Automated Software Engineering
Thema: Results of ASE Exam
Antworten: 5
Zugriffe: 3958

Re: Results of ASE Exam

Hi all. I have pinned the results of the exam on the board of the Software Technology Group in front of room A206 in the Piloty Building (S2|02). If you wish to take a look at your exam, there will be a post-exam review on 22.03.2012 at 9:00-10:00, Room 3.2.14
, Building S4|14 (Mornewegstr. 30), 3r...
von LordHoto
29. Mär 2012 17:04
Forum: Archiv
Thema: Ergenisse von TS
Antworten: 85
Zugriffe: 7020

Re: Ergenisse von TS

Hallo,

würde mich auch über Fotos des Aushangs freuen. Danke.
von LordHoto
12. Mär 2012 18:56
Forum: Archiv
Thema: Needham-Schroeder asymmetrische Variante
Antworten: 5
Zugriffe: 504

Re: Needham-Schroeder asymmetrische Variante

Eine Verschlüsselung mit dem Private Key eines asymmetrischen Verschlüsselungsverfahrens ist eine Signierung. Die Trusted Thirdparty signiert also ihre Nachrichten um die Integrität und Authentizität derselben zu sichern. Die in den Folien verwendete Syntax wurde aber IIRC nur als Verschlüsselung v...
von LordHoto
12. Mär 2012 18:39
Forum: Archiv
Thema: Needham-Schroeder asymmetrische Variante
Antworten: 5
Zugriffe: 504

Re: Needham-Schroeder asymmetrische Variante

Eine Verschlüsselung mit dem Private Key eines asymmetrischen Verschlüsselungsverfahrens ist eine Signierung. Die Trusted Thirdparty signiert also ihre Nachrichten um die Integrität und Authentizität derselben zu sichern. Die in den Folien verwendete Syntax wurde aber IIRC nur als Verschlüsselung v...
von LordHoto
12. Mär 2012 18:25
Forum: Archiv
Thema: Needham-Schroeder asymmetrische Variante
Antworten: 5
Zugriffe: 504

Needham-Schroeder asymmetrische Variante

Hallo,

wieso verschlüsselt T die Nachrichten an A ({K_PB,B}) bzw. B ({K_PA,A}) mit seinem private Key? Ich sehe nicht was A bzw. B mit dieser Nachricht machen, vllt. kann mir das jemand erklären. Danke.

// Johannes
von LordHoto
28. Feb 2012 14:36
Forum: Automated Software Engineering
Thema: Lecture 11 - Slide 3 - Call graph
Antworten: 1
Zugriffe: 509

Lecture 11 - Slide 3 - Call graph

Hi,

Seeing that there is a "Subject.<init>" call from "Main.main", I think the call graph on slide 3 seems to miss an node "Main.<init>" and an edge from "Main.main" to that, since "main" includes a "Main m = new Main;" statement. Is that correct?

// Johannes
von LordHoto
28. Feb 2012 14:19
Forum: Automated Software Engineering
Thema: Orphan Shadow Analysis
Antworten: 5
Zugriffe: 922

Re: Orphan Shadow Analysis

Or do I understand the "for every symbol that is required to reach a final state" wrong, on a first read it sounded to me like this really means just all the symbols which directly enter a final state from *any* other state. But reading your explanation again, it might mean that I need to check eve...
von LordHoto
28. Feb 2012 13:40
Forum: Automated Software Engineering
Thema: Orphan Shadow Analysis
Antworten: 5
Zugriffe: 922

Re: Orphan Shadow Analysis

As far as I got it so far, as first step one calculates all the "points-to" sets of the varibales. Next one crosses all events, which are used to reach a final state, with the other events in the program. That is in this case the write at w1 and the write at w2, as events required to reach a final ...
von LordHoto
28. Feb 2012 13:32
Forum: Automated Software Engineering
Thema: JavaMOP - CFG Syntax
Antworten: 3
Zugriffe: 654

Re: JavaMOP - CFG Syntax

That definitly helps, it was just a short blackout on my side ;-). I was a bit wondering about the ","s in there, but I guess it's really just seperators for different production rules.
von LordHoto
27. Feb 2012 23:17
Forum: Automated Software Engineering
Thema: JavaMOP - CFG Syntax
Antworten: 3
Zugriffe: 654

JavaMOP - CFG Syntax

Hi,

can anyone please briefly explain the CFG Syntax of JavaMOP (29 in the version with animations), I'm not sure how to interpret that :-). Thanks in advance.

// Johannes
von LordHoto
27. Feb 2012 19:01
Forum: Automated Software Engineering
Thema: Orphan Shadow Analysis
Antworten: 5
Zugriffe: 922

Orphan Shadow Analysis

Hi, I was wondering about the example for the Orphan Shadow Analysis, it seems the example done on slides 71 till 85, is on source code, which is never shown (at least I can't read the tiny picture in the top right). So I wanted to ask whether someone can please clarify the analysis for me again. As...

Zur erweiterten Suche