Sciweavers

1112 search results - page 100 / 223
» Executing Abstract Test Cases
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 3 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
CASCON
2000
119views Education» more  CASCON 2000»
15 years 4 months ago
Efficient mapping of software system traces to architectural views
Information about a software system's execution can help a developer with many tasks, including software testing, performance tuning, and program understanding. In almost all...
Robert J. Walker, Gail C. Murphy, Jeffrey Steinbok...
CC
2007
Springer
158views System Software» more  CC 2007»
15 years 3 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
CN
2007
148views more  CN 2007»
15 years 3 months ago
A rigorous approach to orchestrating grid services
Although conceived for web services, it is shown how BPEL (Business Process Execution Language) can be used to orchestrate a collection of grid services. This is achieved using th...
Kenneth J. Turner, Koon Leai Larry Tan
FMCAD
1998
Springer
15 years 7 months ago
Symbolic Simulation: An ACL2 Approach
Executable formal speci cation can allow engineers to test (or simulate) the speci ed system on concrete data before the system is implemented. This is beginning to gain acceptance...
J. Strother Moore