Sciweavers

30 search results - page 5 / 6
» Pure Pointer Programs with Iteration
Sort
View
SCAM
2008
IEEE
15 years 4 months ago
Automatic Determination of May/Must Set Usage in Data-Flow Analysis
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
Andrew Stone, Michelle Strout, Shweta Behere
POPL
2008
ACM
15 years 10 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
ICTAI
1999
IEEE
15 years 2 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
ICFP
2008
ACM
15 years 9 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
HPCN
2000
Springer
15 years 1 months ago
An Analytical Model for a Class of Architectures under Master-Slave Paradigm
We build an analytical model for an application utilizing master-slave paradigm. In the model, only three architecture parameters are used: latency, bandwidth and flop rate. Instea...
Yasemin Yalçinkaya, Trond Steihaug