158
Voted
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
167
click to vote
CSFW
2007
IEEE
15 years 9 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
131
click to vote
CSFW
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider the problem of statically verifying the conformance of the code of a system to an explicit authorization policy. In a distributed setting, some part of the system may ...
172
click to vote
CSFW
2007
IEEE
15 years 9 months ago
2007
IEEE
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...
238
Voted
SWAT
2010
Springer
15 years 9 months ago
2010
Springer