Sciweavers

ASE
2010
87views more  ASE 2010»
13 years 11 months ago
Estimating the feasibility of transition paths in extended finite state machines
Karnig Derderian, Robert M. Hierons, Mark Harman, ...
ASE
2010
78views more  ASE 2010»
13 years 11 months ago
Finding robust solutions in requirements models
Gregory Gay, Tim Menzies, Omid Jalali, Gregory E. ...
ASE
2010
84views more  ASE 2010»
13 years 11 months ago
Test input reduction for result inspection to facilitate fault localization
Dan Hao, Tao Xie, Lu Zhang, Xiaoyin Wang, Jiasu Su...
ASE
2010
86views more  ASE 2010»
13 years 11 months ago
Stable rankings for different effort models
There exists a large and growing number of proposed estimation methods but little conclusive evidence ranking one method over another. Prior effort estimation studies suffered fro...
Tim Menzies, Omid Jalali, Jairus Hihn, Daniel Bake...
ASE
2010
82views more  ASE 2010»
13 years 11 months ago
Automatically finding the control variables for complex system behavior
Gregory Gay, Tim Menzies, Misty Davies, Karen Gund...
ASE
2010
97views more  ASE 2010»
13 years 11 months ago
Defect prediction from static code features: current results, limitations, new approaches
Tim Menzies, Zach Milton, Burak Turhan, Bojan Cuki...
ASE
2010
89views more  ASE 2010»
13 years 11 months ago
AFID: an automated approach to collecting software faults
Alex Edwards, Sean Tucker, Brian Demsky
ASE
2010
86views more  ASE 2010»
13 years 11 months ago
Improving code completion with program history
Romain Robbes, Michele Lanza
ASE
2010
126views more  ASE 2010»
13 years 11 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural
ASE
2010
129views more  ASE 2010»
13 years 11 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...