1016 search results - page 84 / 204 » Automatic Analysis of Programming Assignments |
118
Voted
IRAL
2000
ACM
15 years 8 months ago
2000
ACM
We propose a method to create process flow graphs automatically from textbooks for cooking programs. This is realized by understanding context by narrowing down the domain to cook...
132
Voted
ICSE
2010
IEEE-ACM
15 years 7 months ago
2010
IEEE-ACM
Concurrency is inherent in today’s software. Unexpected interactions between concurrently executing threads often cause subtle bugs in concurrent programs. Such bugs are hard to...
217
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
132
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
101
click to vote
ICSE
2010
IEEE-ACM
15 years 8 months ago
2010
IEEE-ACM
Program differencing tools such as GNU diff identify individual differences but do not determine how those differences are related to each other. For example, an extract super...