| |
 |
|
|
Silva, Josep
Universitat Politècnica de València
Valencia, Spain
|
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 7 of 7
reviews
|
|
|
|
|
|
|
|
A survey on software fault localization
Wong W., Gao R., Li Y., Abreu R., Wotawa F. IEEE Transactions on Software Engineering 42(8): 707-740, 2016. Type: Article
The most important software fault localization techniques published through 2014 are reviewed and classified in this paper. Concretely, the information sources of this survey are 331 papers and 54 PhD and master’s theses publ...
|
Mar 9 2017 |
|
|
|
|
|
|
 ORBS: language-independent program slicing
Binkley D., Gold N., Harman M., Islam S., Krinke J., Yoo S. FSE 2014 (Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, Hong Kong, China, Nov 16-21, 2014) 109-120, 2014. Type: Proceedings
Binkley et al. introduce a novel dynamic slicing technique called observation-based slicing (ORBS). This new technique has a very interesting property: it is language independent, and thus it is able to slice multi-language systems.
|
Apr 15 2015 |
|
|
|
|
|
|
DSD-Crasher: a hybrid analysis tool for bug finding
Csallner C., Smaragdakis Y. Software testing and analysis (Proceedings of the 2006 International Symposium on Software Testing and Analysis, Portland, Maine, Jul 17-20, 2006) 245-254, 2006. Type: Proceedings
Nimmer and Ernst [1] propose a bug-finding tool that follows a two-step approach to program analysis. The first step dynamically detects invariants to produce an input domain. For this purpose, the Daikon tool is used to track, at runt...
|
Feb 2 2007 |
|
|
|
|
|
|
Abstract slicing: a new approach to program slicing based on abstract interpretation and model checking
Seok Hong H., Lee I., Sokolsky O. Source code analysis and manipulation (Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM’05),25-34, 2005. Type: Proceedings
Program slicing [1] is a technique for extracting those sentences of a program that affect or are affected by a given slicing criterion. Since this technique was introduced in 1984, many other approaches (such as constraint slicing and...
|
Jan 10 2006 |
|
|
|
|
|
|
Slicing Web application based on hyper graph
Wu J., Xu B., Jiang J. Cyberworlds (Proceedings of the 2004 International Conference on Cyberworlds (CW’04),Nov 18-20, 2004) 177-181, 2004. Type: Proceedings
A new program slicing method that is applicable to Web applications is proposed in this paper. The authors claim that traditional program slicing is not appropriate for Web applications, because they are based on program dependence gra...
|
Feb 11 2005 |
|
|
|
|
|
|
Binding-time analysis for Mercury
Vanhoof W., Bruynooghe M. Logic programming (Proceedings of the 1999 International Conference on Logic Programming, Las Cruces, New Mexico, United States, 500-514, 1999. Type: Proceedings
Partial evaluation (or program specialization) is a technique that transforms a program into another program, by pre-computing some of its operations. This kind of program transformation typically has been approached from two points of...
|
Oct 14 2004 |
|
|
|
|
|
|
Lava: hardware design in Haskell
Bjesse P., Claessen K., Sheeran M., Singh S. ACM SIGPLAN Notices 34(1): 174-184, 1999. Type: Article
Hardware design languages have been continuously increasing their abstraction levels over the last 20 years, and languages such as very high speed integrated circuit hardware description language (VHDL) and Verilog have become standard...
|
Aug 27 2004 |
|
|
|
|
|
| |
|
|
| |
|
|
