DLint: Dynamically checking bad coding practices in JavaScript

L Gong, M Pradel, M Sridharan, K Sen - Proceedings of the 2015 …, 2015 - dl.acm.org
JavaScript has become one of the most popular programming languages, yet it is known for
its suboptimal design. To effectively use JavaScript despite its design flaws, developers try to …

Generating reproducible and replayable bug reports from android application crashes

M White, M Linares-Vásquez, P Johnson… - 2015 IEEE 23rd …, 2015 - ieeexplore.ieee.org
Manually reproducing bugs is time-consuming and tedious. Software maintainers routinely
try to reproduce unconfirmed issues using incomplete or no informative bug reports …

Just test what you cannot verify!

M Czech, MC Jakobs, H Wehrheim - International Conference on …, 2015 - Springer
Today, software verification is an established analysis method which can provide high
guarantees for software safety. However, the resources (time and/or memory) for an …

On the use of delta debugging to reduce recordings and facilitate debugging of web applications

M Hammoudi, B Burg, G Bae, G Rothermel - Proceedings of the 2015 …, 2015 - dl.acm.org
Recording the sequence of events that lead to a failure of a web application can be an
effective aid for debugging. Nevertheless, a recording of an event sequence may include …

Abstraction-driven concolic testing

P Daca, A Gupta, TA Henzinger - International Conference on Verification …, 2015 - Springer
Concolic testing is a promising method for generating test suites for large programs.
However, it suffers from the path-explosion problem and often fails to find tests that cover …

Bidirectional symbolic analysis for effective branch testing

M Baluda, G Denaro, M Pezzè - IEEE Transactions on Software …, 2015 - ieeexplore.ieee.org
Structural coverage metrics, and in particular branch coverage, are popular approaches to
measure the thoroughness of test suites. Unfortunately, the presence of elements that are …

Automatically computing path complexity of programs

L Bang, A Aydin, T Bultan - Proceedings of the 2015 10th Joint Meeting …, 2015 - dl.acm.org
Recent automated software testing techniques concentrate on achieving path coverage. We
present a complexity measure that provides an upper bound for the number of paths in a …

Defeating ddos using productive puzzles

M Abliz, TF Znati - … on Information Systems Security and Privacy …, 2015 - ieeexplore.ieee.org
In this paper, we present Productive Puzzles, a novel puzzle mechanism for defending
against Distributed Denial of Service (DDoS) attacks. Productive puzzles aim to use tasks …

ZoomIn: Discovering failures by detecting wrong assertions

F Pastore, L Mariani - 2015 IEEE/ACM 37th IEEE International …, 2015 - ieeexplore.ieee.org
Automatic testing, although useful, is still quite ineffective against faults that do not cause
crashes or uncaught exceptions. In the majority of the cases automatic tests do not include …

[PDF][PDF] 基于犽近邻最弱前置条件的程序多路径验证方法

郭曦, 王盼, 王建勇, 张焕国 - 计算机学报, 2015 - cjc.ict.ac.cn
摘要程序多路径验证方法是对软件性质进行发掘的重要方法之一, 现有的验证方法主要通过求解
路径条件或者自动构造不同的输入来触发生成不同的路径, 从而分析程序中潜在的安全问题 …