Dijkstra's interpretation of the approach to solving a problem of program correctness
Proving the program correctness and designing the correct programs are two connected theoretical problems, which are of great 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...
Main Authors: | Markoski Branko, Hotomski Petar, Malbaški Dušan, Obradović Danilo |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2010-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2010/0354-02431002229M.pdf |
Similar Items
-
Resolution methods in proving the program correctness
by: Markoski Branko, et al.
Published: (2007-01-01) -
Pemetaan Potensi Pariwisata Kabupaten Waykanan Menggunakan Algoritma Dijkstra
by: Mahatir Mohamad, et al.
Published: (2017-11-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Semantic motivation for the denotational identity of arguments in predication structures
by: Viara Maldjieva
Published: (2015-11-01)