Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/15319
Title: | Resolution methods in proving the program correctness | Authors: | Markoski, Branko Hotomski P. Malbaški D. Obradović, D |
Issue Date: | 1-Jan-2007 | Journal: | Yugoslav Journal of Operations Research | Abstract: | Program testing determines whether its behavior matches the specification, and also how it behaves in different exploitation conditions. Proving of program correctness is reduced to finding a proof for assertion that given sequence of formulas represents derivation within a formal theory of special predicted calculus. A well-known variant of this conception is described: correctness based on programming logic rules. It is shown that programming logic rules may be used in automatic resolution procedure. Illustrative examples are given, realized in prolog-like LP-language (with no restrictions to Horn's clauses and without the final failure). Basic information on LP-language are also given. It has been shown how a Pascal-program is being executed in LP-system proffer. | URI: | https://open.uns.ac.rs/handle/123456789/15319 | ISSN: | 3540243 | DOI: | 10.2298/YJOR0702275M |
Appears in Collections: | TFZR Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on May 6, 2023
Page view(s)
26
Last Week
12
12
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.