456 search results - page 18 / 92 » A Proof System for Abstract Non-interference |
ESOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
ATVA
2008
Springer
13 years 10 months ago
2008
Springer
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
CIE
2006
Springer
14 years 10 days ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...