6274 search results - page 363 / 1255 » Proofs, Programs, Processes |
183
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
187
click to vote
EMSOFT
2007
Springer
16 years 26 days ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
195
click to vote
EUROCRYPT
2004
Springer
16 years 2 days ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
171
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
189
click to vote
SAS
2010
Springer
15 years 5 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...