Sciweavers

1880 search results - page 333 / 376
» A Static Analysis for Beta-Binders
Sort
View
FPCA
1995
15 years 1 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
EWSN
2010
Springer
15 years 1 months ago
An Adaptive Strategy for Energy-Efficient Data Collection in Sparse Wireless Sensor Networks
Sparse wireless sensor networks (WSNs) are being effectively used in several applications, which include transportation, urban safety, environment monitoring, and many others. Sens...
Mario Di Francesco, Kunal Shah, Mohan Kumar, Giuse...
C3S2E
2008
ACM
14 years 11 months ago
Context-sensitive cut, copy, and paste
Creating and editing source code are tedious and error-prone processes. One important source of errors in editing programs is the failure to correctly adapt a block of copied code...
Reid Kerr, Wolfgang Stürzlinger
CCS
2008
ACM
14 years 11 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
ICALP
2010
Springer
14 years 11 months ago
Example-Guided Abstraction Simplification
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
Roberto Giacobazzi, Francesco Ranzato