2137 search results - page 53 / 428 » Proving Abstract Non-interference |
JSYML
2008
14 years 10 months ago
2008
Abstract. In this paper we study the metric spaces that are definable in a polynomially bounded ominimal structure. We prove that the family of metric spaces definable in a given p...
JGT
2006
14 years 10 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
ENTCS
2002
14 years 9 months ago
2002
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
MOC
2000
14 years 9 months ago
2000
Abstract. We consider the equations of stationary incompressible magnetohydrodynamics posed in three dimensions, and treat the full coupled system of equations with inhomogeneous b...
SLOGICA
2010
14 years 8 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...