Sciweavers

434 search results - page 38 / 87
» Logical Analysis of Hash Functions
Sort
View
109
Voted
PEPM
1993
ACM
15 years 4 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
115
Voted
ISB
2002
140views more  ISB 2002»
15 years 5 days ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
105
Voted
VMCAI
2010
Springer
15 years 9 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
102
Voted
IPPS
2007
IEEE
15 years 6 months ago
VoroNet: A scalable object network based on Voronoi tessellations
In this paper, we propose the design of VoroNet, an objectbased peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental...
Olivier Beaumont, Anne-Marie Kermarrec, Loris Marc...
CSL
2007
Springer
15 years 6 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby