Sciweavers

1112 search results - page 83 / 223
» Executing Abstract Test Cases
Sort
View
FAC
2008
100views more  FAC 2008»
15 years 3 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
SMC
2010
IEEE
198views Control Systems» more  SMC 2010»
15 years 1 months ago
Fast tracking of natural textures using fractal snakes
Abstract — The natural environments that robotic applications often encounter can present difficult problems for imagebased task execution. Prior efforts have used both grayscale...
Christopher E. Smith
IPPS
2006
IEEE
15 years 9 months ago
Dynamic performance prediction of an adaptive mesh application
While it is possible to accurately predict the execution time of a given iteration of an adaptive application, it is not generally possible to predict the data-dependent adaptive ...
Mark M. Mathis, Darren J. Kerbyson
ICDE
2008
IEEE
176views Database» more  ICDE 2008»
16 years 4 months ago
Automatic Result Verification for the Functional Testing of a Query Language
Functional testing of a query language is a challenging task in practice. In order to reveal errors in the query processing functionality, it is necessary to verify the actual res...
Carsten Binnig, Donald Kossmann, Eric Lo, Angel Sa...
FAC
2007
128views more  FAC 2007»
15 years 3 months ago
Verifying a signature architecture: a comparative case study
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
David A. Basin, Hironobu Kuruma, Kunihiko Miyazaki...