-
Notifications
You must be signed in to change notification settings - Fork 0
/
projekt-20-literatura-bibliography.bib
597 lines (553 loc) · 19.9 KB
/
projekt-20-literatura-bibliography.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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
@inproceedings{spl2,
author={S. {Gerasimou} and G. {Tamburrelli} and R. {Calinescu}},
booktitle={2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE)},
title={Search-Based Synthesis of Probabilistic Models for Quality-of-Service Software Engineering (T)},
year={2015},
volume={},
number={},
pages={319-330},
keywords={genetic algorithms;probability;program testing;program verification;quality of service;search-based synthesis;probabilistic models;quality-of-service software engineering;formal verification;finite-state probabilistic models;quality-of-service requirements;software design;suboptimal models;EvoChecker search-based software engineering approach;multiobjective optimisation genetic algorithms;dynamic power management;foreign exchange trading;design parameters;QoS requirements;design space;Probabilistic logic;Quality of service;Software systems;Markov processes;Optimization;Software engineering;Probabilistic Model Checking;Model Synthesis;Genetic Algorithms;Search-Based Software Engineering;Model Repair},
ISSN={null},
month={Nov},
}
@article{herman1,
author = {Herman, T.},
title = {Probabilistic Self-Stabilization},
year = {1990},
publisher = {Elsevier North-Holland, Inc.},
address = {USA},
volume = {35},
number = {2},
issn = {0020-0190},
journal = {Inf. Process. Lett.},
pages = {63–67},
numpages = {5}
}
@Article{herman2,
author={M. Kwiatkowska and G. Norman and D. Parker},
title={Probabilistic Verification of {H}erman’s Self-Stabilisation Algorithm},
journal={Formal Aspects of Computing},
year={2012},
volume={24},
number={4},
pages={661-670},
publisher={Springer},
month={},
note={},
key={}
}
@article{pomdp1,
title={Planning and acting in partially observable stochastic domains},
author={Kaelbling, Leslie Pack and Littman, Michael L and Cassandra, Anthony R},
journal={Artificial intelligence},
volume={101},
number={1-2},
pages={99--134},
year={1998},
publisher={Elsevier}
}
@inproceedings{pomdp2,
title={Programmatically interpretable reinforcement learning},
author={Verma, Abhinav and Murali, Vijayaraghavan and Singh, Rishabh and Kohli, Pushmeet and Chaudhuri, Swarat},
booktitle={International Conference on Machine Learning},
pages={5045--5054},
year={2018},
organization={PMLR}
}
@InProceedings{STORM,
author = {Christian Dehnert and
Sebastian Junges and
Joost-Pieter Katoen and
Matthias Volk},
title = {A {Storm} is Coming: A Modern Probabilistic Model Checker},
booktitle = {CAV},
series = {LNCS},
volume = {10427},
pages = {592--600},
publisher = {Springer},
year = {2017}
}
@inproceedings{KNP11,
title={{PRISM} 4.0: Verification of probabilistic real-time systems},
author={Kwiatkowska, Marta and Norman, Gethin and Parker, David},
booktitle={CAV},
pages={585--591},
year={2011},
organization={Springer},
series = {LNCS},
volume = {6806}
}
@article{onebyone,
title={Model checking software product lines with {SNIP}},
author={Andreas Classen and Maxime Cordy and Patrick Heymans and Axel Legay and Pierre-Yves Schobbens},
journal={Int.\ J.\ on Softw.\ Tools for Technol. Transf.},
year={2012},
volume={14},
pages={589-612}
}
@article{allinone,
author = {Classen, Andreas and Cordy, Maxime and Heymans, Patrick and Legay, Axel and Schobbens, Pierre Yves},
year = {2014},
month = {02},
pages = {416–439},
title = {Formal semantics, modular specification, and symbolic verification of product-line behaviour},
volume = {80},
journal = {Science of Computer Programming},
}
@inproceedings{tacas21,
title="Inductive Synthesis for Probabilistic Programs Reaches New Horizons",
author="Andriushchenko, Roman
and {\v{C}}e\v{s}ka, Milan
and Junges, Sebastian
and Katoen, Joost-Pieter",
booktitle = "TACAS",
series = "Lecture Notes in Computer Science",
year="2021",
publisher = {Springer},
note = "(to appear, see \url{https://arxiv.org/abs/2101.12683})"
}
@mastersthesis{roman-DP,
author = "Ing. Roman Andriuschchenko",
title = "Computed-Aided Synthesis of Probabilistic Models",
school = "BUT, FIT",
year = "2020",
location = "Brno, CZ",
language = "english",
url = "https://www.vutbr.cz/studenti/zav-prace/detail/129318"
}
@InProceedings{cegis,
author="{\v{C}}e{\v{s}}ka, Milan
and Hensel, Christian
and Junges, Sebastian
and Katoen, Joost-Pieter",
title="Counterexample-Driven Synthesis for Probabilistic Program Sketches",
booktitle = {{FM}},
series = {LNCS},
volume = {11800},
pages = {101--120},
publisher = {Springer},
year = {2019}
}
@InProceedings{cegar,
author="{\v{C}}e{\v{s}}ka, Milan
and Jansen, Nils
and Junges, Sebastian
and Katoen, Joost-Pieter",
title="Shepherding Hordes of Markov Chains",
booktitle = {{TACAS}},
series = {LNCS},
volume = {11428},
pages = {172--190},
publisher = {Springer},
year = {2019}
}
@article{ceska2014robustness,
author={{\v{C}}e{\v{s}}ka, Milan and \v{S}afr{\'{a}}nek, David and Dra{\v{z}}an, Sven and Brim, Lubo{\v{s}}},
journal={PLOS ONE},
publisher={Public Library of Science},
title={Robustness Analysis of Stochastic Biochemical Systems},
year={2014},
month={04},
volume={9},
pages={1-23},
number={4},
}
@inproceedings{pathak-et-al-nfm-2015,
author = {Shashank Pathak and
Erika {\'{A}}brah{\'{a}}m and
Nils Jansen and
Armando Tacchella and
Joost-Pieter Katoen},
title = {A Greedy Approach for the Efficient Repair of Stochastic Models},
booktitle = {{NFM'15}},
series = {LNCS},
volume = {9058},
pages = {295--309},
publisher = {Springer},
year = {2015}
}
@InProceedings{Quatmann2016,
author = {Tim Quatmann and
Christian Dehnert and
Nils Jansen and
Sebastian Junges and
Joost-Pieter Katoen},
title = {Parameter Synthesis for {M}arkov Models: Faster Than Ever},
booktitle = {{ATVA'16}},
series = {LNCS},
volume = {9938},
pages = {50--67},
year = {2016}
}
@InProceedings{oracle1,
author = {Jha, Susmit and Gulwani, Sumit and Seshia, Sanjit A. and Tiwari, Ashish},
title = {Oracle-Guided Component-Based Program Synthesis},
year = {2010},
publisher = {ACM},
booktitle = {ICSE},
pages = {215–224}
}
@article{oracle2,
author = {Susmit Jha and
Sanjit A. Seshia},
title = {A theory of formal synthesis via inductive learning},
journal = {Acta Informatica},
volume = {54},
number = {7},
pages = {693--726},
year = {2017}
}
@inproceedings{jani,
author = {Bornholt, James and Torlak, Emina and Grossman, Dan and Ceze, Luis},
title = {Optimizing Synthesis with Metasketches},
year = {2016},
isbn = {9781450335492},
publisher = {Association for Computing Machinery},
booktitle = {POPL'16},
pages = {775–788},
numpages = {14},
keywords = {Program synthesis},
location = {St. Petersburg, FL, USA}
}
@phdthesis{sketching1,
Author = {Solar Lezama, Armando},
Title = {Program Synthesis By Sketching},
School = {EECS Department, University of California, Berkeley},
Year = {2008},
Month = {Dec},
URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2008/EECS-2008-177.html},
Number = {UCB/EECS-2008-177},
}
@incollection{sygus,
author = {Rajeev Alur and
Rastislav Bod{\'{\i}}k and
Eric Dallal and
Dana Fisman and
Pranav Garg and
Garvit Juniwal and
Hadas Kress{-}Gazit and
P. Madhusudan and
Milo M. K. Martin and
Mukund Raghothaman and
Shambwaditya Saha and
Sanjit A. Seshia and
Rishabh Singh and
Armando Solar{-}Lezama and
Emina Torlak and
Abhishek Udupa},
title = {Syntax-Guided Synthesis},
booktitle = {Dependable Software Systems Engineering},
series = {{NATO} Science for Peace and Security Series},
volume = {40},
pages = {1--25},
publisher = {{IOS} Press},
year = {2015}
}
@article{profeat,
author = {Chrszon, Philipp and Dubslaff, Clemens and Klüppelholz, Sascha and Baier, Christel},
year = {2017},
month = {08},
pages = {},
title = {ProFeat: feature-oriented engineering for family-based probabilistic model checking},
volume = {30},
journal = {Formal Aspects of Computing},
doi = {10.1007/s00165-017-0432-4}
}
@InProceedings{qflan,
author="Vandin, Andrea
and ter Beek, Maurice H.
and Legay, Axel
and Lluch Lafuente, Alberto",
editor="Havelund, Klaus
and Peleska, Jan
and Roscoe, Bill
and de Vink, Erik",
title="QFLan: A Tool for the Quantitative Analysis of Highly Reconfigurable Systems",
booktitle="Formal Methods",
year="2018",
publisher="Springer International Publishing",
address="Cham",
pages="329--337",
isbn="978-3-319-95582-7"
}
@inproceedings{sw-product-lines,
title = "Modeling and Verification for Probabilistic Properties in Software Product Lines",
author = "Rodrigues, {Genaina N.} and Vander Alves and Vinicius Nunes and Andre Lanna and Maxime Cordy and Schobbens, {Pierre Yves} and Sharifloo, {Amir Molzam} and Axel Legay",
doi = "10.1109/HASE.2015.34",
language = "English",
volume = "2015",
pages = "173--180",
booktitle = "Proceedings of IEEE International Symposium on High Assurance Systems Engineering",
publisher = "IEEE Computer Society Press",
edition = "16"
}
@article{pomdp-2,
author = {Nicolas Meuleau and
Kee{-}Eung Kim and
Leslie Pack Kaelbling and
Anthony R. Cassandra},
title = {Solving POMDPs by Searching the Space of Finite Policies},
journal = {CoRR},
volume = {abs/1301.6720},
year = {2013},
archivePrefix = {arXiv},
eprint = {1301.6720},
timestamp = {Mon, 13 Aug 2018 16:48:31 +0200},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{POMDP3,
title={Synthesizing Programmatic Policies that Inductively Generalize},
author={Jeevana Priya Inala and Osbert Bastani and Zenna Tavares and Armando Solar-Lezama},
booktitle={International Conference on Learning Representations},
year={2020},
}
@article{maze,
author = {Gethin Norman and
David Parker and
Xueyi Zou},
title = {Verification and Control of Partially Observable Probabilistic Real-Time
Systems},
journal = {CoRR},
volume = {abs/1506.06419},
year = {2015},
archivePrefix = {arXiv},
eprint = {1506.06419},
}
@inproceedings{DBLP:conf/ictac/Daws04,
author = {Conrado Daws},
title = {Symbolic and Parametric Model Checking of Discrete-Time {M}arkov Chains},
booktitle = {{ICTAC}},
series = {LNCS},
volume = {3407},
pages = {280--294},
publisher = {Springer},
year = {2004}
}
@inproceedings{dehnert2015prophesy,
title={{PROPhESY: A PRObabilistic ParamEter SYNnthesis Tool}},
author={Dehnert, Christian and Junges, Sebastian and Jansen, Nils and Corzilius, Florian and Volk, Matthias and Bruintjes, Harold and Katoen, Joost-Pieter and {\'A}brah{\'a}m, Erika},
booktitle={CAV'15},
series = {LNCS},
volume = {9206},
pages={214--231},
year={2015},
publisher={Springer}
}
@InProceedings{ceska-biochemical,
author="{\v{C}}e{\v{s}}ka, Milan
and Dannenberg, Frits
and Kwiatkowska, Marta
and Paoletti, Nicola",
editor="Mendes, Pedro
and Dada, Joseph O.
and Smallbone, Kieran",
title="Precise Parameter Synthesis for Stochastic Biochemical Systems",
booktitle="Computational Methods in Systems Biology",
year="2014",
publisher="Springer International Publishing",
address="Cham",
pages="86--98",
isbn="978-3-319-12982-2"
}
@InProceedings{model-repair-usage,
author="Bartocci, Ezio
and Grosu, Radu
and Katsaros, Panagiotis
and Ramakrishnan, C. R.
and Smolka, Scott A.",
editor="Abdulla, Parosh Aziz
and Leino, K. Rustan M.",
title="Model Repair for Probabilistic Systems",
booktitle="Tools and Algorithms for the Construction and Analysis of Systems",
year="2011",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="326--340",
isbn="978-3-642-19835-9"
}
@inproceedings{10.1145/2837614.2837617,
author = {Long, Fan and Rinard, Martin},
title = {Automatic Patch Generation by Learning Correct Code},
year = {2016},
isbn = {9781450335492},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2837614.2837617},
doi = {10.1145/2837614.2837617},
abstract = { We present Prophet, a novel patch generation system that works with a set of successful human patches obtained from open- source software repositories to learn a probabilistic, application-independent model of correct code. It generates a space of candidate patches, uses the model to rank the candidate patches in order of likely correctness, and validates the ranked patches against a suite of test cases to find correct patches. Experimental results show that, on a benchmark set of 69 real-world defects drawn from eight open-source projects, Prophet significantly outperforms the previous state-of-the-art patch generation system. },
booktitle = {Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
pages = {298–312},
numpages = {15},
keywords = {Learning correct code, Code correctness model, Program repair},
location = {St. Petersburg, FL, USA},
series = {POPL '16}
}
@article{learning-correct-code,
author = {Long, Fan and Rinard, Martin},
title = {Automatic Patch Generation by Learning Correct Code},
year = {2016},
issue_date = {January 2016},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {51},
number = {1},
issn = {0362-1340},
url = {https://doi.org/10.1145/2914770.2837617},
doi = {10.1145/2914770.2837617},
month = jan,
pages = {298–312},
numpages = {15},
keywords = {Program repair, Learning correct code, Code correctness model}
}
@InProceedings{nested-approximation,
author="Su, Guoxin
and Rosenblum, David S.",
editor="Cassez, Franck
and Raskin, Jean-Fran{\c{c}}ois",
title="Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters",
booktitle="Automated Technology for Verification and Analysis",
year="2014",
publisher="Springer International Publishing",
address="Cham",
pages="364--379",
isbn="978-3-319-11936-6"
}
@article{10.1145/36177.36194,
author = {Massalin, Henry},
title = {Superoptimizer: A Look at the Smallest Program},
year = {1987},
issue_date = {Oct. 1987},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {15},
number = {5},
issn = {0163-5964},
url = {https://doi.org/10.1145/36177.36194},
doi = {10.1145/36177.36194},
journal = {SIGARCH Comput. Archit. News},
month = oct,
pages = {122–126},
numpages = {5}
}
@inproceedings{superoptimiser,
author = {Massalin, Henry},
title = {Superoptimizer: A Look at the Smallest Program},
year = {1987},
isbn = {0818608056},
publisher = {IEEE Computer Society Press},
address = {Washington, DC, USA},
url = {https://doi.org/10.1145/36206.36194},
doi = {10.1145/36206.36194},
pages = {122–126},
numpages = {5},
location = {Palo Alto, California, USA},
series = {ASPLOS II}
}
@article{kernel,
author = {Pu, Calton and Massalin, Henry and Ioannidis, John},
year = {1970},
month = {02},
pages = {},
title = {The Synthesis Kernel},
volume = {1},
journal = {Comput. Syst.}
}
@article{10.1145/1168918.1168907,
author = {Solar-Lezama, Armando and Tancau, Liviu and Bodik, Rastislav and Seshia, Sanjit and Saraswat, Vijay},
title = {Combinatorial Sketching for Finite Programs},
year = {2006},
issue_date = {November 2006},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {41},
number = {11},
issn = {0362-1340},
url = {https://doi.org/10.1145/1168918.1168907},
doi = {10.1145/1168918.1168907},
abstract = {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 with linguistic support for sketching. Finite programs include many highperformance kernels, including cryptocodes. In contrast to prior synthesizers, which had to be equipped with domain-specific rules, SKETCH completes sketches by means of a combinatorial search based on generalized boolean satisfiability. Consequently, our combinatorial synthesizer is complete for the class of finite programs: it is guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems.Freed from domain rules, we can now write sketches as simpleto-understand partial programs, which are regular programs in which difficult code fragments are replaced with holes to be filled by the synthesizer. Holes may stand for index expressions, lookup tables, or bitmasks, but the programmer can easily define new kinds of holes using a single versatile synthesis operator.We have used SKETCH to synthesize an efficient implementation of the AES cipher standard. The synthesizer produces the most complex part of the implementation and runs in about an hour.},
journal = {SIGPLAN Not.},
month = oct,
pages = {404–415},
numpages = {12},
keywords = {SAT, sketching}
}
@inproceedings{sketching,
author = {Solar-Lezama, Armando and Tancau, Liviu and Bodik, Rastislav and Seshia, Sanjit and Saraswat, Vijay},
title = {Combinatorial Sketching for Finite Programs},
year = {2006},
isbn = {1595934510},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1168857.1168907},
doi = {10.1145/1168857.1168907},
pages = {404–415},
numpages = {12},
keywords = {sketching, SAT},
location = {San Jose, California, USA},
series = {ASPLOS XII}
}
@InProceedings{rodes,
author = {Calinescu, Radu and \v{C}e\v{s}ka, Milan and Gerasimou, Simos and Kwiatkowska, Marta and Paoletti, Nicola},
title = {{RODES}: {A} Robust-Design Synthesis Tool for Probabilistic Systems},
booktitle = {QEST},
year = {2017},
pages = {304--308},
publisher = {Springer}
}
@InProceedings{pole,
author="Aziz, Adnan
and Singhal, Vigyan
and Balarin, Felice
and Brayton, Robert K.
and Sangiovanni-Vincentelli, Alberto L.",
editor="Wolper, Pierre",
title="It usually works: The temporal logic of stochastic systems",
booktitle="Computer Aided Verification",
year="1995",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="155--165",
isbn="978-3-540-49413-3"
}
@inproceedings{dpm1,
author = {Paleologo, G. A. and Benini, L. and Bogliolo, A. and De Micheli, G.},
title = {Policy Optimization for Dynamic Power Management},
year = {1998},
isbn = {0897919645},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/277044.277094},
doi = {10.1145/277044.277094},
booktitle = {Proceedings of the 35th Annual Design Automation Conference},
pages = {182–187},
numpages = {6},
keywords = {reconstruction, functional simulation, visibility, emulation},
location = {San Francisco, California, USA},
series = {DAC '98}
}
@article{nand,
author = {Han, Jie and Jonker, Pieter},
year = {2003},
month = {01},
pages = {201 - 208},
title = {A system architecture solution for unreliable nanoelectronic devices},
volume = {1},
journal = {Nanotechnology, IEEE Transactions on},
doi = {10.1109/TNANO.2002.807393}
}
@article{deductive-synthesis,
author = {Manna, Zohar and Waldinger, Richard},
title = {A Deductive Approach to Program Synthesis},
year = {1980},
issue_date = {Jan. 1980},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {2},
number = {1},
issn = {0164-0925},
url = {https://doi.org/10.1145/357084.357090},
doi = {10.1145/357084.357090},
month = jan,
pages = {90–121},
numpages = {32}
}