Seminar Calendar
for events the day of Friday, September 23, 2011.

.
events for the
events containing

Questions regarding events or the calendar should be directed to Tori Corkery.
     August 2011           September 2011          October 2011
Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
1  2  3  4  5  6                1  2  3                      1
7  8  9 10 11 12 13    4  5  6  7  8  9 10    2  3  4  5  6  7  8
14 15 16 17 18 19 20   11 12 13 14 15 16 17    9 10 11 12 13 14 15
21 22 23 24 25 26 27   18 19 20 21 22 23 24   16 17 18 19 20 21 22
28 29 30 31            25 26 27 28 29 30      23 24 25 26 27 28 29
30 31


Friday, September 23, 2011

Model Theory and Descriptive Set Theory Seminar
4:00 pm   in 347 Altgeld Hall,  Friday, September 23, 2011
 Del Edit Copy
Submitted by phierony.
 Yuri Gurevich (Microsoft Research)Cloud security and the logic of infonsAbstract: In software industry engineers often do formal logic even though they may not realize that. Security policy is one of those fields where engineers do logic. The security policy of a large organization consists of great many rules. You want to throw in a few more rules. Are you sure that they do not contradict the current policy? Is the current policy is consistent? Is the meaning of the rules well defined? Are there unintended ambiguities? Is your policy in compliance with government regulations? The relentless move to the cloud aggravates these and related problems. A few logic-based languages arose to deal with these problems. As a rule they presume a central logic engine. Our policy language, called DKAL, goes beyond that. It formalizes not only logic but also communication which facilitates reasoning about interacting policies. But it is the logic of DKAL - infon logic - that is main topic of the lecture. Infons are declarative sentences viewed as pieces of information. One doesn't ask whether a given infon is true or false; it may be neither. A better question is who knows that infon. We will describe the logic if infons. In particular we will present so-called primal infon logic, very efficient and yet sufficiently expressive for many authorization purposes. The derivation problem for primal infon logic is solvable in linear time.