Sciweavers

61 search results - page 12 / 13
» Type-Directed Flow Analysis for Typed Intermediate Languages
Sort
View
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
13 years 5 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens
VL
2009
IEEE
118views Visual Languages» more  VL 2009»
14 years 2 months ago
What designers want: Needs of interactive application designers
Designers’ extensive software needs have not been adequately documented in the research literature, and are poorly supported by software. Without appropriate tools to support th...
Valentina Grigoreanu, Roland Fernandez, Kori Inkpe...
POPL
2006
ACM
14 years 7 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
AADEBUG
2005
Springer
14 years 1 months ago
Specifying and checking component usage
One of today’s challenges is producing reliable software in the face of an increasing number of interacting components. Our system CHET lets developers define specifications des...
Steven P. Reiss