Sciweavers

11231 search results - page 2037 / 2247
» Digging for Data Structures
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
15 years 3 months ago
The Interactive Curry Observation Debugger iCODE
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...
Parissa H. Sadeghi, Frank Huch
ENTCS
2007
100views more  ENTCS 2007»
15 years 3 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
142
Voted
JSAC
2006
131views more  JSAC 2006»
15 years 3 months ago
On Dynamic Optimization of Packet Matching in High-Speed Firewalls
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer
ENTCS
2007
121views more  ENTCS 2007»
15 years 3 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
JSAC
2006
163views more  JSAC 2006»
15 years 3 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
« Prev « First page 2037 / 2247 Last » Next »