Sciweavers

1071 search results - page 36 / 215
» Programming with enumerable sets of structures
Sort
View
LCTRTS
2004
Springer
14 years 4 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
SCAM
2008
IEEE
14 years 5 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
DSN
2005
IEEE
14 years 4 months ago
Detecting Stealth Software with Strider GhostBuster
Stealth malware programs that silently infect enterprise and consumer machines are becoming a major threat to the future of the Internet [XZ04]. Resource hiding is a powerful stea...
Yi-Min Wang, Doug Beck, Binh Vo, Roussi Roussev, C...
JAR
2010
95views more  JAR 2010»
13 years 5 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
SCP
1998
112views more  SCP 1998»
13 years 10 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer