Sciweavers

6167 search results - page 155 / 1234
» Can Refinement be Automated
Sort
View
FLAIRS
2001
15 years 5 months ago
User-Agent Interactions in Mixed-Initiative Learning
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
Dorin Marcu, Mihai Boicu, Gheorghe Tecuci
AVI
1996
15 years 5 months ago
A framework for user-interfaces to databases
A framework for user-interfaces to databases (IDSs) is proposed which draws from existing research on human computer interaction (HCI) and database systems. The framework is descr...
Kenneth J. Mitchell, Jessie B. Kennedy, Peter J. B...
ENTCS
2006
134views more  ENTCS 2006»
15 years 4 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
SQJ
2002
90views more  SQJ 2002»
15 years 4 months ago
Critical Analysis of the PIE Testability Technique
Abstract. The work of Voas and colleagues has introduced, refined and applied the propagation, infection and execution (PIE) analysis technique for measuring testability of program...
Zuhoor A. Al-Khanjari, Martin R. Woodward, Haider ...
GI
2009
Springer
15 years 2 months ago
Specification based testing of automotive human machine interfaces
Abstract: Model based testing promises systematic test coverage in a continuous testing process. However, in practice, model based testing struggles with informal specifications, d...
Holger Grandy, Sebastian Benz