Sciweavers

2 search results - page 1 / 1
» Eliminating Covert Flows with Minimum Typings
Sort
View
CSFW
1997
IEEE
13 years 8 months ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith
AEI
1999
120views more  AEI 1999»
13 years 4 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy