Abstract Interpretation as a Programming Language
نویسندگان
چکیده
منابع مشابه
Abstract Interpretation as a Programming Language
In David Schmidts PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators. The semantics itself can be seen as a program and one may examine different programming styles and ways to represent states. Abstract interpretation is primaril...
متن کاملIntuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language
It is well-known that concepts and methods of logic (more specifically constructive logic) occupy a central place in computer science. While it is quite common to identify ‘logic’ with ‘first-order logic’ (FOL), a careful examination of the various applications of logic in computer science reveals that FOL is insufficient for most of them, and that its most crucial shortcoming is its inability ...
متن کاملAbstract Interpretation of Linear Logic Programming
Linear Logic is gaining momentum in computer science because it ooers a uniied framework and a common vocabulary for studying and analyzing diierent aspects of programming and computation. We focus here on models where computation is identiied with proof search in the sequent system of Linear Logic. A proof normalization procedure, called \focusing", has been proposed to make the problem of pro...
متن کاملAbstract interpretation as anti-refinement
This article shows a correspondence between abstract interpretation of imperative programs and the refinement calculus: in the refinement calculus, an abstract interpretation of a program is a specification which is a function. This correspondence can be used to guide the design of mechanically verified static analyses, keeping the correctness proof well separated from the heuristic parts of th...
متن کاملStatic Analysis by Abstract Interpretation: A Mathematical Programming Approach
Static analysis of a computer program by abstract interpretation helps prove behavioural properties of the program. Programs are defined by means of a forward collecting semantics function relating the values of the program variables during the execution of the program. The least fixed point of the semantics function is a program invariants providing useful information about the program’s behav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.129.7