dijkstra.cs.virginia.edu
GenProg | Evolutionary Program Repair
http://dijkstra.cs.virginia.edu/genprog
Applying GenProg to Graphics Shaders. A Human Study of Patch Maintainability. Download Archival Results and Experiment Frameworks. Software maintenance is expensive. GenProg reduces software maintenance costs by automatically producing patches. Repairs) for program defects. GenProg uses genetic programming. To search for repairs. Our evolutionary computation represents candidate repairs as sequences of edits to software source code. Each candidate in a large population is applied to the original prog...
qualitascorpus.com
(Possibly) Frequently Asked Questions
http://www.qualitascorpus.com/docs/faq.html
Possibly) Frequently Asked Questions. Why is there no link to the download site? Is there other work done on the Qualitas Corpus? Some of the systems seem to be missing libraries so they cannot be executed? I want to do studies involving dynamic analysis, can I use the corpus for this. Is there any way I can interactively, or otherwise explore the corpus? I need a collection of systems with specific characteristics. Does the corpus have such? What other software corpora are there? The corpus was designed...
openscience.us
tera-PROMISE: Other Open Science Portals
http://openscience.us/other/index.html
McCabe and Halsted 14. Function Points Analysis 4. Other Open Science Portals. If you’d like to suggest a site to add, email us at opensciences.content@gmail.com. Public Library of Science. International Software Benchmarking Standards Group (IBSBSG). Zerlot.cse.nd.edu. Sourcerer.ics.uci.edu. Site design by Mitch Rees-Jones. Supported by the National Science Foundation.
micdel.fr
Mickaël Delahaye: IPEG
http://micdel.fr/ipeg.en.html
IPEG (Infeasible Path Explanation and Generalization) is a proprietary dynamic symbolic execution tool to experiment infeasible path generalization. From a program written in a significant subset of the C language, IPEG is able:. To find the program infeasible paths via symbolic execution;. To analyze path condition to explain path infeasibility;. To generalize a (potentially infinite) family of infeasible paths as an automaton based on the explanation of a single infeasible path;. CEA Colibri, CLP solver.