The higher-order aggregate update problem

Christos Dimoulas*, Mitchell Wand

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem. Our solution handles untyped programs, including unrestricted closures and nested arrays. Also, it can handle programs that contain a mix of functional and destructive updates. Correctness of all the analyses and of the transformation itself is proved.

Original languageEnglish (US)
Title of host publicationVerification, Model Checking, and Abstract Interpretation - 10th International Conference, VMCAI 2009, Proceedings
Pages44-58
Number of pages15
DOIs
StatePublished - Jan 27 2009
Event10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2009 - Savannah, GA, United States
Duration: Jan 18 2009Jan 20 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5403 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2009
CountryUnited States
CitySavannah, GA
Period1/18/091/20/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The higher-order aggregate update problem'. Together they form a unique fingerprint.

Cite this