Sciweavers

4719 search results - page 421 / 944
» Newtonian program analysis
Sort
View
LICS
2009
IEEE
16 years 1 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
BIRTHDAY
2007
Springer
16 years 28 days ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
PADL
2007
Springer
16 years 26 days ago
Partial Evaluation of Pointcuts
Abstract. In aspect-oriented programming, pointcuts are usually compiled by identifying a set of shadows — that is, places in the code whose execution is potentially relevant for...
Karl Klose, Klaus Ostermann, Michael Leuschel
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 8 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
163
Voted
CC
2004
Springer
127views System Software» more  CC 2004»
16 years 4 days ago
Analyzing Memory Accesses in x86 Executables
This paper concerns static-analysis algorithms for analyzing x86 executables. The aim of the work is to recover intermediate representations that are similar to those that can be c...
Gogul Balakrishnan, Thomas W. Reps