2137 search results - page 307 / 428 » Proving Abstract Non-interference |
171
click to vote
LOPSTR
2007
Springer
16 years 15 days ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
155
click to vote
LPNMR
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
196
click to vote
RTA
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. ...
152
click to vote
SAS
2007
Springer
16 years 14 days ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
165
click to vote
SAS
2007
Springer
16 years 14 days ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...