Sciweavers

1448 search results - page 99 / 290
» From Requirements to Code Revisited
Sort
View
161
Voted
POPL
2010
ACM
16 years 1 months ago
Automatically Generating Instruction Selectors Using Declarative Machine Descriptions
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
João Dias, Norman Ramsey
130
Voted
RAID
2005
Springer
15 years 9 months ago
FLIPS: Hybrid Adaptive Intrusion Prevention
Intrusion detection systems are fundamentally passive and fail–open. Because their primary task is classification, they do nothing to prevent an attack from succeeding. An intru...
Michael E. Locasto, Ke Wang, Angelos D. Keromytis,...
158
Voted
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 3 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
115
Voted
ENTCS
2002
114views more  ENTCS 2002»
15 years 3 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
150
Voted
ICST
2009
IEEE
15 years 1 months ago
Putting Formal Specifications under the Magnifying Glass: Model-based Testing for Validation
A software development process is conceptually an abstract form of model transformation, starting from an enduser model of requirements, through to a system model for which code c...
Emine G. Aydal, Richard F. Paige, Mark Utting, Jim...