ACM Home Page
Please provide us with feedback. Feedback
A scalable method for deductive generalization in the spreadsheet paradigm
Full text PdfPdf (2.31 MB)
Source ACM Transactions on Computer-Human Interaction (TOCHI) archive
Volume 9 ,  Issue 4  (December 2002) table of contents
Pages: 253 - 284  
Year of Publication: 2002
ISSN:1073-0516
Authors
Margaret Burnett  Oregon State University, Corvallis, OR
Sherry Yang  Oregon Institute of Technology, Klamath Falls, OR
Jay Summet  Oregon State University, Atlanta, GA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 39,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/586081.586083
What is a DOI?

ABSTRACT

In this paper, we present an efficient method for automatically generalizing programs written in spreadsheet languages. The strategy is to do generalization through incremental analysis of logical relationships among concrete program entities from the perspective of a particular computational goal. The method uses deductive dataflow analysis with algebraic back-substitution rather than inference with heuristics, and there is no need for generalization-related dialog with the user. We present the algorithms and their time complexities and show that, because the algorithms perform their analyses incrementally, on only the on-screen program elements rather than on the entire program, the method is scalable. Performance data is presented to help demonstrate the scalability.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Ambler, A. 1999. The Formulate visual programming language. Dr. Dobb's Journal 24, 8, 21--28.
 
2
Ambler, A. and Hsia, Y. 1993. Generalizing selection in by-demonstration programming. J. Vis. Lang. Comput. 4, 3, 283--300.
 
3
Burnett, M. and Ambler, A. 1994. Interactive visual data abstraction in a declarative visual programming language. J. Vis. Lang. Comput. 5, 1, 29--60.
 
4
 
5
 
6
7
 
8
Burnett, M., Yang, S., and Summet, J. 2001b. A Scalable Method for Deductive Generalization in the Spreadsheet Paradigm. Technical Rep. TR 01-60-02, Oregon State University, Corvallis, Ore; http://www.cs.orst.edu/∼burnett/reprints.html.
 
9
 
10
11
 
12
Heger, N., Cypher, A., and Smith, D. 1998. Cocoa at the Visual Programming Challenge 1997. J. Vis. Lang. Comput. 9, 2, 151--169.
 
13
 
14
Kahn, K. 1996. ToonTalk---An animated programming environment for children. J. Vis. Lang. Comput. 7, 2, 197--217.
15
 
16
 
17
18
19
 
20
 
21
22
 
23
Myers, B. and Maulsby, D. 1993. Glossary. In Watch What I Do: Programming by Demonstration, A. Cypher, Ed. MIT Press, Cambridge, Mass., 593--603.
 
24
25
 
26
 
27
 
28
Sassin, M. 1994. Creating user-intended programs with programming by demonstration. In Proceedings of the IEEE Symposium on Visual Languages (St. Louis, Mo, Oct. 4--7, 1994). IEEE Computer Society Press, Los Alamitos, Calif., 153--160.
 
29
Smith, D. 1975. Pygmalion: a computer program to model and stimulate creative thought, Ph.D. dissertation, Stanford University, Stanford Calif. 1975. (A more accessible summary of this work can be found in Cypher, A. 1993. Watch What I Do: Programming by Demonstration. MIT Press, Cambridge, Mass.)
30
31
 
32
33
34
 
35
Yang, S. and Burnett, M. 1994. From concrete forms to generalized abstractions through perspective-oriented analysis of logical relationships. In Proceedings of the IEEE Symposium on Visual Languages (St. Louis, Mo., Oct. 4--7, 1994). IEEE Computer Society Press, Los Alamitos, Calif., 6--14.


Collaborative Colleagues:
Margaret Burnett: colleagues
Sherry Yang: colleagues
Jay Summet: colleagues