Equivalence of the schemes of programs based on the algebraic approach to setting the semantics of programming languages

Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme is understood as a program model wherein abstraction from contensive values of operators and expressions is performed. In this case, the prog...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Rossijskij tehnologičeskij žurnal Ročník 10; číslo 1; s. 18 - 27
Hlavní autor: Korablin, Y. P.
Médium: Journal Article
Jazyk:angličtina
ruština
Vydáno: MIREA - Russian Technological University 01.03.2022
Témata:
equational characterization of the semantic meanings of programs
equivalence of program schemes
process semantics
program scheme
semantic domains
ISSN:2782-3210, 2500-316X
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!
Abstract Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme is understood as a program model wherein abstraction from contensive values of operators and expressions is performed. In this case, the program structure containing symbolic notation of operators and expressions remains unchanged while maintaining their execution sequence. The programming language model presented in the paper contains basic constructs of sequential languages and is the core of the existing sequential programming languages. The paper aimed at developing an effective algorithm for studying equivalence (nonequivalence) of program schemes of sequential programming languages.Methods. An algebraic approach to specifying semantics of programming languages was used for studying the equivalence of program schemes.Results. A process semantics being the new algebraic approach to specifying the formal semantics of sequential programming languages was proposed. The process semantics was specified by matching programs (program schemes) with a set of computation sequences. The computation sequence was understood as the execution sequence of actions (commands and tests) of the program. Two types of concatenation operations (test–command and command–command) and the merge operation, which properties are given by axiomatic systems, were defined in the introduced semantic domain. The finiteness of the semantic value representation in the form of systems of recursive equations was proved. The algorithm for proving the equivalence (nonequivalence) of systems of recursive equations characterizing semantic values for a pair of program schemes was proposed, which implies the equivalence (nonequivalence) of programs in the strong sense.Conclusions. The paper demonstrates the efficient use of the proposed algorithm for proving the equivalence of sequential program schemes excluding side effects when calculating expressions, i.e., sequential computation of the expression more than once does not change anything. The example of proving the equivalence of program schemes by two methods—the well-known de Bakker–Scott fixed-point induction method and the method proposed by the author—is given. Comparison of the above methods testifies not only to the new method′s effectiveness but also to its significant simplicity, proved in practice by students who performed corresponding tasks when studying the Semantics of Programming Languages at the Institute of Information and Computing Technologies at the National Research University Moscow Power Engineering Institute (Moscow, Russia).
AbstractList Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme is understood as a program model wherein abstraction from contensive values of operators and expressions is performed. In this case, the program structure containing symbolic notation of operators and expressions remains unchanged while maintaining their execution sequence. The programming language model presented in the paper contains basic constructs of sequential languages and is the core of the existing sequential programming languages. The paper aimed at developing an effective algorithm for studying equivalence (nonequivalence) of program schemes of sequential programming languages.Methods. An algebraic approach to specifying semantics of programming languages was used for studying the equivalence of program schemes.Results. A process semantics being the new algebraic approach to specifying the formal semantics of sequential programming languages was proposed. The process semantics was specified by matching programs (program schemes) with a set of computation sequences. The computation sequence was understood as the execution sequence of actions (commands and tests) of the program. Two types of concatenation operations (test–command and command–command) and the merge operation, which properties are given by axiomatic systems, were defined in the introduced semantic domain. The finiteness of the semantic value representation in the form of systems of recursive equations was proved. The algorithm for proving the equivalence (nonequivalence) of systems of recursive equations characterizing semantic values for a pair of program schemes was proposed, which implies the equivalence (nonequivalence) of programs in the strong sense.Conclusions. The paper demonstrates the efficient use of the proposed algorithm for proving the equivalence of sequential program schemes excluding side effects when calculating expressions, i.e., sequential computation of the expression more than once does not change anything. The example of proving the equivalence of program schemes by two methods—the well-known de Bakker–Scott fixed-point induction method and the method proposed by the author—is given. Comparison of the above methods testifies not only to the new method′s effectiveness but also to its significant simplicity, proved in practice by students who performed corresponding tasks when studying the Semantics of Programming Languages at the Institute of Information and Computing Technologies at the National Research University Moscow Power Engineering Institute (Moscow, Russia).
Author Korablin, Y. P.
Author_xml – sequence: 1
  givenname: Y. P.
  surname: Korablin
  fullname: Korablin, Y. P.
  organization: NRU MPEI
BookMark eNqNkcGO1DAMhiO0SCzLvkPFPRA7bdpyAq0WWGklLiBxi9zU6QS1zZB0Ebw96QwgxImT7d_2J-v3U3GxxpWFeA7qhUZt8CU2SkkN5rNEhShBSZDQSWwfics_vYuStx1KjaCeiOucw6Aa1epOo7kU32-_PoRvNPPquIq-2g5cZXfghfNeHlOcEi25GijzWMX1NEDzxEOi4Co6lglyh2qLVeZtC-t0RvBC6xbc35Blb860Tg80cX4mHnuaM1__ilfi09vbjzfv5f2Hd3c3b-6lQzSt1GPNxqteu8Yx12hg9LobAI32HYAD1yAVgXs19L2DroMRzNgYqDWScvpK3J25Y6Qv9pjCQumHjRTsSYhpspTKpTPbAXxhcNkiUxdQX3uqm960Br1vAQrr9ZnlUsw5sbcubLSFuG7FjdmCsqfH2N18u5tv98fsOljoLLYF8eofxO-T_mP5J9rqll4
CitedBy_id crossref_primary_10_1134_S0037446623050117
crossref_primary_10_1134_S0361768824010110
Cites_doi 10.1007/BF00289504
10.15514/ISPRAS-2015-27(4)-8
10.15514/ISPRAS-2015-27(2)-11
10.15827/0236-235X.128.547-555
10.18255/1818-1015-2017-4-415-433
10.1007/978-94-011-1793-7_4
10.15514/ISPRAS-2015-27(2)-13
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.32362/2500-316X-2022-10-1-18-27
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2500-316X
EndPage 27
ExternalDocumentID oai_doaj_org_article_b1fb99ea0ca6488194fa4596762ff711
10_32362_2500_316X_2022_10_1_18_27
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c2267-3d4e6f093c5cee4261df38b1263f811c1c52a38be90b99c1881d16d561432a0c3
IEDL.DBID DOA
ISSN 2782-3210
IngestDate Fri Oct 03 12:52:37 EDT 2025
Sat Nov 29 01:34:46 EST 2025
Tue Nov 18 22:42:33 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
Russian
License https://www.rtj-mirea.ru/jour/about/editorialPolicies#openAccessPolicy
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2267-3d4e6f093c5cee4261df38b1263f811c1c52a38be90b99c1881d16d561432a0c3
OpenAccessLink https://doaj.org/article/b1fb99ea0ca6488194fa4596762ff711
PageCount 10
ParticipantIDs doaj_primary_oai_doaj_org_article_b1fb99ea0ca6488194fa4596762ff711
crossref_citationtrail_10_32362_2500_316X_2022_10_1_18_27
crossref_primary_10_32362_2500_316X_2022_10_1_18_27
PublicationCentury 2000
PublicationDate 2022-03-01
PublicationDateYYYYMMDD 2022-03-01
PublicationDate_xml – month: 03
  year: 2022
  text: 2022-03-01
  day: 01
PublicationDecade 2020
PublicationTitle Rossijskij tehnologičeskij žurnal
PublicationYear 2022
Publisher MIREA - Russian Technological University
Publisher_xml – name: MIREA - Russian Technological University
References ref13
ref12
ref14
ref11
ref10
ref2
ref1
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref6
  doi: 10.1007/BF00289504
– ident: ref11
  doi: 10.15514/ISPRAS-2015-27(4)-8
– ident: ref1
– ident: ref4
– ident: ref2
– ident: ref3
– ident: ref13
  doi: 10.15514/ISPRAS-2015-27(2)-11
– ident: ref7
– ident: ref14
  doi: 10.15827/0236-235X.128.547-555
– ident: ref12
  doi: 10.18255/1818-1015-2017-4-415-433
– ident: ref9
– ident: ref8
– ident: ref5
  doi: 10.1007/978-94-011-1793-7_4
– ident: ref10
  doi: 10.15514/ISPRAS-2015-27(2)-13
SSID ssib050738326
ssj0002876707
Score 2.1741376
Snippet Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 18
SubjectTerms equational characterization of the semantic meanings of programs
equivalence of program schemes
process semantics
program scheme
semantic domains
Title Equivalence of the schemes of programs based on the algebraic approach to setting the semantics of programming languages
URI https://doaj.org/article/b1fb99ea0ca6488194fa4596762ff711
Volume 10
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2500-316X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002876707
  issn: 2782-3210
  databaseCode: DOA
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2500-316X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib050738326
  issn: 2782-3210
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxQAD4lOUL3lgtRrHiROPgIoYoGIAqZvlOLYURFtoWsTEb-fOSaswwcASKW5tRc8vvnvR-ZmQSytMmhuumFQ2ZolTETMmVcyXBiIshHDlw0bh-2w0ysdj9dg56gtrwhp74Aa4QcF9oZQzkTUSyAaa25skVRJeYu-zZldvlKmOmAImQZIDyqtNLF7CJ6RMZmHvdAwhkeHGlcaBVMSwgg8gD8DVSI6BNCDOsGCBcWBQ9iNadUz9Q_S53SU7bdpIr5rH3SMb8-U-2e6YCR6Qz-H7sgLe4KtKZ55CZkdBurqJq_G2LcSqKcatks6m4Q94ygfo5crSlbk4Xcxo7UI1dDOEmwD4le0OMsEfV18660PyfDt8urlj7bkKzEKyBWtKmTjpIyVsCiESNVTpRV7wWAqfc265TWMDDTBxAL3lgHrJZYmeoSKGiRBHpDedTd0xoZANSRGZOPWpS0qucs8L1HBSyAKEkuwTtcJP29Z0HM--eNUgPgL2GrHXiL1G7LGda57rOOsTse771lhv_KnXNU7TugfaZ4cGIJVuSaV_I9XJfwxySrYCm0LB2hnpLeZLd0427ceiqucXga9wffgafgMSq-fS
linkProvider Directory of Open Access Journals
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=Equivalence+of+the+schemes+of+programs+based+on+the+algebraic+approach+to+setting+the+semantics+of+programming+languages&rft.jtitle=Rossijskij+tehnologi%C4%8Deskij+%C5%BEurnal&rft.au=Y.+P.+Korablin&rft.date=2022-03-01&rft.pub=MIREA+-+Russian+Technological+University&rft.issn=2782-3210&rft.eissn=2500-316X&rft.volume=10&rft.issue=1&rft.spage=18&rft.epage=27&rft_id=info:doi/10.32362%2F2500-316X-2022-10-1-18-27&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b1fb99ea0ca6488194fa4596762ff711
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2782-3210&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2782-3210&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2782-3210&client=summon