Bridging boolean and quantitative synthesis using smoothed proof search
We present a new technique for parameter synthesis under boolean and quantitative objectives. The input to the technique is a "sketch" --- a program with missing numerical parameters --- and a probabilistic assumption about the program's inputs. The goal is to automatically synthesize...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2014-10-09T18:40:13Z.
|
| Subjects: | |
| Online Access: | Get fulltext |