Sciweavers

4722 search results - page 727 / 945
» Representation-independent program analysis
Sort
View
ESA
2006
Springer
113views Algorithms» more  ESA 2006»
13 years 12 months ago
An LP-Designed Algorithm for Constraint Satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Alexander D. Scott, Gregory B. Sorkin
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 12 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
AGP
1998
IEEE
13 years 12 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
GECCO
2000
Springer
158views Optimization» more  GECCO 2000»
13 years 11 months ago
Grammar based function definition in Grammatical Evolution
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the fu...
Michael O'Neill, Conor Ryan
IWMM
2000
Springer
78views Hardware» more  IWMM 2000»
13 years 11 months ago
On the Type Accuracy of Garbage Collection
We describe a novel approach to obtaining type-accurate information for garbage collection in a hardware and language independent way. Our approach uses a run-time analysis to pro...
Martin Hirzel, Amer Diwan