Sciweavers

2137 search results - page 240 / 428
» Proving Abstract Non-interference
Sort
View
141
Voted
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
15 years 3 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
János Barát, Jirí Matousek, D...
108
Voted
CORR
2006
Springer
94views Education» more  CORR 2006»
15 years 3 months ago
Epsilon-Unfolding Orthogonal Polyhedra
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
134
Voted
ENTCS
2006
151views more  ENTCS 2006»
15 years 3 months ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
106
Voted
FUIN
2006
93views more  FUIN 2006»
15 years 3 months ago
Membrane Computing and Economics: Numerical P Systems
Abstract. With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve,...
Gheorghe Paun, Radu A. Paun
119
Voted
JAR
2008
89views more  JAR 2008»
15 years 3 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff