Sciweavers

5255 search results - page 629 / 1051
» Formal Methods for Privacy
Sort
View
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
16 years 1 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston
SAS
2007
Springer
125views Formal Methods» more  SAS 2007»
16 years 1 months ago
A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
Introducing aspect orientation to a polymorphically typed functional language strengthens the importance of type-scoped advices; i.e., advices with their effects being harnessed b...
Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Kh...
SAS
2007
Springer
106views Formal Methods» more  SAS 2007»
16 years 1 months ago
Guided Static Analysis
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
Denis Gopan, Thomas W. Reps
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
16 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
2007
Springer
16 years 1 months ago
Program Analysis Using Symbolic Ranges
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...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...