11 search results - page 2 / 3 » Time-Space Tradeoffs for Branching Programs |
POPL
1995
ACM
13 years 8 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
TLDI
2010
ACM
14 years 2 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
COMPSAC
2009
IEEE
13 years 9 months ago
2009
IEEE
The security of software defined radio (SDR) software is essential to the trustworthiness of the overall radio system. When designing and developing security solutions for SDR sof...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
MICRO
2003
IEEE
13 years 10 months ago
2003
IEEE
Single-event upsets from particle strikes have become a key challenge in microprocessor design. Techniques to deal with these transient faults exist, but come at a cost. Designers...