Sciweavers

5506 search results - page 757 / 1102
» Minimal Logic Programs
Sort
View
ANCS
2005
ACM
16 years 7 days ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
IPPS
2003
IEEE
15 years 12 months ago
BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S....
148
Voted
SIGSOFT
2008
ACM
16 years 7 months ago
Effective blame for information-flow violations
Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, cu...
Dave King 0002, Trent Jaeger, Somesh Jha, Sanjit A...
SIGCSE
2009
ACM
150views Education» more  SIGCSE 2009»
16 years 7 months ago
Dereferee: exploring pointer mismanagement in student code
Dynamic memory management and the use of pointers are critical topics in teaching the C++ language. They are also some of the most difficult for students to grasp properly. The re...
Anthony Allevato, Manuel A. Pérez-Qui&ntild...
185
Voted
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
16 years 1 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon