Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity

This paper shows that synthesizing binary decision programs (formed by means of decision instructions of the type if then else and of execution instructions of the type do) and proving theorems can be carried out by using the same approach. It is proved that the same transformations acting on P-func...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on computers Ročník C-35; číslo 10; s. 853 - 861
Hlavní autori: SNYERS, D, THAYSE, A
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.10.1986
Institute of Electrical and Electronics Engineers
Predmet:
Algorithmic state machine
Applied sciences
Automata
automatic theorem proving
Boolean functions
Computational modeling
Computer languages
Computer science; control theory; systems
Computers
Data processing
declarative languages
Exact sciences and technology
Hardware
implementation of algorithms
Logic
P-functions
resolution principle
Software
Software engineering
Switches
switching theory
Writing
Synchronous
One order logic
Theorem proving
Sequential machine
Programming
Boolean function
Automatic proving
Algorithm
ISSN:0018-9340, 1557-9956
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper shows that synthesizing binary decision programs (formed by means of decision instructions of the type if then else and of execution instructions of the type do) and proving theorems can be carried out by using the same approach. It is proved that the same transformations acting on P-functions can be interpreted in terms of binary program synthesis and of theorem proving. Since binary program leads to algorithmic state machine design while theorem proving leads to declarative programming, this allows us to lay a bridge between logic design and declarative languages such as Prolog.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1986.1676676