| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Semantics Of Programming Languages (F.3.2) > Partial Evaluation (F.3.2...)
|
|
 |
|
|
| |
|
|
| |
1-6 of 6
Reviews about "Partial Evaluation (F.3.2...)":
|
Date Reviewed |
| |
Partial evaluation of string obfuscations for Java malware detection
Chawdhary A., Singh R., King A. Formal Aspects of Computing 29(1): 33-55, 2017. Type: Article
Cyber security has become a major concern in government, industry, and academia and in the everyday lives of individuals. How we secure our information systems and maintain the privacy and integrity of our online presence and data is a...
|
Oct 2 2017 |
| |
Fast offline partial evaluation of logic programs
Leuschel M., Vidal G. Information and Computation 23570-97, 2014. Type: Article
Suppose we execute a program with only some of the data it needs. If we reach a choice point requiring data we do not have, we could return a program consisting of the choice test and the code used in its branches. We could go further ...
|
Sep 3 2014 |
| |
Optimizing SYB is easy!
Adams M., Farmer A., Magalhães J. PEPM 2014 (Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation, San Diego, CA, Jan 20-21, 2014) 71-82, 2014. Type: Proceedings
One of the mainstays of advanced programming is the technique called datatype generic programming, where one writes a single traversal routine that works over many different data types. While this has been used in C++ for a long time, ...
|
May 27 2014 |
| |
The abstraction and instantiation of string-matching programs
Amtoft T., Consel C., Danvy O., Malmkjær K. In The essence of computation. New York, NY: Springer-Verlag New York, Inc., 2002. Type: Book Chapter
A string matcher is a program that tests whether a pattern string appears in a text. The derivation of an efficient string matching program from a naive version is a canonical example in partial evaluation (an automatic technique to sp...
|
Sep 22 2003 |
| |
Constraint-based partial evaluation for imperative languages
Ying J., Chengzhi J. Journal of Computer Science and Technology 17(1): 64-72, 2002. Type: Article
Partial evaluation is a fully automatic, source-to-source program transformation technique that takes a program and part of its input data (the so-called “static” data) and returns a specialized version of the origi...
|
Apr 25 2003 |
| |
Toward a complete transformational toolkit for compilers
Bergstra J., Dinesh T., Field J., Heering J. ACM Transactions on Programming Languages and Systems 19(5): 639-684, 1997. Type: Article
Optimizing compilers attempt to understand programs in order to produce excellent code. One way in which they express their understanding is to transform a program into one embodying all of the information crucial to that program&#...
|
May 1 1998 |
| |
|
|
| |
|
|
