Sciweavers

4716 search results - page 715 / 944
» Iterative-free program analysis
Sort
View
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
15 years 8 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
136
Voted
AGP
1998
IEEE
15 years 8 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»
15 years 8 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
161
Voted
IWMM
2000
Springer
78views Hardware» more  IWMM 2000»
15 years 8 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
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 8 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig