TY - GEN
T1 - Programming reflexes (Extended abstract)
AU - Dolev, Shlomi
AU - Manevich, Roman
AU - Rokach, Amit
N1 - Funding Information: The research was partially supported by the Rita Altura Trust Chair in Computer Sciences; Frankel center for computer science, grant of the Ministry of Science, Technology and Space, Israel, and the National Science Council (NSC) of Taiwan; the Ministry of Foreign Affairs, Italy; the Ministry of Science, Technology and Space, Infrastructure Research in the Field of Advanced Computing and Cyber Security; IBM research grant and the Israel National Cyber Bureau. Publisher Copyright: © 2017 IEEE.
PY - 2017/12/8
Y1 - 2017/12/8
N2 - Formal verification serves as the theoretical basis for the engineering task of correctness and performance (quality) assurance. State of the art model checking, automatic specification refinement and theorem proving are employed to tackle the often undecidable (as imposed by the halting problem) task of complete verification. In this paper we formalize, prove and demonstrate a new unobtrusive way to test a system during runtime. Invocation of actions and examination of reaction of the system and components of the system are examined in run time in an holistic abstract manner, namely, the current state (e.g., state snapshot) the executable (e.g., program) and the environmental current condition (e.g., operating system, hypervisor) are examined by invoking actions and examining the reactions without influencing the actual execution semantics.
AB - Formal verification serves as the theoretical basis for the engineering task of correctness and performance (quality) assurance. State of the art model checking, automatic specification refinement and theorem proving are employed to tackle the often undecidable (as imposed by the halting problem) task of complete verification. In this paper we formalize, prove and demonstrate a new unobtrusive way to test a system during runtime. Invocation of actions and examination of reaction of the system and components of the system are examined in run time in an holistic abstract manner, namely, the current state (e.g., state snapshot) the executable (e.g., program) and the environmental current condition (e.g., operating system, hypervisor) are examined by invoking actions and examining the reactions without influencing the actual execution semantics.
KW - Formal verification
KW - Runtime environment
KW - System recovery
UR - http://www.scopus.com/inward/record.url?scp=85046405056&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/NCA.2017.8171347
DO - https://doi.org/10.1109/NCA.2017.8171347
M3 - Conference contribution
T3 - 2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017
SP - 1
EP - 4
BT - 2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017
A2 - Avresky, Dimiter R.
A2 - Gkoulalas-Divanis, Aris
A2 - Correia, Miguel P.
T2 - 16th IEEE International Symposium on Network Computing and Applications, NCA 2017
Y2 - 30 October 2017 through 1 November 2017
ER -