Solving contest problems via formal program verification

dc.contributor.author	Shilov, N.V.
dc.contributor.author	Shilova, S.O.
dc.date.accessioned	2010-12-27T13:38:21Z
dc.date.available	2010-12-27T13:38:21Z
dc.date.issued	2010
dc.identifier.citation	Solving contest problems via formal program verification / N.V. Shilov, S.O. Shilova// Пробл. програмув. — 2010. — № 2-3. — С. 355-362. — Бібліогр.: 17 назв. — англ.	uk_UA
dc.identifier.issn	1727-4907
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/14623
dc.description.abstract	The interface between mathematics and computer science is many-sided. In particular, E.W. Dijkstra promoted a special “computer science” approach to mathematics problem solving. The approach combines a heuristic algorithm design and rigorous mathematical proof of algorithm correctness (in style of A. Hoare and R. Floyd). The paper sketches two problems of this kind in a form of tutorials for undergraduate students that are interested in different programming contests (like ACM International Collegiate Programming Contests). These tutorials took place at Novosibirsk State University in years 2005–2008. The paper also dioceses some direction for further research that emerge from the problems.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут програмних систем НАН України	uk_UA
dc.subject	Формальні методи програмування	uk_UA
dc.title	Solving contest problems via formal program verification	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA
dc.identifier.udc	519.681.2, 51-8