Use of metods of algebraic programming for the formal verification of legal acts
This article briefly describes the programmable tool for the analysis of a normative legal document. A mechanism for checking legal requirements is presented. The model of the legal document is proposed in the form of a set of special rules. Verification is provided by means of algebraic programming...
Збережено в:
Дата: | 2018 |
---|---|
Автори: | , |
Формат: | Стаття |
Мова: | English |
Опубліковано: |
Інститут програмних систем НАН України
2018
|
Назва видання: | Проблеми програмування |
Теми: | |
Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/144589 |
Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
Цитувати: | Use of metods of algebraic programming for the formal verification of legal acts / V. Peschanenko, M. Poltorackiy // Проблеми програмування. — 2018. — № 2-3. — С. 109-114. — Бібліогр.: 10 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of UkraineРезюме: | This article briefly describes the programmable tool for the analysis of a normative legal document. A mechanism for checking legal requirements is presented. The model of the legal document is proposed in the form of a set of special rules. Verification is provided by means of algebraic programming and methods of symbolic transformation. This approach allows us to analyze the legislative base of structural and logical errors, check the contradictions, completeness and integrity of legal acts. Presently, the mechanism of claster analysis of text, which makes it possible to identify the frequency of occurrence of various vague language constructs. |
---|