Sciweavers

10871 search results - page 2022 / 2175
» A stable programming language
Sort
View
139
Voted
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
15 years 10 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
SIGADA
2004
Springer
15 years 10 months ago
Comparative analysis of genetic algorithm implementations
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
Robert Soricone, Melvin Neville
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 10 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
COMPSAC
2003
IEEE
15 years 10 months ago
Incremental Transformation of Procedural Systems to Object Oriented Platforms
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...
Ying Zou, Kostas Kontogiannis
CSFW
2003
IEEE
15 years 10 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
« Prev « First page 2022 / 2175 Last » Next »