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!

Abstract	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.
AbstractList	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. This paper shows that synthesizing binary decision programs 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 theorem proving. Since a binary program leads to an algorithmic state machine design while theorem proving leads to declarative programming, this allows one to lay a bridge between logic design and declarative languages such as Prolog. (Author)
Author	Snyers Thayse
Author_xml	– sequence: 1 givenname: D surname: SNYERS fullname: SNYERS, D organization: Philips res. lab., Brussels 1170, Belgium – sequence: 2 givenname: A surname: THAYSE fullname: THAYSE, A organization: Philips res. lab., Brussels 1170, Belgium
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8140466$$DView record in Pascal Francis
BookMark	eNp9kE1P3DAQhq0KpC6Ucw9cfEDcsozjxIl7ixb6IVGBRHqObO9k4yqxF9sL4t8TtCsqcag00hzmeWZG7wk5ct4hIV8ZLBkDedWulkzWYslEJeb6RBasLKtMylIckQUAqzPJC_hMTmL8CwAiB7kgQzNufLBpmKyhD0klpL-VGaxDeo3RbhxVbk2bXfKTSjPSDugDTvQ--CfrNt9o--zp9U6NtNlug59VjDR5mgakD2pC2phkn2x6-UKOezVGPDv0U_Ln-027-pnd3v34tWpuM5MLljK2zg1wU_WV1tootdZVn3Pdl6Yu9JoD5yUyLCTo3jDVawMoIa-Z4ZLnmjF-Si73e-dvHncYUzfZaHAclUO_i11egIRSwAxeHEAVjRr7oJyxsdsGO6nw0tWsgEKIGbvaYyb4GAP27wSD7i34rl11b8F3h-Bno_xgGDsHa71LQdnxP9753rOI-O_KYfoKM7CSeA
CODEN	ITCOB4
CitedBy_id	crossref_primary_10_1109_12_24299
Cites_doi	10.1145/800055.802049 10.1145/321250.321253 10.1109/TC.1978.1675141 10.1109/TC.1984.1676434 10.1145/357084.357090 10.1109/TC.1982.1675883 10.1016/0004-3702(82)90011-X 10.1007/BF01071417 10.1007/3-540-13358-5 10.1109/TC.1984.1676347
ContentType	Journal Article
Copyright	1987 INIST-CNRS
Copyright_xml	– notice: 1987 INIST-CNRS
DBID	AAYXX CITATION IQODW 8FD H8D L7M
DOI	10.1109/TC.1986.1676676
DatabaseName	CrossRef Pascal-Francis Technology Research Database Aerospace Database Advanced Technologies Database with Aerospace
DatabaseTitle	CrossRef Technology Research Database Aerospace Database Advanced Technologies Database with Aerospace
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Applied Sciences
EISSN	1557-9956
EndPage	861
ExternalDocumentID	8140466 10_1109_TC_1986_1676676 1676676
Genre	orig-research
GroupedDBID	--Z -DZ -~X .55 .DC 0R~ 29I 3EH 3O- 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ MVM O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TN5 TWZ UHB UKR UPT VH1 X7M XJT XOL XZL YXB YYQ YZZ ZCG AAYXX ABUFD CITATION IQODW RIG 8FD H8D L7M
ID	FETCH-LOGICAL-c261t-1d2c03c7f7bbbcaadb7f23bf5c84bd30335e1e490bfc1afbc0e90281c3932b113
IEDL.DBID	RIE
ISSN	0018-9340
IngestDate	Sun Sep 28 07:16:06 EDT 2025 Mon Jul 21 09:17:10 EDT 2025 Tue Nov 18 21:31:33 EST 2025 Sat Nov 29 07:41:34 EST 2025 Wed Aug 27 02:13:16 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	10
Keywords	Synchronous One order logic Theorem proving Sequential machine Programming Boolean function Automatic proving Algorithm
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c261t-1d2c03c7f7bbbcaadb7f23bf5c84bd30335e1e490bfc1afbc0e90281c3932b113
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	24090560
PQPubID	23500
PageCount	9
ParticipantIDs	proquest_miscellaneous_24090560 pascalfrancis_primary_8140466 crossref_citationtrail_10_1109_TC_1986_1676676 ieee_primary_1676676 crossref_primary_10_1109_TC_1986_1676676
PublicationCentury	1900
PublicationDate	19861001
PublicationDateYYYYMMDD	1986-10-01
PublicationDate_xml	– month: 10 year: 1986 text: 19861001 day: 01
PublicationDecade	1980
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY
PublicationTitle	IEEE transactions on computers
PublicationTitleAbbrev	TC
PublicationYear	1986
Publisher	IEEE Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: Institute of Electrical and Electronics Engineers
References	ref12 nilsson (ref11) 1980 ref15 (ref6) 1968 ref10 snyers (ref13) 1985 chang (ref2) 1973 mashov (ref9) 1971; 6 ref1 ref17 ref16 robinson (ref14) 1985 clare (ref3) 1973 ref8 winkel (ref19) 1980 ref7 thayse (ref18) 1984 davio (ref4) 1983 glushkov (ref5) 1965; 1
References_xml	– year: 1973 ident: ref2 publication-title: Symbolic Logic and Mechanical Theorem Proving – volume: 6 start-page: 77 year: 1971 ident: ref9 publication-title: Machine Intelligence – ident: ref7 doi: 10.1145/800055.802049 – ident: ref12 doi: 10.1145/321250.321253 – ident: ref1 doi: 10.1109/TC.1978.1675141 – year: 1973 ident: ref3 publication-title: Designing Logic Systems Using State Machines – ident: ref16 doi: 10.1109/TC.1984.1676434 – start-page: 1 year: 1968 ident: ref6 publication-title: Cybern – year: 1983 ident: ref4 publication-title: Digital Systems with Algorithm Implementation – year: 1985 ident: ref13 article-title: a prolog realization of a speech understanding unit publication-title: 5th Symp on Pattern Recogn Artifi Intell – ident: ref8 doi: 10.1145/357084.357090 – ident: ref15 doi: 10.1109/TC.1982.1675883 – ident: ref10 doi: 10.1016/0004-3702(82)90011-X – year: 1985 ident: ref14 publication-title: From algorithmic state machine-design to recursive program construction by means of P-functions – volume: 1 start-page: 1 year: 1965 ident: ref5 article-title: automaton theory and formal microprogram transformation publication-title: Cibernetica doi: 10.1007/BF01071417 – year: 1980 ident: ref19 publication-title: The Art of Digital System Design – year: 1980 ident: ref11 publication-title: Principles of Artificial Intelligence – year: 1984 ident: ref18 publication-title: Lecture Notes in Computer Sciences doi: 10.1007/3-540-13358-5 – ident: ref17 doi: 10.1109/TC.1984.1676347
SSID	ssj0006209
Score	1.3160245
Snippet	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... This paper shows that synthesizing binary decision programs and proving theorems can be carried out by using the same approach. It is proved that the same...
SourceID	proquest pascalfrancis crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	853
SubjectTerms	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
Title	Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity
URI	https://ieeexplore.ieee.org/document/1676676 https://www.proquest.com/docview/24090560
Volume	C-35
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9956 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006209 issn: 0018-9340 databaseCode: RIE dateStart: 19680101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT9swFH-CaoftMBgM8VXmA4cdlmInbtxwqwqIw0BI6yRukT-eRyWaTG0C_z62kxTQ4LBbFNtx5OeP37N__j2AY7SUW4UmijODER9ZE2WxSiMuBRWaUUtVEHH9Ka6vR7e32c0a_FjdhUHEQD7DgX8MZ_mm1LXfKjthqfCUzHVYF0I0d7VWs27a0TmYG8AJp62MD6PZyXQycK51OmiLv1qBQkgVT4iUS9cmtglm8c-8HBabi43_-81N-NyCSjJuesEXWMNiCza6gA2kHb9b8OmF-uA23I3v_5SLWXU3n2kSQCe5CtRKJGeB10FkYci4rsog60rCNX6ck5tmF-KUTB9Lclb7ilthclySqiQOUpJfco5krJvQFF_h98X5dHIZtYEXIu0cqipiJtY00cIKpZSW0ihh40TZoR5xZdyilwyRIc-osppJqzRFLwLDdOLQoGIs2YFeURa4C4RLw6zz6XhsY27FKFMy1TJ1oIk5YJIM92DQGSPXrSq5D45xnwfvhGb5dJJ76-Vtq-7B91WBv40gx_tZt71xnrN1r_uvrL1K9-JfPHXp3zrr526s-QMUWWBZL3OHfjIHGOn-2x8-gI---obqdwi9alFjHz7oh2q2XByF7voEoUjpXQ
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3Pb9MwFH4aA4lx2KBjYowyHzhwIJ2duEnDrWqZhuiqSQSpt8g_nlmlNUFtwv792U7SbQIO3KLYcSw___ie_fl7AB_QUG4k6iBMNQZ8ZHSQhjIOuEhoohg1VHoR11kyn48Wi_RqBz5t78Igoief4cA9-rN8XarabZWdsThxlMwn8HTIecia21rbeTfuCB3MDuGI01bIh9H0LJsMrHMdD9oCHq1BPqiKo0SKjW0V04Sz-GNm9svN-cH_VfQl7LewkoybfvAKdrDowUEXsoG0I7gHLx7oDx7C9fjmZ7leVterpSIedpJLT65EMvXMDiIKTcZ1VXphV-Iv8uOKXDX7EJ9JdluSae1-3EqT44ZUJbGgknwXKyRj1QSneA0_zr9kk4ugDb0QKOtSVQHToaKRSkwipVRCaJmYMJJmqEZcarvsRUNkyFMqjWLCSEXRycAwFVk8KBmLjmC3KAt8A4QLzYz16nhoQm6SUSpFrERsYROz0CQaHsOgM0auWl1yFx7jJvf-CU3zbJI76-Vtqx7Dx-0HvxpJjn9nPXTGuc_Wve4_svY23cl_8dimn3bWz-1oc0coosCy3uQW_6QWMtK3fy_4FJ5fZJezfPZ1_u0E9lxVGuLfO9it1jX24Zn6XS036_e-694B5rfspA
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algorithmic+State+Machine+Design+and+Automatic+Theorem+Proving%3A+Two+Dual+Approaches+to+the+Same+Activity&rft.jtitle=IEEE+transactions+on+computers&rft.au=Snyers&rft.au=Thayse&rft.date=1986-10-01&rft.pub=IEEE&rft.issn=0018-9340&rft.volume=C-35&rft.issue=10&rft.spage=853&rft.epage=861&rft_id=info:doi/10.1109%2FTC.1986.1676676&rft.externalDocID=1676676
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon