Sciweavers

ISSRE
2007
IEEE
13 years 9 months ago
Using Machine Learning to Support Debugging with Tarantula
Using a specific machine learning technique, this paper proposes a way to identify suspicious statements during debugging. The technique is based on principles similar to Tarantul...
Lionel C. Briand, Yvan Labiche, Xuetao Liu
ISSRE
2007
IEEE
13 years 9 months ago
Prioritization of Regression Tests using Singular Value Decomposition with Empirical Change Records
During development and testing, changes made to a system to repair a detected fault can often inject a new fault into the code base. These injected faults may not be in the same f...
Mark Sherriff, Mike Lake, Laurie Williams
ISSRE
2007
IEEE
13 years 9 months ago
Testing Security Policies: Going Beyond Functional Testing
While important efforts are dedicated to system functional testing, very few works study how to test specifically security mechanisms, implementing a security policy. This paper i...
Yves Le Traon, Tejeddine Mouelhi, Benoit Baudry
ISSRE
2007
IEEE
13 years 9 months ago
Requirement Error Abstraction and Classification: A Control Group Replicated Study
Gursimran Singh Walia, Jeffrey C. Carver, Thomas P...
ISSRE
2007
IEEE
13 years 9 months ago
Intra-Class Testing of Abstract Class Features
Peter J. Clarke, Djuradj Babich, Tariq M. King, Ja...
ISSRE
2007
IEEE
13 years 9 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...
ISSRE
2007
IEEE
13 years 9 months ago
Data Mining Techniques for Building Fault-proneness Models in Telecom Java Software
This paper describes a study performed in an industrial setting that attempts to build predictive models to identify parts of a Java system with a high probability of fault. The s...
Erik Arisholm, Lionel C. Briand, Magnus Fuglerud
FOSSACS
2008
Springer
13 years 9 months ago
Robust Analysis of Timed Automata via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reyn...
FOSSACS
2008
Springer
13 years 9 months ago
Symbolic Semantics Revisited
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
Filippo Bonchi, Ugo Montanari
FOSSACS
2008
Springer
13 years 9 months ago
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...