• DOI:10.1145/1168857.1168907
Corpus ID: 15367706

Combinatorial sketching for finite programs

@inproceedings{SolarLezama2006CombinatorialSF,
  title={Combinatorial sketching for finite programs},
  author={Armando Solar-Lezama and Liviu Tancau and Rastislav Bod{\'i}k and Sanjit A. Seshia and Vijay A. Saraswat},
  booktitle={ASPLOS XII},
  year={2006}
}

Armando Solar-Lezama, Liviu Tancau, +2 authors Vijay A. Saraswat

Published in ASPLOS XII 2006

Computer Science

Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate specification of the desired functionality. The synthesizer then completes the sketch to behave like the specification. The correctness of the synthesized implementation is guaranteed by the compiler, which allows, among other benefits, rapid development of highly tuned implementations without the fear of introducing bugs.We develop SKETCH, a language for finite programs… CONTINUE READING

View on ACM

Alternate Sources

Save to Library

Create Alert

Cite

Launch Research Feed

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv