Sciweavers

120 search results - page 22 / 24
» Refactoring programs to secure information flows
Sort
View
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 13 days ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
CADE
2008
Springer
14 years 5 months ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic
POPL
2006
ACM
14 years 5 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
ISSRE
2006
IEEE
13 years 11 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski
POPL
2004
ACM
14 years 5 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