Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/10797
Pоljе DC-а | Vrеdnоst | Јеzik |
---|---|---|
dc.contributor.author | Popovic M. | en |
dc.contributor.author | Kovacevic V. | en |
dc.contributor.author | Velikic I. | en |
dc.date.accessioned | 2020-03-03T14:41:19Z | - |
dc.date.available | 2020-03-03T14:41:19Z | - |
dc.date.issued | 2002-01-01 | en |
dc.identifier.isbn | 0769515495 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10797 | - |
dc.description.abstract | © 2002 IEEE. Formal software verification typically involves some levels of static theorem proving which is a mathematical process of proving that the function computed by a program match the function specified. A theorem prover, such as THEO, automates this process. On the other hand, reverse engineering is a process inverse to traditional engineering. An example extracts the software specification from its source code. In this paper we present a formal software verification concept, which is based on automated theorem proving and reverse engineering. We are mainly concerned with communications software and with software for families of communication protocols in particular. In the paper we describe how to: (1) model a group of finite state machines using predicate calculus; (2) extract axiomatic software specification from the source code and log files; and (3) formally verify software for a given operational profile (set of test cases). The concept has been successfully applied to a call processing software for systems, which are installed and fully operational in Moscow and Saint Petersburg, Russia. | en |
dc.relation.ispartof | Proceedings - 9th Annual IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, ECBS 2002 | en |
dc.title | A formal software verification concept based on automated theorem proving and reverse engineering | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1109/ECBS.2002.999823 | en |
dc.identifier.scopus | 2-s2.0-62549118995 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/62549118995 | en |
dc.relation.lastpage | 66 | en |
dc.relation.firstpage | 59 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
SCOPUSTM
Nаvоđеnjа
10
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
16
Prоtеklа nеdеljа
4
4
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.