• Home
  • Search
  • Synthesizing data structure manipulations from storyboards
  • Open Access IconOpen Access
  • Cite Icon132
  • https://doi.org/10.1145/2025113.2025153Copy DOI Icon

Synthesizing data structure manipulations from storyboards

  • Sep 9, 2011
  • Rishabh Singh +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present the Storyboard Programming framework, a new synthesis system designed to help programmers write imperative low-level data-structure manipulations. The goal of this system is to bridge the gap between the boxes-and-arrows diagrams that programmers often use to think about data-structure manipulation algorithms and the low-level imperative code that implements them. The system takes as input a set of partial input-output examples, as well as a description of the high-level structure of the desired solution. From this information, it is able to synthesize low-level imperative implementations in a matter of minutes.The framework is based on a new approach for combining constraint-based synthesis and abstract-interpretation-based shape analysis. The approach works by encoding both the synthesis and the abstract interpretation problem as a constraint satisfaction problem whose solution defines the desired low-level implementation. We have used the framework to synthesize several data-structure manipulations involving linked lists and binary search trees, as well as an insertion operation into an And Inverter Graph.

Similar Papers
  • Conference Article
  • Citations12

Deletion without Rebalancing in Non-Blocking Binary Search Trees

  • Jan 01, 2017
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Meng He +1
  • Research Article
  • Citations25

Natural synthesis of provably-correct data-structure manipulations

  • Oct 12, 2017
  • Proceedings of the ACM on Programming Languages
  • Xiaokang Qiu +1
  • Research Article

Adaptive Binary Search Tree for Integers Sets with Few Holes

  • Dec 15, 2024
  • Electrical & Electronic Engineering Research
  • Ruixin Wang +1
  • Conference Article
  • Citations3

Multi-Finger Binary Search Trees

  • Jan 01, 2019
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Parinya Chalermsook +4
  • Conference Article
  • Citations3

Creating a Forest of Binary Search Trees for a Multiprocessor System

  • Sep 13, 2006
  • Suri Pushpa +2
  • Book Chapter
  • Citations10

Efficient Construction of Near-Optimal Binary and Multiway Search Trees

  • Jan 01, 2009
  • Prosenjit Bose +1
  • PDF
  • Research Article
  • Citations6

A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic.

  • Jan 01, 2016
  • Computational intelligence and neuroscience
  • Jin-Peng Qi +2
  • Research Article

Postorder trees and Eulerian numbers

  • Jul 01, 1991
  • Acta Informatica
  • Thomas P Whaley
  • Book Chapter
  • Citations1

Introduction to Binary Trees

  • Dec 31, 2013
  • Noel Kalicharan
  • Conference Article
  • Citations2

Kakkot Tree — A Binary Search Tree with caching

  • Dec 01, 2012
  • Rajesh Ramachandran
  • Research Article
  • Citations1

An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

  • Jun 04, 2008
  • International Journal of Communication Systems
  • Luis Rueda +1
  • Conference Article

Improving efficacy of concurrent internal binary search trees using local recovery

  • Jan 04, 2019
  • Arunmoezhi Ramachandran +1
  • Book Chapter
  • Citations6

On a sublinear time parallel construction of optimal binary search trees

  • Jan 01, 1994
  • Marek Karpinski +1
  • Research Article
  • Citations3

A graph theoretic model of data structures

  • Dec 01, 1972
  • ACM SIGIR Forum
  • Jack Heller +1
  • Conference Article
  • Citations1

A fast method for change point detection from large-scale time series based on Haar Wavelet and Binary Search Tree (HWBST)

  • Jul 01, 2014
  • Jin-Peng Qi +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.