Symbolic execution in algorithm design

Authors:
David Steier;Elaine Kant
Affiliations:
Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania;Schlumberger-Doll Research, Ridgefield, CT and Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Year:
1985

Citing 10
Cited 0

Naive algorithm design techniques—a case study

Selected and updated papers from the proceedings of the 1982 European conference on Progress in artificial intelligence
The Roles of Execution and Analysis in Algorthm Design

IEEE Transactions on Software Engineering - Special issue on artificial intelligence and software engineering
Mechanical program analysis

Communications of the ACM
A Computer Model of Skill Acquisition

A Computer Model of Skill Acquisition
SELECT—a formal system for testing and debugging programs by symbolic execution

Proceedings of the international conference on Reliable software
Automatic Analysis of the Logical Structure of Programs

Automatic Analysis of the Logical Structure of Programs
Applications of Symbolic Execution to Program Testing

Computer
A System to Generate Test Data and Symbolically Execute Programs

IEEE Transactions on Software Engineering
Symbolic Evaluation and the Analysis of Programs

IEEE Transactions on Software Engineering
Symbolic Testing and the DISSECT Symbolic Evaluation System

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symbolic execution of partial algorithm descriptions is a powerful method of guiding the algorithm design process (as is borne out by studying protocols of human algorithm designers).yet the role of symbolic execution in algorithm design has not been closely examined, despite the work on symbolic execution of complete programs as an aid in the validation of software. In the control of the DESIGNER project we have developed data-flow language for representing partially designed algorithms and a process for symbolically executing data-flow configurations that can discover useful knowledge to guide design. The techniques described here contribute significantly towards our goal of building a fully automated algorithm design system.