Sciweavers

3889 search results - page 248 / 778
» The Use of Program Dependence Graphs in Software Engineering
Sort
View
139
Voted
FOSSACS
2004
Springer
15 years 10 months ago
Adhesive Categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in comput...
Stephen Lack, Pawel Sobocinski
147
Voted
AOSD
2007
ACM
15 years 8 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
FASE
2004
Springer
15 years 10 months ago
Automated Debugging Using Path-Based Weakest Preconditions
Abstract. Software debugging is the activity of locating and correcting erroneous statements in programs. Automated tools to locate and correct the erroneous statements in a progra...
Haifeng He, Neelam Gupta
KCAP
2003
ACM
15 years 9 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
DAC
2009
ACM
16 years 5 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke