Sciweavers

407 search results - page 47 / 82
» Automatic Correctness Proofs for Logic Program Transformatio...
Sort
View
POPL
2007
ACM
14 years 8 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
CAV
2009
Springer
137views Hardware» more  CAV 2009»
14 years 8 months ago
VS3: SMT Solvers for Program Verification
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
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...
Étienne Payet, Fausto Spoto
SAS
2009
Springer
149views Formal Methods» more  SAS 2009»
14 years 2 months ago
Creating Transformations for Matrix Obfuscation
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
Stephen Drape, Irina Voiculescu
SP
2000
IEEE
13 years 11 months ago
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols
Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspec...
John A. Clark, Jeremy L. Jacob