Searching for "On Strict Codes." – sorted by Relevance.
-
Experiments with strict STG code
- Experiments with strict STG code Denis B Howe Geoffrey L Burn Computing Department, Imperial
- Cited by 2 (0 self) – Add To MetaCart
-
Regression Test Selection for C++ Software
- of the software. The technique is strictly code based, and requires no assumptions about the approach used
- Cited by 19 (5 self) – Add To MetaCart
-
Cost Estimation Model For Reuse Based Software Products
- exist in the literature, varying from strictly code-based metrics, aiming to measure the amount of code
- Add To MetaCart
-
Optimal code size reduction for software-pipelined loops on dsp applications
- of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad
- Cited by 3 (2 self) – Add To MetaCart
-
Selecting Regression Tests for Object-Oriented Software
- . Our technique is strictly code-based, and makes no assumptions about methods used to specify or test
- Cited by 20 (7 self) – Add To MetaCart
-
Meade’s Analysis and Today’s Global Imbalances
- if others also are conforming to a strict code, and that the latter, if by a miracle it does come about, may
- Add To MetaCart
-
Generating Efficient Code for Lazy Functional Languages
- such efficient code type and strictness information is necessary. Strictness information is used in two ways
- Cited by 23 (5 self) – Add To MetaCart
-
Three architectural models for compiler-controlled speculative execution
- above the branch. The general code percolation model strictly enforces Restriction 1 but not Restriction
- Cited by 21 (4 self) – Add To MetaCart
-
Declarative Debugging of Lazy Functional Programs
- functional programs. Debugging strict code is essentially the same as debugging Horn clause programs
- Cited by 15 (3 self) – Add To MetaCart
-
DNA codes and their properties
- (X)Σ + = ∅. 3. The set X is called θ-strict-code if X ∩ θ(X) = ∅ . 4. The set X is called θ-prefix-code if X ∩ θ
- Cited by 1 (1 self) – Add To MetaCart

