Simple non-deterministic rewriting in verification
Abstract. We discuss the non-deterministic rewriting in application for engine functions of Verification of Formal Specification (VFS) system in this paper. VFS – are tools to prove properties of systems described as formal specifications (basic protocols), such as the completeness (the system behav...
Збережено в:
| Дата: | 2010 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Інститут програмних систем НАН України
2010
|
| Теми: | |
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/14641 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Simple non-deterministic rewriting in verification / A. Letichevsky, V. Peschanenko // Пробл. програмув. — 2010. — № 2-3. — С. 98-101. — Бібліогр.: 14 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862551070613438464 |
|---|---|
| author | Letichevsky, A. Peschanenko, V. |
| author_facet | Letichevsky, A. Peschanenko, V. |
| citation_txt | Simple non-deterministic rewriting in verification / A. Letichevsky, V. Peschanenko // Пробл. програмув. — 2010. — № 2-3. — С. 98-101. — Бібліогр.: 14 назв. — англ. |
| collection | DSpace DC |
| description | Abstract. We discuss the non-deterministic rewriting in application for engine functions of Verification of Formal Specification (VFS) system in this paper. VFS – are tools to prove properties of systems described as formal specifications (basic protocols), such as the completeness (the system behavior has a possible continuation at each of its stages) and consistency (the system behavior is deterministic at each stage), safety (something bad will never happened), or the correspondence of the specified behavior to given scenarios. Together these tools constitute a powerful environment for the formal verification of formal specifications expressed through message sequence charts.
|
| first_indexed | 2025-11-25T20:49:29Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-14641 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1727-4907 |
| language | English |
| last_indexed | 2025-11-25T20:49:29Z |
| publishDate | 2010 |
| publisher | Інститут програмних систем НАН України |
| record_format | dspace |
| spelling | Letichevsky, A. Peschanenko, V. 2010-12-27T13:54:06Z 2010-12-27T13:54:06Z 2010 Simple non-deterministic rewriting in verification / A. Letichevsky, V. Peschanenko // Пробл. програмув. — 2010. — № 2-3. — С. 98-101. — Бібліогр.: 14 назв. — англ. 1727-4907 https://nasplib.isofts.kiev.ua/handle/123456789/14641 004.41,004.51 Abstract. We discuss the non-deterministic rewriting in application for engine functions of Verification of Formal Specification (VFS) system in this paper. VFS – are tools to prove properties of systems described as formal specifications (basic protocols), such as the completeness (the system behavior has a possible continuation at each of its stages) and consistency (the system behavior is deterministic at each stage), safety (something bad will never happened), or the correspondence of the specified behavior to given scenarios. Together these tools constitute a powerful environment for the formal verification of formal specifications expressed through message sequence charts. en Інститут програмних систем НАН України Теоретичні та методологічні основи програмування Simple non-deterministic rewriting in verification Article published earlier |
| spellingShingle | Simple non-deterministic rewriting in verification Letichevsky, A. Peschanenko, V. Теоретичні та методологічні основи програмування |
| title | Simple non-deterministic rewriting in verification |
| title_full | Simple non-deterministic rewriting in verification |
| title_fullStr | Simple non-deterministic rewriting in verification |
| title_full_unstemmed | Simple non-deterministic rewriting in verification |
| title_short | Simple non-deterministic rewriting in verification |
| title_sort | simple non-deterministic rewriting in verification |
| topic | Теоретичні та методологічні основи програмування |
| topic_facet | Теоретичні та методологічні основи програмування |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/14641 |
| work_keys_str_mv | AT letichevskya simplenondeterministicrewritinginverification AT peschanenkov simplenondeterministicrewritinginverification |