Certified Grammar Transformation to Chomsky Normal Form in F
Certified programming allows to prove that the program meets its specification. The check of correctness of a program is performed at compile time, which guarantees that the program always runs as specified. Hence, there is no need to test certified programs to ensure they work correctly. There are...
Main Authors: | M. I. Polubelova, S. N. Bozhko, S. V. Grigorev |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/64 |
Similar Items
-
On Construction and Verification of PLC-Programs
by: E. V. Kuzmin, et al.
Published: (2012-01-01) -
Formal Verification of Programs in Functional Dataflow Parallel Language
by: M. S. Kropacheva, et al.
Published: (2012-01-01) -
Tail Recursion Transformation in Functional Dataflow Parallel Programs
by: A. I. Legalov, et al.
Published: (2012-01-01) -
Conversion Typed Functions into Relational Form
by: P. . Lozov, et al.
Published: (2018-10-01) -
Generation of test tasks in the expert-training systems
by: I L Bratchikov
Published: (2012-06-01)