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: ...
d Abstract) Bruno Blanchet∗ § Patrick Cousot§ Radhia Cousot∗¶ J´erˆome Feret§ Laurent Mauborgne§ Antoine Min´e§ David Monniaux∗§ Xavier Rival§ that abstract inter...
Bruno Blanchet, Patrick Cousot, Radhia Cousot, J&e...
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...