Sciweavers

1016 search results - page 79 / 204
» Automatic Analysis of Programming Assignments
Sort
View
112
Voted
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
15 years 9 months ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 9 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
135
Voted
DIMVA
2006
15 years 5 months ago
Using Type Qualifiers to Analyze Untrusted Integers and Detecting Security Flaws in C Programs
Incomplete or improper input validation is one of the major sources of security bugs in programs. While traditional approaches often focus on detecting string related buffer overfl...
Ebrima N. Ceesay, Jingmin Zhou, Michael Gertz, Kar...
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 10 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
121
Voted
APLAS
2005
ACM
15 years 9 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn