Automatic data structure choice in a language of very high level
Communications of the ACM
Automatic data structure selection in SETL
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Automatic coding: choice of data structures.
Automatic coding: choice of data structures.
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Artificial intelligence and software engineering
ICSE '87 Proceedings of the 9th international conference on Software Engineering
Software evolution through iterative prototyping
ICSE '92 Proceedings of the 14th international conference on Software engineering
Towards increased productivity of algorithm implementation
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
An efficient representation for sparse sets
ACM Letters on Programming Languages and Systems (LOPLAS)
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Processing sets on a SIMD machine
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Program Transformation Systems
ACM Computing Surveys (CSUR)
An Automatic Technique for Selection of Data Representations in SETL Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transformational Derivation of a Garbage Collection Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experience with the SETL Optimizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Assessing Test Data Adequacy through Program Inference
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inline expansion of SETL procedures
ACM SIGPLAN Notices
Synthesizing abstract data type specifications
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Transformational programming: applications to algorithms and systems
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic data structure selection in SETL
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Paragon: Novel uses of type hierarchies for data abstraction
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
HOPE: An experimental applicative language
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Data abstraction from a programming language viewpoint
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
An automatic programming system to support an experimental science
ICSE '82 Proceedings of the 6th international conference on Software engineering
The NYU Ada translator and interpreter
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
ACM '79 Proceedings of the 1979 annual conference
The NYU Ada translator and interpreter
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
Hierarchical design and efficient implementation in SETL: a case study
ACM SIGPLAN Notices
Transformational Derivation of an Improved Alias Analysis Algorithm
Higher-Order and Symbolic Computation
Chameleon: adaptive selection of collections
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Verified abstractions on developers' desks
International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Sets with cardinality constraints in satisfiability modulo theories
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Collections, cardinalities, and relations
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Concurrent data representation synthesis
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
An introduction to data representation synthesis
Communications of the ACM
Hi-index | 0.02 |
“Pure” SETL is a language of very high level allowing algorithms to be programmed rapidly and succintly. SETL's representation sublanguage adds a system of declarations which allow the user of the language to control the data structures that will be used to implement an algorithm which has already been written in pure SETL, so as to improve its efficiency. Ideally no rewriting of the algorithm should be necessary. The facilities provided by the representation sublanguage and the run-time data structures that it can generate are described; based on this a heuristic which uses some of the methods of global program analysis and which should be capable of selecting an acceptably efficient representation automatically is given.