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ženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník C-35; číslo 10; s. 853 - 861
Hlavní autoři:	SNYERS, D, THAYSE, A
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.10.1986 Institute of Electrical and Electronics Engineers
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!