99 search results - page 3 / 20 » Building Compilers by Combining Algebras |
ACL
1998
13 years 6 months ago
1998
In this paper we view Lexicalized Tree Adjoining Grammars as the compilation of a tract and modular layer of linguistic description :the metagrammar (MG). MG provides a hierarchic...
ISSRE
2003
IEEE
13 years 10 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
SACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...
ENTCS
2002
13 years 5 months ago
2002
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
SC
2009
ACM
14 years 2 days ago
2009
ACM
Memory bandwidth limits the performance of important kernels in many scientific applications. Such applications often use sequences of Basic Linear Algebra Subprograms (BLAS), an...