5255 search results - page 468 / 1051 » Formal Methods for Privacy |
201
Voted
LPAR
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
192
click to vote
SAS
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
175
click to vote
SAS
2004
Springer
16 years 8 days ago
2004
Springer
hedron Abstract Domain Robert Claris´o and Jordi Cortadella Universitat Polit`ecnica de Catalunya Barcelona, Spain Abstract. An interesting area in static analysis is the study of...
160
click to vote
SAS
2004
Springer
16 years 8 days ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
177
click to vote
SAS
2004
Springer
16 years 8 days ago
2004
Springer
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....