Sciweavers

432 search results - page 29 / 87
» The Interleaving Problem in Program Understanding
Sort
View
90
Voted
CP
2005
Springer
15 years 6 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
101
Voted
ICFP
2001
ACM
16 years 12 days ago
Compositional Explanation of Types and Algorithmic Debugging of Type Errors
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
Olaf Chitil
87
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
Program comprehension as fact finding
Little is known about how developers think about design during code modification tasks or how experienced developers' design knowledge helps them work more effectively. We pe...
Thomas D. LaToza, David Garlan, James D. Herbsleb,...
87
Voted
ICCS
2004
Springer
15 years 5 months ago
A Comparison of C, MATLAB, and Python as Teaching Languages in Engineering
We describe and compare the programming languages C, MATLAB and Python as teaching languages for engineering students. We distinguish between two distinct phases in the process of ...
Hans Fangohr
114
Voted
PPSN
1994
Springer
15 years 4 months ago
A Representation Scheme To Perform Program Induction in a Canonical Genetic Algorithm
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...
Mark Wineberg, Franz Oppacher