Sciweavers

1204 search results - page 93 / 241
» Termination of Polynomial Programs
Sort
View
88
Voted
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 4 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
70
Voted
INFSOF
2006
73views more  INFSOF 2006»
15 years 20 days ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley
191
Voted
POPL
2007
ACM
16 years 1 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...
EMSOFT
2004
Springer
15 years 6 months ago
A typed assembly language for real-time programs
We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each...
Thomas A. Henzinger, Christoph M. Kirsch
73
Voted
TCS
2010
14 years 11 months ago
A trajectory-based strict semantics for program slicing
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
Richard W. Barraclough, David Binkley, Sebastian D...