Sciweavers

429 search results - page 60 / 86
» Symbolic Computation Software Composability
Sort
View
ISSTA
2006
ACM
14 years 2 months ago
Path-oriented random testing
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 ...
Arnaud Gotlieb, Matthieu Petit
DBPL
2007
Springer
103views Database» more  DBPL 2007»
14 years 21 days ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
CAV
2010
Springer
214views Hardware» more  CAV 2010»
14 years 20 days ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...
IIE
2007
159views more  IIE 2007»
13 years 8 months ago
Creating and Visualizing Test Data from Programming Exercises
Automatic assessment of programming exercises is typically based on testing approach. Most automatic assessment frameworks execute tests and evaluate test results automatically, bu...
Petri Ihantola
SAC
2009
ACM
14 years 3 months ago
Modular implementation of adaptive decisions in stochastic simulations
We present a modular approach to implement adaptive decisions with existing scientific codes. Using a sophisticated system software tool based on the function call interception t...
Pilsung Kang 0002, Yang Cao, Naren Ramakrishnan, C...