2137 search results - page 60 / 428 » Proving Abstract Non-interference |
175
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
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: ...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
RTSS
2007
IEEE
15 years 4 months ago
2007
IEEE
We study the problem of executing a collection of independently designed and validated task systems upon a common comprised of a preemptive processor and additional shared resourc...
TPHOL
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract. We use the theorem prover Isabelle to formalise and machinecheck results of the theory of generalised substitutions given by Dunne and used in the B method. We describe t...