Article

Improving the static analysis of embedded languages via partial evaluation

Authors:

Philippe MeunierAuthors Info & Claims

ICFP '04: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming

Pages 16 - 27

https://doi.org/10.1145/1016850.1016857

Published: 19 September 2004 Publication History

Abstract

Programs in embedded languages contain invariants that are not automatically detected or enforced by their host language. We show how to use macros to easily implement partial evaluation of embedded interpreters in order to capture invariants encoded in embedded programs and render them explicit in the terms of their host language. We demonstrate the effectiveness of this technique in improving the results of a value flow analysis.

References

[1]

H. Abelson and G. J. Sussman. The Structure and Interpretation of Computer Programs. MIT Press, Cambridge, MA, 1985.]]

Digital Library

[2]

A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79-111, 1999.]]

Digital Library

[3]

K. Arnold, J. Gosling, and D. Holmes. The Java Programming Language. Addison-Wesley, 3d edition, 2000.]]

Digital Library

[4]

L. Augustsson. Cayenne-a language with dependent types. In Proceedings of the third ACM SIGPLAN international conference on Functional programming, pages 239--250. ACM Press, 1998.]]

Digital Library

[5]

K. Backhouse. Abstract Interpretation of Domain-Specific Embedded Languages. PhD thesis, Oxford University, 2002.]]

[6]

N. H. Christensen. Domain-specific languages in software development - and the relation to partial evaluation. PhD thesis, DIKU, Dept. of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark, July 2003.]]

[7]

O. Danvy. Functional unparsing. Journal of Functional Programming, 8(6):621--625, 1998.]]

Digital Library

[8]

C. Elliott, S. Finne, and O. de Moor. Compiling embedded languages. In SAIG, pages 9--27, 2000.]]

Digital Library

[9]

R. B. Findler, J. Clements, M. F. Cormac Flanagan, S. Krishnamurthi, P. Steckler, and M. Felleisen. DrScheme: A progamming environment for scheme. Journal of Functional Programming, 12(2):159--182, March 2002.]]

Digital Library

[10]

C. Flanagan and M. Felleisen. Componential set-based analysis. ACM Trans. on Programming Languages and Systems, 21(2):369--415, Feb. 1999.]]

Digital Library

[11]

M. Flatt. Composable and compilable macros: you want it when? In Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 72--83. ACM Press, 2002.]]

Digital Library

[12]

P. Graunke, S. Krishnamurthi, S. V. D. Hoeven, and M. Felleisen. Programming the web with high-level programming languages. In Programming Languages and Systems, 10th European Symposium on Programming, ESOP 2001, Proceedings, volume 2028 of Lecture Notes in Computer Science, pages 122--136, Berlin, Heidelberg, and New York, 2001. Springer-Verlag.]]

Digital Library

[13]

N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie-Mellon Univ., Pittsburgh, PA, Oct. 1992.]]

Digital Library

[14]

R. Hinze. Formatting: a class act. Journal of Functional Programming, 13(5):935--944, 2003.]]

Digital Library

[15]

P. Hudak. Modular domain specific languages and tools. In Proceedings of Fifth International Conference on Software Reuse, pages 134--142, June 1998.]]

Digital Library

[16]

S. N. Kamin. Research on domain-specific embedded languages and program generators. In R. Cleaveland, M. Mislove, and P. Mulry, editors, Electronic Notes in Theoretical Computer Science, volume 14. Elsevier, 2000.]]

[17]

R. Kelsey, W. Clinger, and J. R. {editors}. Revised 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7--104, August 1998. Also appeared in SIGPLAN Notices 33:9, September 1998.]]

Digital Library

[18]

B. W. Kernighan and D. M. Ritchie. The C programming language. Prentice Hall Press, 1988.]]

Digital Library

[19]

X. Leroy. The Objective Caml System, release 3.07, 2003. http://caml.inria.fr/ocaml/htmlman.]]

[20]

P. Meunier. http://www.plt-scheme.org/software/mrflow.]]

[21]

M. Neubauer, P. Thiemann, M. Gasbichler, and M. Sperber. Functional logic overloading. In Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 233--244. ACM Press, 2002.]]

Digital Library

[22]

J. Palsberg. Closure analysis in constraint form. Proc. ACM Trans. on Programming Languages and Systems, 17(1):47--62, Jan. 1995.]]

Digital Library

[23]

M. Serrano and P. Weis. Bigloo: A portable and optimizing compiler for strict functional languages. In Static Analysis Symposium, pages 366--381, 1995.]]

Digital Library

[24]

O. Shivers. A universal scripting framework, or Lambda: the ultimate "little language". In Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, pages 254--265. Springer-Verlag, 1996.]]

Digital Library

[25]

G. L. Steele. COMMON LISP: the language. Digital Press, 12 Crosby Drive, Bedford, MA 01730, USA, 1984. With contributions by Scott E. Fahlman and Richard P. Gabriel and David A. Moon and Daniel L. Weinreb.]]

Digital Library

[26]

B. Stroustrup. The C++ Programming Language, Third Edition. Addison-Wesley Longman Publishing Co., Inc., 1997.]]

Digital Library

[27]

T. L. Veldhuizen. C++ templates as partial evaluation. In Partial Evaluation and Semantic-Based Program Manipulation, pages 13--18, 1999.]]

[28]

N. Welsh, F. Solsona, and I. Glover. SchemeUnit and SchemeQL: Two little languages. In Proceedings of the Third Workshop on Scheme and Functional Programming, 2002.]]

Cited By

Kent AKempe DTobin-Hochstadt S(2016)Occurrence typing modulo theoriesACM SIGPLAN Notices10.1145/2980983.290809151:6(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2980983.2908091
Kent AKempe DTobin-Hochstadt SKrintz CBerger E(2016)Occurrence typing modulo theoriesProceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2908080.2908091(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2908080.2908091
Culpepper RFelleisen M(2010)Debugging hygienic macrosScience of Computer Programming10.1016/j.scico.2009.06.00175:7(496-515)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.1016/j.scico.2009.06.001
Show More Cited By

Index Terms

Improving the static analysis of embedded languages via partial evaluation
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Software defect analysis
        Software testing and debugging
  2. Software notations and tools
    1. Compilers
      1. Interpreters
      2. Source code generation
    2. General programming languages
      1. Language features

Recommendations

Macros for domain-specific languages

Macros provide a powerful means of extending languages. They have proven useful in both general-purpose and domain-specific programming contexts. This paper presents an architecture for implementing macro-extensible DSLs on top of macro-extensible host ...
Improving the static analysis of embedded languages via partial evaluation
ICFP '04

Programs in embedded languages contain invariants that are not automatically detected or enforced by their host language. We show how to use macros to easily implement partial evaluation of embedded interpreters in order to capture invariants encoded in ...
Languages as libraries
PLDI '11

Programming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP '04: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming

September 2004

264 pages

ISBN:1581139055

DOI:10.1145/1016850

General Chair:
Chris Okasaki
United States Military Academy, West Point
,
Program Chair:
Kathleen Fisher
AT&T Labs Research

ACM SIGPLAN Notices Volume 39, Issue 9
ICFP '04
September 2004
254 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1016848
Issue’s Table of Contents

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 September 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICFP04

Sponsor:

ICFP04: ACM SIGPLAN International Conference on Functional Programming

September 19 - 21, 2004

UT, Snow Bird, USA

Acceptance Rates

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
260
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kent AKempe DTobin-Hochstadt S(2016)Occurrence typing modulo theoriesACM SIGPLAN Notices10.1145/2980983.290809151:6(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2980983.2908091
Kent AKempe DTobin-Hochstadt SKrintz CBerger E(2016)Occurrence typing modulo theoriesProceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2908080.2908091(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2908080.2908091
Culpepper RFelleisen M(2010)Debugging hygienic macrosScience of Computer Programming10.1016/j.scico.2009.06.00175:7(496-515)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.1016/j.scico.2009.06.001
Culpepper RFelleisen MConsel CLawall J(2007)Debugging macrosProceedings of the 6th international conference on Generative programming and component engineering10.1145/1289971.1289994(135-144)Online publication date: 1-Oct-2007
https://dl.acm.org/doi/10.1145/1289971.1289994
Kent AKempe DTobin-Hochstadt S(2016)Occurrence typing modulo theoriesACM SIGPLAN Notices10.1145/2980983.290809151:6(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2980983.2908091
Kent AKempe DTobin-Hochstadt SKrintz CBerger E(2016)Occurrence typing modulo theoriesProceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2908080.2908091(296-309)Online publication date: 2-Jun-2016
https://dl.acm.org/doi/10.1145/2908080.2908091

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents