Skip header Section
Skip Bibliometrics Section
Abstract interpretation of declarative languagesOctober 1987
- Editors:
- S. Abramsky,
- C. Hankin
Abstract
No abstract available.
Cited By
- Di Pierro A, Hankin C and Wiklicky H Probabilistic semantics and program analysis Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems, (1-42)
- Di Pierro A, Hankin C and Wiklicky H Abstract interpretation for worst and average case analysis Program analysis and compilation, theory and practice, (160-174)
- Dreyer D A type system for well-founded recursion Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (293-305)
- Dreyer D (2004). A type system for well-founded recursion, ACM SIGPLAN Notices, 39:1, (293-305), Online publication date: 1-Jan-2004.
- PăźSăźReanu C, Dwyer M and Visser W (2003). Finding feasible abstract counter-examples, International Journal on Software Tools for Technology Transfer (STTT), 5:1, (34-48), Online publication date: 1-Nov-2003.
- Ait-Ameur Y, Bel G, Boniol F, Pairault S and Wiels V (2003). Robustness analysis of avionics embedded systems, ACM SIGPLAN Notices, 38:7, (123-132), Online publication date: 11-Jul-2003.
- Ait-Ameur Y, Bel G, Boniol F, Pairault S and Wiels V Robustness analysis of avionics embedded systems Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems, (123-132)
- Lacey D, Jones N, Van Wyk E and Frederiksen C Proving correctness of compiler optimizations by temporal logic Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (283-294)
- Codish M and Søndergaard H Meta-circular abstract interpretation in prolog The essence of computation, (109-134)
- Lacey D, Jones N, Van Wyk E and Frederiksen C (2002). Proving correctness of compiler optimizations by temporal logic, ACM SIGPLAN Notices, 37:1, (283-294), Online publication date: 1-Jan-2002.
- Katayama T Evolutionary domains Proceedings of the 4th International Workshop on Principles of Software Evolution, (107-113)
- Roberts G (2001). The derivation of functional equivalents of imperative programs, Australian Computer Science Communications, 23:1, (171-176), Online publication date: 1-Jan-2001.
- Köller J and Mohnen M Efficient abstract interpretation using component-wise homomorphisms Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming, (226-234)
- Chow J, Cheng J, Chang D and Xu J Index Design for Structured Documents Based on Abstraction Proceedings of the Sixth International Conference on Database Systems for Advanced Applications, (89-96)
- Bailey J and Poulovassilis A (1999). Abstract Interpretation for Termination Analysis in Functional Active Databases, Journal of Intelligent Information Systems, 12:2-3, (243-273), Online publication date: 2-Apr-1999.
- Shombert L and Sheppard J (1998). A Behavior Model for Next Generation Test Systems, Journal of Electronic Testing: Theory and Applications, 13:3, (299-314), Online publication date: 1-Dec-1998.
- Dwyer M and Pasareanu C (1998). Filter-based model checking of partial systems, ACM SIGSOFT Software Engineering Notes, 23:6, (189-202), Online publication date: 1-Nov-1998.
- Dwyer M and Pasareanu C Filter-based model checking of partial systems Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering, (189-202)
- Schmidt D (1998). Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, 10:3, (237-271), Online publication date: 1-May-1998.
- Yoshioka N, Suzuki M and Katayama T Incremental Software Development Method Based on Abstract Interpretation Proceedings of the 9th international workshop on Software specification and design
- Schmidt D Data flow analysis is model checking of abstract interpretations Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (38-48)
- Yi K, Ryu S and Pyun K Estimating Uncaught Exceptions in Standard ML Programs from Type-Based Equations Proceedings of the 20th Conference on Computer Software and Applications
- Buneman P, Davidson S, Hart K, Overton G and Wong L A Data Transformation System for Biological Data Sources Proceedings of the 21th International Conference on Very Large Data Bases, (158-169)
- Chen L and Harrison W An efficient approach to computing fixpoints for complex program analysis Proceedings of the 8th international conference on Supercomputing, (98-106)
- Huelsbergen L, Larus J and Aiken A (1994). Using the run-time sizes of data structures to guide parallel-thread creation, ACM SIGPLAN Lisp Pointers, VII:3, (79-90), Online publication date: 1-Jul-1994.
- Huelsbergen L, Larus J and Aiken A Using the run-time sizes of data structures to guide parallel-thread creation Proceedings of the 1994 ACM conference on LISP and functional programming, (79-90)
- AIT-AMEUR Y Predicting operational behaviour of abstract programs during formal developments Proceedings of the 7th international workshop on Software specification and design, (172-181)
- Amato G, Giannotti F and Mainetto G Data Sharing Analysis for a Database Programming Lanaguage via Abstract Interpretation Proceedings of the 19th International Conference on Very Large Data Bases, (405-415)
- Yi K and Harrison W Automatic generation and management of interprocedural program analyses Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (246-259)
- Park Y and Goldberg B (1991). Reference escape analysis, ACM SIGPLAN Notices, 26:9, (178-189), Online publication date: 1-Sep-1991.
- Hunt S and Sands D (1991). Binding time analysis, ACM SIGPLAN Notices, 26:9, (154-165), Online publication date: 1-Sep-1991.
- Consel C and Khoo S (1991). Parameterized partial evaluation, ACM SIGPLAN Notices, 26:6, (92-106), Online publication date: 1-Jun-1991.
- Launchbury J (1991). Strictness and binding-time analyses, ACM SIGPLAN Notices, 26:6, (80-91), Online publication date: 1-Jun-1991.
- Park Y and Goldberg B Reference escape analysis Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (178-189)
- Hunt S and Sands D Binding time analysis Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (154-165)
- Consel C and Khoo S Parameterized partial evaluation Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (92-106)
- Launchbury J Strictness and binding-time analyses Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (80-91)
- Hudak P and Young J (1991). Collecting interpretations of expressions, ACM Transactions on Programming Languages and Systems, 13:2, (269-290), Online publication date: 1-Apr-1991.
- Abramsky S and Jensen T A relational approach to strictness analysis for higher-order polymorphic functions Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (49-54)
- Consel C Binding time analysis for high order untyped functional languages Proceedings of the 1990 ACM conference on LISP and functional programming, (264-272)
- Jones S and Le Métayer D Compile-time garbage collection by sharing analysis Proceedings of the fourth international conference on Functional programming languages and computer architecture, (54-74)
- Bloss A Update analysis and the efficient implementation of functional aggregates Proceedings of the fourth international conference on Functional programming languages and computer architecture, (26-38)
- Jouvelot P and Gifford D (1989). Reasoning about continuations with control effects, ACM SIGPLAN Notices, 24:7, (218-226), Online publication date: 1-Jul-1989.
- Jouvelot P and Gifford D Reasoning about continuations with control effects Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (218-226)
- Wadler P Strictness analysis aids time analysis Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (119-132)
- Hudak P and Young J A collecting interpretation of expressions Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (107-118)
Index Terms
- Abstract interpretation of declarative languages
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Abstract Interpretation of Indexed Grammars
Static AnalysisAbstractIndexed grammars are a generalization of context-free grammars and recognize a proper subset of context-sensitive languages. The class of languages recognized by indexed grammars are called indexed languages and they correspond to the languages ...
Using Template Haskell for Abstract Interpretation
Metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile time. Our aim ...