Systematic abstraction of abstract machines

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Systematic Abstraction of Abstract Machines

We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines for higher-order and imperative programming languages. To demonstrate the technique and support our claim, we transform the CEK machine of Felleisen and Friedman, a lazy variant of Krivine’s machine, and the stack-inspecting ...

متن کامل

Correctly Optimizing Abstract Abstract Machines

The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound. This article contributes a complementary step-by-step process for subsequently going from a naive analyzer derived under the AAM approach, to an efficient and correct implementation. The end result of the process is a two to three...

متن کامل

Automating Abstract Interpretation of Abstract Machines

Static program analysis is a valuable tool for any programming language that people write programs in. The prevalence of scripting languages in the world suggests programming language interpreters are relatively easy to write. Users of these languages lament their inability to analyze their code, therefore programming language analyzers are not easy to write. This thesis investigates a systemat...

متن کامل

Abstract And-Parallel Machines

And-Parallel Machines* Nachum Dershowitz and Naomi Lindenstrauss Department of Computer Science, The Hebrew University, Jerusalem 91904, Israel The deterministic Turing machine, though abstract, can still be seen as a model of a realistic computer. The same cannot be said for the nondeterministic Turing machine as a model of parallel computing. We introduce several abstract machines with fine-g...

متن کامل

Interaction Abstract Machines

In this paper, we introduce the metaphor of Interaction Abstract Machines (IAMs), in the same vein of such metaphors as the Chemical Abstract Machine. The main point about IAMs is in allowing interactions among independent, locally deened subsystems | a crucial requirement for capturing the global behavior of open systems. IAMs amalgamate dual concepts in distributed problem solving, such as bl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Programming

سال: 2012

ISSN: 0956-7968,1469-7653

DOI: 10.1017/s0956796812000238