Sciweavers

4355 search results - page 355 / 871
» From Interpretation to Compilation
Sort
View
TOOLS
1992
IEEE
15 years 10 months ago
Automating the Development of Syntax Tree Generators for an Evolving Language
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
Per Grape, Kim Walden
PLDI
1990
ACM
15 years 10 months ago
Task Granularity Analysis in Logic Programs
While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the wor...
Saumya K. Debray, Nai-Wei Lin, Manuel V. Hermenegi...
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
15 years 10 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
ASPDAC
2007
ACM
135views Hardware» more  ASPDAC 2007»
15 years 10 months ago
A Parameterized Architecture Model in High Level Synthesis for Image Processing Applications
- Most image processing applications are computationally intensive and data intensive. Reconfigurable hardware boards provide a convenient and flexible solution to speed up these a...
Yazhuo Dong, Yong Dou
FOAL
2007
ACM
15 years 10 months ago
Aspect-oriented programming with type classes
We consider the problem of adding aspects to a strongly typed language which supports type classes. We show that type classes as supported by the Glasgow Haskell Compiler can mode...
Martin Sulzmann, Meng Wang