This repository has been archived by the owner on Jun 12, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathreferences.bib
183 lines (168 loc) · 6.57 KB
/
references.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
@article{Knuth1971,
doi = {10.1007/bf00264289},
url = {https://doi.org/10.1007/bf00264289},
year = {1971},
publisher = {Springer Science and Business Media {LLC}},
volume = {1},
number = {1},
pages = {14--25},
author = {D. E. Knuth},
title = {Optimum binary search trees},
journal = {Acta Informatica}
}
@ARTICLE{tidydraw,
author={C. {Wetherell} and A. {Shannon}},
journal={IEEE Transactions on Software Engineering},
title={Tidy Drawings of Trees}, year={1979},
volume={SE-5}, number={5}, pages={514-520}
}
@article{pretty,
author = {Vaucher, Jean G.},
title = {Pretty-printing of trees},
journal = {Software: Practice and Experience},
volume = {10},
number = {7},
pages = {553-561},
keywords = {Tree structures, Tree printing, Layout},
doi = {10.1002/spe.4380100706},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.4380100706},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.4380100706},
abstract = {Abstract A pleasing layout of printed tree structures is difficult to achieve automatically. The paper points out three main problems. First, the horizontal position of a node on the printed page depends on global consideration of the position of other nodes; secondly, the physical characteristics of printers require scanning the tree in left-to-right top-to-bottom sequence; finally, page overflow for wide trees must be handled. These problems are illustrated by analysing the shortcomings of a simple printing algorithm. A suitable general binary tree printing algorithm is presented and its adaptation to other types of trees is shown.},
year = {1980}
}
@article{reingold,
author = {Reingold, E. M. and Tilford, J. S.},
title = {Tidier Drawings of Trees},
year = {1981},
issue_date = {March 1981},
publisher = {IEEE Press},
volume = {7},
number = {2},
issn = {0098-5589},
url = {https://doi.org/10.1109/TSE.1981.234519},
doi = {10.1109/TSE.1981.234519},
journal = {IEEE Trans. Softw. Eng.},
month = mar,
pages = {223–228},
numpages = {6},
keywords = {trees, tree structures, Data structures}
}
@article{nodeposition,
author = {Walker, J. Q.},
title = {A Node-Positioning Algorithm for General Trees},
year = {1990},
issue_date = {July 1990},
publisher = {John Wiley & Sons, Inc.},
address = {USA},
volume = {20},
number = {7},
issn = {0038-0644},
url = {https://doi.org/10.1002/spe.4380200705},
doi = {10.1002/spe.4380200705},
journal = {Softw. Pract. Exper.},
month = jul,
pages = {685–705},
numpages = {21}
}
@MISC{Brüggemann-klein89drawingtrees,
author = {A. Brüggemann-klein and D. Wood},
title = {Drawing trees nicely with TEX},
year = {1989}
}
@Article{complexityoftrees,
author={Supowit, Kenneth J.
and Reingold, Edward M.},
title={The complexity of drawing trees nicely},
journal={Acta Informatica},
year={1983},
month={Jan},
day={01},
volume={18},
number={4},
pages={377-392},
abstract={We investigate the complexity of producing aesthetically pleasing drawings of binary trees, drawings that are as narrow as possible. The notion of what is aesthetically pleasing is embodied in several constraints on the placement of nodes, relative to other nodes. Among the results we give are: (1) There is no obvious ``principle of optimality'' that can be applied, since globally narrow, aesthetic placements of trees may require wider than necessary subtrees. (2) A previously suggested heuristic can produce drawings on n-node trees that are $\Theta$(n) times as wide as necessary. (3) The problem can be reduced in polynomial time to linear programming; hence, if the coordinates assigned to the nodes are continuous variables, then the problem can be solved in polynomial time. (4) If the placement is restricted to the integral lattice then the problem is NP-hard, as is its approximation to within a factor of about 4 per cent.},
issn={1432-0525},
doi={10.1007/BF00289576},
url={https://doi.org/10.1007/BF00289576}
}
@inproceedings{pbe1,
author = {Gulwani, Sumit},
title = {Programming by Examples: Applications, Algorithms, and Ambiguity Resolution},
year = {2017},
isbn = {9781450352918},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3131851.3131853},
doi = {10.1145/3131851.3131853},
booktitle = {Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming},
pages = {2},
numpages = {1},
location = {Namur, Belgium},
series = {PPDP ’17}
}
@article{sketch,
author = {Alur, Rajeev and Singh, Rishabh and Fisman, Dana and Solar-Lezama, Armando},
title = {Search-Based Program Synthesis},
year = {2018},
issue_date = {November 2018},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {61},
number = {12},
issn = {0001-0782},
url = {https://doi.org/10.1145/3208071},
doi = {10.1145/3208071},
journal = {Commun. ACM},
month = nov,
pages = {84–93},
numpages = {10}
}
@inproceedings{nlsynth,
author = {Desai, Aditya and Gulwani, Sumit and Hingorani, Vineet and Jain, Nidhi and Karkare, Amey and Marron, Mark and R, Sailesh and Roy, Subhajit},
title = {Program Synthesis Using Natural Language},
year = {2016},
isbn = {9781450339001},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2884781.2884786},
doi = {10.1145/2884781.2884786},
booktitle = {Proceedings of the 38th International Conference on Software Engineering},
pages = {345–356},
numpages = {12},
location = {Austin, Texas},
series = {ICSE ’16}
}
@inproceedings{10.1145/1706299.1706337,
author = {Srivastava, Saurabh and Gulwani, Sumit and Foster, Jeffrey S.},
title = {From Program Verification to Program Synthesis},
year = {2010},
isbn = {9781605584799},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1706299.1706337},
doi = {10.1145/1706299.1706337},
booktitle = {Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
pages = {313–326},
numpages = {14},
keywords = {proof-theoretic program synthesis, verification},
location = {Madrid, Spain},
series = {POPL ’10}
}
@article{verifysynth,
author = {Srivastava, Saurabh and Gulwani, Sumit and Foster, Jeffrey S.},
title = {From Program Verification to Program Synthesis},
year = {2010},
issue_date = {January 2010},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {45},
number = {1},
issn = {0362-1340},
url = {https://doi.org/10.1145/1707801.1706337},
doi = {10.1145/1707801.1706337},
journal = {SIGPLAN Not.},
month = jan,
pages = {313–326},
numpages = {14},
keywords = {proof-theoretic program synthesis, verification}
}