Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/9572
Назив: | Dijkstra's interpretation of the approach to solving a problem of program correctness | Аутори: | Markoski, Branko Hotomski P. MALBAšKI D. Obradović, Danilo |
Датум издавања: | 1-дец-2010 | Часопис: | Yugoslav Journal of Operations Research | Сажетак: | Proving the program correctness and designing the correct programs are two connected theoretical problems, which are ofgreat practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by formulae φand ψ, in such a way that they canbe used for defining state sets for program P. | URI: | https://open.uns.ac.rs/handle/123456789/9572 | ISSN: | 3540243 | DOI: | 10.2298/YJOR1002229M |
Налази се у колекцијама: | TFZR Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
1
проверено 20.05.2023.
Преглед/и станица
27
Протекла недеља
7
7
Протекли месец
0
0
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.