Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDMA_2017_10_a58, author = {M. S. Chushkin}, title = {Sketch completion for predicate programs by counterexamples guided synthesis}, journal = {Prikladnaya Diskretnaya Matematika. Supplement}, pages = {151--153}, publisher = {mathdoc}, number = {10}, year = {2017}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDMA_2017_10_a58/} }
TY - JOUR AU - M. S. Chushkin TI - Sketch completion for predicate programs by counterexamples guided synthesis JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2017 SP - 151 EP - 153 IS - 10 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDMA_2017_10_a58/ LA - ru ID - PDMA_2017_10_a58 ER -
M. S. Chushkin. Sketch completion for predicate programs by counterexamples guided synthesis. Prikladnaya Diskretnaya Matematika. Supplement, no. 10 (2017), pp. 151-153. http://geodesic.mathdoc.fr/item/PDMA_2017_10_a58/
[1] Karnaukhov N. S., Pershin D. Yu., Shelekhov V. I., Yazyk predikatnogo programmirovaniya P, Preprint No 153, ISI SO RAN, Novosibirsk, 2010, 42 pp.
[2] Shelekhov V. I., “Semantika yazyka predikatnogo programmirovaniya”, ZONT-15, Novosibirsk, 2015, 15
[3] Chushkin M. S., “Metody deduktivnoi verifikatsii predikatnykh programm”, Tr. 2-i Mezhdunar. konf. “Instrumenty i metody analiza programm”, Kostroma, 2014, 205–214
[4] Solar-Lezama A., Tancau L., Bodik R., et al., “Combinatorial sketching for finite programs”, Proc. ASPLOS XII, ACM, N.Y., 2006, 404–415 | DOI
[5] https://gist.github.com/mchushkin/8e1a6a28fd6d342623cd97cd5fa395ac
[6] Udupa A., Raghavan A., Deshmukh J. V., et al., “TRANSIT: specifying protocols with concolic snippets”, Proc. PLDI'13, ACM, N.Y., 2013, 287–296