Sciweavers

4386 search results - page 285 / 878
» A Tamper-Resistant Programming Language System
Sort
View
115
Voted
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
15 years 1 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
192
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 8 days ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
PLDI
1997
ACM
15 years 7 months ago
Two for the Price of One: Composing Partial Evaluation and Compilation
One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformati...
Michael Sperber, Peter Thiemann
174
Voted
HIPEAC
2011
Springer
14 years 3 months ago
TypeCastor: demystify dynamic typing of JavaScript applications
Dynamic typing is a barrier for JavaScript applications to achieve high performance. Compared with statically typed languages, the major overhead of dynamic typing comes from runt...
Shisheng Li, Buqi Cheng, Xiao-Feng Li
SAC
2010
ACM
15 years 3 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit