F@BOOL@: experiment with a simple verifying compiler based on SAT-solvers
A verifying compiler is a system computer program that translates programs written by man from a high-level language into equivalent executable programs, and besides, proves (veri¯es) mathematical statements speci¯ed by man about the properties of the programs being translated. The purpose of the F@...
Saved in:
| Main Author: | N. V. Shilov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2010-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1057 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Instance Assignment Coverage Feature for Operation Control of SAT Solver
by: Zhihui Li, et al.
Published: (2025-03-01) -
A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution
by: Waleed Ahmed, et al.
Published: (2018-12-01) -
On Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
by: Valeriy G. Durnev, et al.
Published: (2018-08-01) -
AutoDiVer: Automatically Verifying Differential Characteristics and Learning Key Conditions
by: Marcel Nageler, et al.
Published: (2025-03-01) -
Verification of Backtracking and Branch and Bound Design Templates
by: N. V. Shilov
Published: (2011-12-01)