1127 search results - page 122 / 226 » The XIS Generative Programming Techniques |
SARA
2007
Springer
15 years 5 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
ISSTA
2006
ACM
15 years 5 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
124
click to vote
SP
1999
IEEE
15 years 3 months ago
1999
IEEE
Intrusion detection systems rely on a wide variety of observable data to distinguish between legitimate and illegitimate activities. In this paper we study one such observable-seq...
PEPM
1999
ACM
15 years 3 months ago
1999
ACM
This paper explores the relationship between C++ templates and partial evaluation. Templates were designed to support generic programming but unintentionally provided the ability ...
ICCAD
1997
IEEE
15 years 3 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...