Topic
Strictness analysis
About: Strictness analysis is a research topic. Over the lifetime, 203 publications have been published within this topic receiving 4291 citations.
Papers published on a yearly basis
Papers
Book•
1 Oct 1987
TL;DR: Book of abstract interpretation of declarative languages, as an amazing reference becomes what you need to get, when you have no idea about this book, it will be better for you to try reading this book.
Abstract: Interpretation Of Declarative Languages New updated! The latest book from a very famous author finally comes out. Book of abstract interpretation of declarative languages, as an amazing reference becomes what you need to get. What's for is this book? Are you still thinking for what the book is? Well, this is what you probably will get. You should have made proper choices for your better life. Book, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with. This is one of the ways when you have no fiend at that time; make the book as your true friend. Even this is not kind of talk-active thing, you can make new mind and get new inspirations from the book. From the literary book, you can gain the entertainment as when you watch the movie. Well, talking about the books, actually what kind of book that we will recommend? Have you heard about abstract interpretation of declarative languages? Yes, this is good news to know that abstract interpretation of declarative languages has revealed again. Many people have been waiting for this author works. Even this is not in your favourite book, it will not be that fault to try reading it. Why should be doubt to get the new book recommendation? We always refer a book that can be required for all people. So this way, when you need to know more about the abstract interpretation of declarative languages that has been provided in this website, you must join to the link that we all recommend. After getting some reasons of how this abstract interpretation of declarative languages, you must feel that it is very proper for you. But, when you have no idea about this book, it will be better for you to try reading this book. After reading page by page in only your spare time, you can see how this abstract interpretation of declarative languages will work for your life. Popular Books Similar With Abstract Interpretation Of Declarative Languages Are Listed Below: ab str ac t i nt er pr eta tio n o f d ec lar at ive l ng ua ge s PDF File : Abstract Interpretation Of Declarative Languages Page : 1
374 citations
1 Oct 1987
TL;DR: This paper shows how contexts can be represented using the notion of projection from domain theory, which means that recursive context equations can be solved using standard fixpoint techniques, instead of the algebraic manipulation previously used.
Abstract: Contexts have been proposed as a means of performing strictness analysis on non-flat domains. Roughly speaking, a context describes how much a sub-expression will be evaluated by the surrounding program. This paper shows how contexts can be represented using the notion of projection from domain theory. This is clearer than the previous explanation of contexts in terms of continuations. In addition, this paper describes finite domains of contexts over the non-flat list domain. This means that recursive context equations can be solved using standard fixpoint techniques, instead of the algebraic manipulation previously used.
206 citations
14 Sep 1987
TL;DR: The three instruction machine Tim is described, an abstract machine for the execution of supercombinators that usually executes programmes faster than the G-machine style of abstract machine while being at least as easy to implement as an S-K combinator reducer.
Abstract: This paper is a description of the three instruction machine Tim, an abstract machine for the execution of supercombinators. Tim usually executes programmes faster than the G-machine style of abstract machine while being at least as easy to implement as an S-K combinator reducer. It has a lower overhead for passing unevaluated arguments than the G-machine, resulting in good performance even without strictness analysis, and is probably easier to implement in hardware.
168 citations
16 May 1994
TL;DR: A set-theoretic abstract interpretation framework is formulated in a way which is independent of both the programming language and the method used to specify its semantics, starting from its standard denotational semantics.
Abstract: The original formulation of abstract interpretation represents program properties by sets. A property is understood as the set of semantic values satisfying it. Strongest program properties are defined by the collecting semantics which extends the standard semantics to powersets of semantic values. The approximation relation corresponding to the logical implication of program properties is subset inclusion. This was expressed using set and lattice theory in the context of transition systems. Some applications of abstract interpretation, such as strictness analysis for lazy functional languages, require infinite behaviours of higher-order functions to be taken into account. We solve the problem by returning to the sources of abstract interpretation, which consists in considering collecting semantics. By using Galois connections, properties of the standard semantics naturally transfer to the collecting and then to the abstract semantics. This set-theoretic abstract interpretation framework is formulated in a way which is independent of both the programming language and the method used to specify its semantics. It is illustrated for a higher-order monomorphically typed lazy functional language starting from its standard denotational semantics. >
156 citations
1 Jan 1986
TL;DR: Data or program flow analysis is concerned with the static analysis of programs, to obtain as much information as possible about their possible run time behavior without actually having to run the programs.
Abstract: Data or program flow analysis is concerned with the static analysis of programs, to obtain as much information as possible about their possible run time behavior without actually having to run the programs. Due to the unsolvability of the halting problem (and nearly any other question concerning program behavior), such analyses are necessarily only approximate whenever the analysis algorithm is guaranteed to terminate. Further, exact analysis may be impossible due to the lack of knowledge of input data values, so the analysis can at best yield information about sets of possible computations.
147 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2015 | 3 |
| 2014 | 2 |
| 2013 | 3 |
| 2012 | 3 |
| 2011 | 1 |
| 2010 | 4 |