Sciweavers

ISSTA
2009
ACM
13 years 9 months ago
Run-time conformance checking of mobile and distributed systems using executable models
This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera — a novel, high-level language supporting the descri...
Ahmad A. Saifan, Ernesto Posse, Jürgen Dingel
ISSTA
2009
ACM
13 years 10 months ago
A formal analysis of requirements-based testing
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for...
Charles Pecheur, Franco Raimondi, Guillaume Brat
ISSTA
2009
ACM
13 years 10 months ago
A comparative study of programmer-written and automatically inferred contracts
Where do contracts — specification elements embedded in executable code — come from? To produce them, should we rely on the programmers, on automatic tools, or some combinati...
Nadia Polikarpova, Ilinca Ciupa, Bertrand Meyer
ISSTA
2009
ACM
13 years 10 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...
ISSTA
2009
ACM
13 years 10 months ago
Automatic system testing of programs without test oracles
Metamorphic testing has been shown to be a simple yet effective technique in addressing the quality assurance of applications that do not have test oracles, i.e., for which it is ...
Christian Murphy, Kuang Shen, Gail E. Kaiser
ISSTA
2009
ACM
13 years 10 months ago
Efficient mutation testing by checking invariant violations
David Schuler, Valentin Dallmeier, Andreas Zeller
ISSTA
2009
ACM
13 years 10 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
ISSTA
2009
ACM
13 years 10 months ago
Loop-extended symbolic execution on binary programs
Mixed concrete and symbolic execution is an important technique for finding and understanding software bugs, including securityrelevant ones. However, existing symbolic execution...
Prateek Saxena, Pongsin Poosankam, Stephen McCaman...
ISSTA
2009
ACM
13 years 10 months ago
AVA: automated interpretation of dynamically detected anomalies
Dynamic analysis techniques have been extensively adopted to discover causes of observed failures. In particular, anomaly detection techniques can infer behavioral models from obs...
Anton Babenko, Leonardo Mariani, Fabrizio Pastore