Sciweavers

2335 search results - page 377 / 467
» Type Checking Type Classes
Sort
View
COMPSAC
1997
IEEE
14 years 1 months ago
Building Software Recovery Assertions from a Fault Injection-based Propagation Analysis
We have investigated a fault injection-based technique for undermining the ability of software components to produce undesirable outputs into the state of the system. Undesirable ...
Jeffrey M. Voas
LCR
1998
Springer
137views System Software» more  LCR 1998»
14 years 1 months ago
Integrated Task and Data Parallel Support for Dynamic Applications
There is an emerging class of real-time interactive applications that require the dynamic integration of task and data parallelism. An example is the Smart Kiosk, a free-standing ...
James M. Rehg, Kathleen Knobe, Umakishore Ramachan...
CIKM
1997
Springer
14 years 1 months ago
A Framework for the Management of Past Experiences with Time-Extended Situations
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
Michel Jaczynski
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 1 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil