Transforming concurrent programs with semaphores into logically constrained term rewrite systems
In this paper, as a first step of modeling concurrent programs by logically constrained term rewrite systems (LCTRSs, for short), we show transformations of concurrent programs with semaphore-based exclusive control into LCTRSs. To this end, we show how to encode configurations of concurrent program...
Uloženo v:
| Vydáno v: | Journal of logical and algebraic methods in programming Ročník 143; s. 101033 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.02.2025
|
| Témata: | |
| ISSN: | 2352-2208 |
| 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 | In this paper, as a first step of modeling concurrent programs by logically constrained term rewrite systems (LCTRSs, for short), we show transformations of concurrent programs with semaphore-based exclusive control into LCTRSs. To this end, we show how to encode configurations of concurrent programs with a fixed number of processes. Then, we show how to encode some well-known operations for semaphores by rewrite rules, showing two transformations of concurrent programs with semaphores into LCTRSs. We adopt list-using and list-free approaches to the encoding of waiting queues for semaphores in LCTRSs. While the former straightforwardly uses lists, the latter uses a so-called take-a-number system in order to avoid using any recursive data structures for waiting queues.
•We extend a transformation of sequential programs into LCTRSs to concurrent programs with semaphores.•We show list-using and list-free approaches to the encoding of waiting queues for semaphores.•The list-free approach uses a take-a-number system to avoid using any recursive data structures for waiting queues. |
|---|---|
| AbstractList | In this paper, as a first step of modeling concurrent programs by logically constrained term rewrite systems (LCTRSs, for short), we show transformations of concurrent programs with semaphore-based exclusive control into LCTRSs. To this end, we show how to encode configurations of concurrent programs with a fixed number of processes. Then, we show how to encode some well-known operations for semaphores by rewrite rules, showing two transformations of concurrent programs with semaphores into LCTRSs. We adopt list-using and list-free approaches to the encoding of waiting queues for semaphores in LCTRSs. While the former straightforwardly uses lists, the latter uses a so-called take-a-number system in order to avoid using any recursive data structures for waiting queues.
•We extend a transformation of sequential programs into LCTRSs to concurrent programs with semaphores.•We show list-using and list-free approaches to the encoding of waiting queues for semaphores.•The list-free approach uses a take-a-number system to avoid using any recursive data structures for waiting queues. |
| ArticleNumber | 101033 |
| Author | Kojima, Misaki Nishida, Naoki Matsubara, Yutaka |
| Author_xml | – sequence: 1 givenname: Misaki orcidid: 0000-0001-5194-3947 surname: Kojima fullname: Kojima, Misaki email: k-misaki@nagoya-u.jp – sequence: 2 givenname: Naoki orcidid: 0000-0001-8697-4970 surname: Nishida fullname: Nishida, Naoki email: nishida@i.nagoya-u.ac.jp – sequence: 3 givenname: Yutaka orcidid: 0000-0002-1111-0761 surname: Matsubara fullname: Matsubara, Yutaka email: yutaka@ertl.jp |
| BookMark | eNp9kMtOwzAQRb0oEqX0C9j4B1L8SFpvWKCKl1SJTVkbxxm3jhI7Ghuq_j0JZc3qSqN7RlfnhsxCDEDIHWcrzvj6vl21nemHlWCinC5MyhmZC1mJQgimrskypZaxsao2SvI5-dyjCclF7H04UBuD_UKEkOmA8YCmT_Tk85Em6M1wjAiJ-pAj7eLBW9N15wlJGY0P0NAM2FOEE_oMNJ1Thj7dkitnugTLv1yQj-en_fa12L2_vG0fd4UVlcyFLYUsLayVqJnl0hjZ1BWAtCCk4cLUzrGGS2UqxQR3YiNAbdhYcnZd1bWSCyIvfy3GlBCcHtD3Bs-aMz250a3-daMnN_riZqQeLhSM0749oE7WQ7DQeASbdRP9v_wPmM11NQ |
| Cites_doi | 10.1016/S0747-7171(87)80022-6 10.1145/3060143 10.1007/s10515-021-00307-9 10.1016/0304-3975(92)90182-F 10.1016/j.ipl.2006.09.010 10.1016/j.jlap.2010.03.012 10.1145/3586029 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Inc. |
| Copyright_xml | – notice: 2024 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jlamp.2024.101033 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_jlamp_2024_101033 S2352220824000877 |
| GrantInformation_xml | – fundername: DENSO Corporation funderid: https://doi.org/10.13039/100018146 – fundername: JSPS grantid: JP18K11160; JP24K02900 funderid: https://doi.org/10.13039/501100001691 |
| GroupedDBID | --M 0R~ 4.4 457 4G. 7-5 8P~ AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAXKI AAXUO AAYFN ABBOA ABJNI ABMAC ABXDB ACDAQ ACGFS ACRLP ADBBV ADEZE ADVLN AEBSH AEIPS AEKER AENEX AFJKZ AFKWA AFTJW AGHFR AGUBO AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EJD FDB FIRID FYGXN GBLVA GBOLZ HZ~ KOM M41 NCXOZ O9- OAUVE RIG ROL SPC SPCBC SSV SSZ T5K ~G- AATTM AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AIGII AIIUN AKBMS AKYEP ANKPU CITATION EFKBS EFLBG |
| ID | FETCH-LOGICAL-c253t-c4234ce682b0c13aa3db5ee3ce23a12abff0d138a58021f272e8703dbfc65bb83 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001391413600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2352-2208 |
| IngestDate | Sat Nov 29 01:44:44 EST 2025 Sat Feb 01 16:09:35 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Constrained rewriting Imperative program Concurrency Program verification Program transformation |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c253t-c4234ce682b0c13aa3db5ee3ce23a12abff0d138a58021f272e8703dbfc65bb83 |
| ORCID | 0000-0001-8697-4970 0000-0002-1111-0761 0000-0001-5194-3947 |
| ParticipantIDs | crossref_primary_10_1016_j_jlamp_2024_101033 elsevier_sciencedirect_doi_10_1016_j_jlamp_2024_101033 |
| PublicationCentury | 2000 |
| PublicationDate | February 2025 2025-02-00 |
| PublicationDateYYYYMMDD | 2025-02-01 |
| PublicationDate_xml | – month: 02 year: 2025 text: February 2025 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of logical and algebraic methods in programming |
| PublicationYear | 2025 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Dershowitz (br0190) 1987; 3 Kojima, Nishida, Matsubara (br0090) 2020 Roşu, Şerbănuţă (br0330) 2010; 79 Ciobâcă, Lucanu (br0040) 2018; vol. 10900 Kojima, Nishida (br0110) 2023; 135 Ciobâcă, Lucanu, Buruiană (br0120) 2023; 135 Ohlebusch (br0230) 2002 Roşu, Şerbănuţă (br0260) 2014; vol. 304 Kop, Nishida (br0010) 2013; vol. 8152 Şerbănuţă (br0420) Dec. 2010 Nishida, Winkler (br0050) 2018; vol. 11294 Baader, Nipkow (br0220) 1998 Falke, Kapur (br0280) 2008; vol. 5117 Fuhs, Kop, Nishida (br0020) 2017; 18 Eker, Martí-Oliet, Meseguer, Rubio, Verdejo (br0460) 2023; 134 Kojima, Nishida (br0170) 2024; 32 Buruiană, Ciobâcă (br0070) 2018; vol. 289 Fernández (br0250) 2014 Ramos, Silva, Vidal (br0180) 2007; 101 Kop (br0130) 2013 Kanazawa, Nishida (br0060) 2019; vol. 289 Falke, Kapur (br0150) 2012; vol. 7364 Kojima, Nishida (br0100) 2023; vol. 13880 Kop (br0160) 2017 Meseguer (br0440) 1992; 96 Kanazawa, Nishida, Sakai (br0080) 2019; 118 Kojima, Nishida (br0210) 2023 Zhao, Nagarakatte, Martin, Zdancewic (br0400) 2012 Kojima, Nishida (br0300) 2022 Kroening, Strichman (br0240) 2016 Ştefănescu, Ciobâcă, Mereuta, Moore, Şerbănuţă, Roşu (br0380) 2019; 15 Kop, Nishida (br0310) 2014; vol. 8858 Nishida, Kojima, Matsumi (br0200) 2023 Chen, Roşu (br0340) 2019; vol. 139 (br0430) 2007; vol. 4350 Lin, Chen, Trinh, Wang, Roşu (br0360) 2023; 7 Winkler, Middeldorp (br0030) 2018; vol. 108 Reddy (br0140) 1990; vol. 449 Tanenbaum, Woodhull (br0270) 2006 Chen, Roşu (br0350) 2019 Şerbănuţă (br0410) 2014; vol. 304 Nishida, Kojima, Kato (br0290) 2022 Barbosa, Barrett, Brain, Kremer, Lachnitt, Mann, Mohamed, Mohamed, Niemetz, Nötzli, Ozdemir, Preiner, Reynolds, Sheng, Tinelli, Zohar (br0480) 2022; vol. 13243 de Moura, Bjørner (br0320) 2008; vol. 4963 Ştefănescu, Ciobâcă, Mereuta, Moore, Şerbănuţă, Roşu (br0370) 2014; vol. 8560 Roşu, Ştefănescu, Ciobâcă, Moore (br0390) 2013 Meseguer (br0450) 1996; vol. 1119 Rubio, Martí-Oliet, Pita, Verdejo (br0470) 2022; 29 Chen (10.1016/j.jlamp.2024.101033_br0350) 2019 Zhao (10.1016/j.jlamp.2024.101033_br0400) 2012 Kojima (10.1016/j.jlamp.2024.101033_br0170) 2024; 32 Şerbănuţă (10.1016/j.jlamp.2024.101033_br0410) 2014; vol. 304 Kojima (10.1016/j.jlamp.2024.101033_br0110) 2023; 135 Kop (10.1016/j.jlamp.2024.101033_br0160) Ştefănescu (10.1016/j.jlamp.2024.101033_br0370) 2014; vol. 8560 Reddy (10.1016/j.jlamp.2024.101033_br0140) 1990; vol. 449 Nishida (10.1016/j.jlamp.2024.101033_br0290) 2022 Kojima (10.1016/j.jlamp.2024.101033_br0090) 2020 Kop (10.1016/j.jlamp.2024.101033_br0130) 2013 Ştefănescu (10.1016/j.jlamp.2024.101033_br0380) 2019; 15 Roşu (10.1016/j.jlamp.2024.101033_br0390) 2013 Roşu (10.1016/j.jlamp.2024.101033_br0330) 2010; 79 Winkler (10.1016/j.jlamp.2024.101033_br0030) 2018; vol. 108 Ohlebusch (10.1016/j.jlamp.2024.101033_br0230) 2002 Fernández (10.1016/j.jlamp.2024.101033_br0250) 2014 Rubio (10.1016/j.jlamp.2024.101033_br0470) 2022; 29 Fuhs (10.1016/j.jlamp.2024.101033_br0020) 2017; 18 Nishida (10.1016/j.jlamp.2024.101033_br0050) 2018; vol. 11294 Kroening (10.1016/j.jlamp.2024.101033_br0240) 2016 Kop (10.1016/j.jlamp.2024.101033_br0010) 2013; vol. 8152 Nishida (10.1016/j.jlamp.2024.101033_br0200) 2023 Lin (10.1016/j.jlamp.2024.101033_br0360) 2023; 7 Chen (10.1016/j.jlamp.2024.101033_br0340) 2019; vol. 139 Meseguer (10.1016/j.jlamp.2024.101033_br0440) 1992; 96 Barbosa (10.1016/j.jlamp.2024.101033_br0480) 2022; vol. 13243 Ciobâcă (10.1016/j.jlamp.2024.101033_br0040) 2018; vol. 10900 Baader (10.1016/j.jlamp.2024.101033_br0220) 1998 (10.1016/j.jlamp.2024.101033_br0430) 2007; vol. 4350 Ciobâcă (10.1016/j.jlamp.2024.101033_br0120) 2023; 135 Falke (10.1016/j.jlamp.2024.101033_br0150) 2012; vol. 7364 Kojima (10.1016/j.jlamp.2024.101033_br0300) 2022 Dershowitz (10.1016/j.jlamp.2024.101033_br0190) 1987; 3 Şerbănuţă (10.1016/j.jlamp.2024.101033_br0420) 2010 Eker (10.1016/j.jlamp.2024.101033_br0460) 2023; 134 de Moura (10.1016/j.jlamp.2024.101033_br0320) 2008; vol. 4963 Kojima (10.1016/j.jlamp.2024.101033_br0210) 2023 Meseguer (10.1016/j.jlamp.2024.101033_br0450) 1996; vol. 1119 Falke (10.1016/j.jlamp.2024.101033_br0280) 2008; vol. 5117 Ramos (10.1016/j.jlamp.2024.101033_br0180) 2007; 101 Roşu (10.1016/j.jlamp.2024.101033_br0260) 2014; vol. 304 Tanenbaum (10.1016/j.jlamp.2024.101033_br0270) 2006 Kanazawa (10.1016/j.jlamp.2024.101033_br0060) 2019; vol. 289 Kop (10.1016/j.jlamp.2024.101033_br0310) 2014; vol. 8858 Kanazawa (10.1016/j.jlamp.2024.101033_br0080) 2019; 118 Kojima (10.1016/j.jlamp.2024.101033_br0100) 2023; vol. 13880 Buruiană (10.1016/j.jlamp.2024.101033_br0070) 2018; vol. 289 |
| References_xml | – volume: vol. 289 start-page: 1 year: 2018 end-page: 16 ident: br0070 article-title: Reducing total correctness to partial correctness by a transformation of the language semantics publication-title: Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – volume: 135 start-page: 1 year: 2023 end-page: 19 ident: br0110 article-title: Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting publication-title: J. Log. Algebraic Methods Program. – volume: 18 start-page: 14:1 year: 2017 end-page: 14:50 ident: br0020 article-title: Verifying procedural programs via constrained rewriting induction publication-title: ACM Trans. Comput. Log. – start-page: 1 year: 2019 end-page: 13 ident: br0350 article-title: Matching publication-title: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science – volume: vol. 10900 start-page: 295 year: 2018 end-page: 311 ident: br0040 article-title: A coinductive approach to proving reachability properties in logically constrained term rewriting systems publication-title: Proceedings of the 9th International Joint Conference on Automated Reasoning – volume: 101 start-page: 220 year: 2007 end-page: 226 ident: br0180 article-title: Ensuring the quasi-termination of needed narrowing computations publication-title: Inf. Process. Lett. – year: 2016 ident: br0240 article-title: Decision Procedures: An Algorithmic Point of View publication-title: Texts in Theoretical Computer Science. An EATCS Series – volume: vol. 8560 start-page: 425 year: 2014 end-page: 440 ident: br0370 article-title: All-path reachability logic publication-title: Proceedings of the Joint International Conference on Rewriting and Typed Lambda Calculi – volume: vol. 108 start-page: 30:1 year: 2018 end-page: 30:18 ident: br0030 article-title: Completion for logically constrained rewriting publication-title: Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction – start-page: 1 year: 2023 end-page: 6 ident: br0210 article-title: On representations of waiting queues for semaphores in logically constrained term rewrite systems publication-title: Informal Proceedings of the 10th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – volume: vol. 449 start-page: 162 year: 1990 end-page: 177 ident: br0140 article-title: Term rewriting induction publication-title: Proceedings of the 10th International Conference on Automated Deduction – year: 2006 ident: br0270 article-title: Operating Systems — Design and Implementation – year: 2002 ident: br0230 article-title: Advanced Topics in Term Rewriting – volume: 7 start-page: 56 year: 2023 end-page: 84 ident: br0360 article-title: Generating proof certificates for a language-agnostic deductive program verifier publication-title: Proc. ACM Program. Lang. – start-page: 1 year: 2022 end-page: 16 ident: br0290 article-title: On transforming imperative programs into logically constrained term rewrite systems via injective functions from configurations to terms publication-title: Informal Proceedings of the 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – volume: 96 start-page: 73 year: 1992 end-page: 155 ident: br0440 article-title: Conditioned rewriting logic as a united model of concurrency publication-title: Theor. Comput. Sci. – volume: 79 start-page: 397 year: 2010 end-page: 434 ident: br0330 article-title: An overview of the K semantic framework publication-title: J. Log. Algebraic Program. – volume: 3 start-page: 69 year: 1987 end-page: 116 ident: br0190 article-title: Termination of rewriting publication-title: J. Symb. Comput. – volume: vol. 304 start-page: 3 year: 2014 end-page: 56 ident: br0260 article-title: K overview and SIMPLE case study publication-title: Proceedings of the Second International Workshop on the K Framework and Its Applications (K 2011) – start-page: 1 year: 2022 end-page: 16 ident: br0300 article-title: On reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting publication-title: Informal Proceedings of the 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – start-page: 427 year: 2012 end-page: 440 ident: br0400 article-title: Formalizing the LLVM intermediate representation for verified program transformations publication-title: Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages – year: 2014 ident: br0250 article-title: Programming Languages and Operational Semantics – A Concise Overview publication-title: Undergraduate Topics in Computer Science – volume: vol. 8152 start-page: 343 year: 2013 end-page: 358 ident: br0010 article-title: Term rewriting with logical constraints publication-title: Proceedings of the 9th International Symposium on Frontiers of Combining Systems – volume: vol. 7364 start-page: 241 year: 2012 end-page: 255 ident: br0150 article-title: Rewriting induction + linear arithmetic = decision procedure publication-title: Proceedings of the 6th International Joint Conference on Automated Reasoning – year: 2017 ident: br0160 article-title: Quasi-reductivity of logically constrained term rewriting systems – start-page: 1 year: 2023 end-page: 11 ident: br0200 article-title: A nesting-preserving transformation of simp programs into logically constrained term rewrite systems publication-title: Informal Proceedings of the 10th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – start-page: 59 year: 2013 end-page: 63 ident: br0130 article-title: Termination of LCTRSs publication-title: Proceedings of the 13th International Workshop on Termination – volume: vol. 4350 year: 2007 ident: br0430 publication-title: All About Maude – A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic – year: 1998 ident: br0220 article-title: Term Rewriting and All That – volume: vol. 13243 start-page: 415 year: 2022 end-page: 442 ident: br0480 article-title: cvc5: a versatile and industrial-strength SMT solver publication-title: Proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems – volume: 32 start-page: 417 year: 2024 end-page: 435 ident: br0170 article-title: On representations of waiting queues for semaphores in logically constrained term rewrite systems with constant destinations publication-title: J. Inf. Process. – volume: vol. 5117 start-page: 94 year: 2008 end-page: 109 ident: br0280 article-title: Dependency pairs for rewriting with built-in numbers and semantic data structures publication-title: Proceedings of the 19th International Conference on Rewriting Techniques and Applications – volume: 118 start-page: 67 year: 2019 end-page: 72 ident: br0080 article-title: On representation of structures and unions in logically constrained rewriting – volume: 135 start-page: 1 year: 2023 end-page: 22 ident: br0120 article-title: Operationally-based program equivalence proofs using LCTRSs publication-title: J. Log. Algebraic Methods Program. – year: Dec. 2010 ident: br0420 article-title: A rewriting approach to concurrent programming language design and semantics – volume: vol. 13880 start-page: 161 year: 2023 end-page: 179 ident: br0100 article-title: From starvation freedom to all-path reachability problems in constrained rewriting publication-title: Proceedings of the 25th International Symposium on Practical Aspects of Declarative Languages – volume: vol. 304 start-page: 167 year: 2014 end-page: 182 ident: br0410 article-title: Rewriting semantics and analysis of concurrency features for a C-like language publication-title: Proceedings of the Second International Workshop on the K Framework and Its Applications (K 2011) – volume: vol. 8858 start-page: 334 year: 2014 end-page: 353 ident: br0310 article-title: Automatic constrained rewriting induction towards verifying procedural programs publication-title: Proceedings of the 12th Asian Symposium on Programming Languages and Systems – volume: vol. 139 start-page: 1:1 year: 2019 end-page: 1:4 ident: br0340 article-title: Matching mu-logic: foundation of K framework (invited paper) publication-title: Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science – start-page: 1 year: 2020 end-page: 12 ident: br0090 article-title: Transforming concurrent programs with semaphores into logically constrained term rewrite systems publication-title: Informal Proceedings of the 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – volume: 29 start-page: 7 year: 2022 ident: br0470 article-title: Model checking strategy-controlled systems in rewriting logic publication-title: Autom. Softw. Eng. – volume: vol. 289 start-page: 34 year: 2019 end-page: 52 ident: br0060 article-title: On transforming functions accessing global variables into logically constrained term rewriting systems publication-title: Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation – volume: vol. 4963 start-page: 337 year: 2008 end-page: 340 ident: br0320 article-title: Z3: an efficient SMT solver publication-title: Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems – volume: 15 year: 2019 ident: br0380 article-title: All-path reachability logic publication-title: Log. Methods Comput. Sci. – volume: vol. 11294 start-page: 309 year: 2018 end-page: 321 ident: br0050 article-title: Loop detection by logically constrained term rewriting publication-title: Proceedings of the 10th Working Conference on Verified Software: Theories, Tools, and Experiments – start-page: 358 year: 2013 end-page: 367 ident: br0390 article-title: One-path reachability logic publication-title: Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science – volume: vol. 1119 start-page: 331 year: 1996 end-page: 372 ident: br0450 article-title: Rewriting logic as a semantic framework for concurrency: a progress report publication-title: Proceedings of the 7th International Conference on Concurrency Theory – volume: 134 year: 2023 ident: br0460 article-title: The maude strategy language publication-title: J. Log. Algebraic Methods Program. – volume: 32 start-page: 417 year: 2024 ident: 10.1016/j.jlamp.2024.101033_br0170 article-title: On representations of waiting queues for semaphores in logically constrained term rewrite systems with constant destinations publication-title: J. Inf. Process. – volume: vol. 108 start-page: 30:1 year: 2018 ident: 10.1016/j.jlamp.2024.101033_br0030 article-title: Completion for logically constrained rewriting – volume: vol. 289 start-page: 34 year: 2019 ident: 10.1016/j.jlamp.2024.101033_br0060 article-title: On transforming functions accessing global variables into logically constrained term rewriting systems – year: 2010 ident: 10.1016/j.jlamp.2024.101033_br0420 – volume: 135 start-page: 1 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0110 article-title: Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting publication-title: J. Log. Algebraic Methods Program. – volume: vol. 8858 start-page: 334 year: 2014 ident: 10.1016/j.jlamp.2024.101033_br0310 article-title: Automatic constrained rewriting induction towards verifying procedural programs – start-page: 427 year: 2012 ident: 10.1016/j.jlamp.2024.101033_br0400 article-title: Formalizing the LLVM intermediate representation for verified program transformations – start-page: 1 year: 2022 ident: 10.1016/j.jlamp.2024.101033_br0290 article-title: On transforming imperative programs into logically constrained term rewrite systems via injective functions from configurations to terms – volume: vol. 8560 start-page: 425 year: 2014 ident: 10.1016/j.jlamp.2024.101033_br0370 article-title: All-path reachability logic – start-page: 1 year: 2020 ident: 10.1016/j.jlamp.2024.101033_br0090 article-title: Transforming concurrent programs with semaphores into logically constrained term rewrite systems – volume: vol. 13243 start-page: 415 year: 2022 ident: 10.1016/j.jlamp.2024.101033_br0480 article-title: cvc5: a versatile and industrial-strength SMT solver – year: 1998 ident: 10.1016/j.jlamp.2024.101033_br0220 – year: 2002 ident: 10.1016/j.jlamp.2024.101033_br0230 – ident: 10.1016/j.jlamp.2024.101033_br0160 – volume: vol. 8152 start-page: 343 year: 2013 ident: 10.1016/j.jlamp.2024.101033_br0010 article-title: Term rewriting with logical constraints – volume: 3 start-page: 69 issue: 1/2 year: 1987 ident: 10.1016/j.jlamp.2024.101033_br0190 article-title: Termination of rewriting publication-title: J. Symb. Comput. doi: 10.1016/S0747-7171(87)80022-6 – start-page: 1 year: 2022 ident: 10.1016/j.jlamp.2024.101033_br0300 article-title: On reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting – volume: vol. 7364 start-page: 241 year: 2012 ident: 10.1016/j.jlamp.2024.101033_br0150 article-title: Rewriting induction + linear arithmetic = decision procedure – year: 2014 ident: 10.1016/j.jlamp.2024.101033_br0250 article-title: Programming Languages and Operational Semantics – A Concise Overview – volume: 118 start-page: 67 issue: 385 year: 2019 ident: 10.1016/j.jlamp.2024.101033_br0080 article-title: On representation of structures and unions in logically constrained rewriting – volume: 135 start-page: 1 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0120 article-title: Operationally-based program equivalence proofs using LCTRSs publication-title: J. Log. Algebraic Methods Program. – volume: vol. 4350 year: 2007 ident: 10.1016/j.jlamp.2024.101033_br0430 – volume: vol. 1119 start-page: 331 year: 1996 ident: 10.1016/j.jlamp.2024.101033_br0450 article-title: Rewriting logic as a semantic framework for concurrency: a progress report – start-page: 59 year: 2013 ident: 10.1016/j.jlamp.2024.101033_br0130 article-title: Termination of LCTRSs – volume: vol. 449 start-page: 162 year: 1990 ident: 10.1016/j.jlamp.2024.101033_br0140 article-title: Term rewriting induction – start-page: 1 year: 2019 ident: 10.1016/j.jlamp.2024.101033_br0350 article-title: Matching μ-logic – volume: 134 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0460 article-title: The maude strategy language publication-title: J. Log. Algebraic Methods Program. – volume: 18 start-page: 14:1 issue: 2 year: 2017 ident: 10.1016/j.jlamp.2024.101033_br0020 article-title: Verifying procedural programs via constrained rewriting induction publication-title: ACM Trans. Comput. Log. doi: 10.1145/3060143 – volume: 15 issue: 2 year: 2019 ident: 10.1016/j.jlamp.2024.101033_br0380 article-title: All-path reachability logic publication-title: Log. Methods Comput. Sci. – volume: 29 start-page: 7 issue: 1 year: 2022 ident: 10.1016/j.jlamp.2024.101033_br0470 article-title: Model checking strategy-controlled systems in rewriting logic publication-title: Autom. Softw. Eng. doi: 10.1007/s10515-021-00307-9 – volume: vol. 11294 start-page: 309 year: 2018 ident: 10.1016/j.jlamp.2024.101033_br0050 article-title: Loop detection by logically constrained term rewriting – year: 2016 ident: 10.1016/j.jlamp.2024.101033_br0240 article-title: Decision Procedures: An Algorithmic Point of View – volume: 96 start-page: 73 issue: 1 year: 1992 ident: 10.1016/j.jlamp.2024.101033_br0440 article-title: Conditioned rewriting logic as a united model of concurrency publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(92)90182-F – volume: vol. 4963 start-page: 337 year: 2008 ident: 10.1016/j.jlamp.2024.101033_br0320 article-title: Z3: an efficient SMT solver – volume: vol. 13880 start-page: 161 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0100 article-title: From starvation freedom to all-path reachability problems in constrained rewriting – volume: vol. 304 start-page: 3 year: 2014 ident: 10.1016/j.jlamp.2024.101033_br0260 article-title: K overview and SIMPLE case study – year: 2006 ident: 10.1016/j.jlamp.2024.101033_br0270 – volume: vol. 10900 start-page: 295 year: 2018 ident: 10.1016/j.jlamp.2024.101033_br0040 article-title: A coinductive approach to proving reachability properties in logically constrained term rewriting systems – start-page: 1 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0200 article-title: A nesting-preserving transformation of simp programs into logically constrained term rewrite systems – volume: vol. 5117 start-page: 94 year: 2008 ident: 10.1016/j.jlamp.2024.101033_br0280 article-title: Dependency pairs for rewriting with built-in numbers and semantic data structures – start-page: 358 year: 2013 ident: 10.1016/j.jlamp.2024.101033_br0390 article-title: One-path reachability logic – volume: vol. 289 start-page: 1 year: 2018 ident: 10.1016/j.jlamp.2024.101033_br0070 article-title: Reducing total correctness to partial correctness by a transformation of the language semantics – volume: vol. 304 start-page: 167 year: 2014 ident: 10.1016/j.jlamp.2024.101033_br0410 article-title: Rewriting semantics and analysis of concurrency features for a C-like language – start-page: 1 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0210 article-title: On representations of waiting queues for semaphores in logically constrained term rewrite systems – volume: 101 start-page: 220 issue: 5 year: 2007 ident: 10.1016/j.jlamp.2024.101033_br0180 article-title: Ensuring the quasi-termination of needed narrowing computations publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2006.09.010 – volume: 79 start-page: 397 issue: 6 year: 2010 ident: 10.1016/j.jlamp.2024.101033_br0330 article-title: An overview of the K semantic framework publication-title: J. Log. Algebraic Program. doi: 10.1016/j.jlap.2010.03.012 – volume: vol. 139 start-page: 1:1 year: 2019 ident: 10.1016/j.jlamp.2024.101033_br0340 article-title: Matching mu-logic: foundation of K framework (invited paper) – volume: 7 start-page: 56 issue: OOPSLA1 year: 2023 ident: 10.1016/j.jlamp.2024.101033_br0360 article-title: Generating proof certificates for a language-agnostic deductive program verifier publication-title: Proc. ACM Program. Lang. doi: 10.1145/3586029 |
| SSID | ssj0001687831 |
| Score | 2.3290777 |
| Snippet | In this paper, as a first step of modeling concurrent programs by logically constrained term rewrite systems (LCTRSs, for short), we show transformations of... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 101033 |
| SubjectTerms | Concurrency Constrained rewriting Imperative program Program transformation Program verification |
| Title | Transforming concurrent programs with semaphores into logically constrained term rewrite systems |
| URI | https://dx.doi.org/10.1016/j.jlamp.2024.101033 |
| Volume | 143 |
| WOSCitedRecordID | wos001391413600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 2352-2208 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001687831 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELYK9NALpS8BLciH3miqrJ2HfUQVVVsJhASV9hYcxym7sNlVkuXx7xm_NuFRRCtxiSJr7axmvkw-2TPfIPRZ0SiiMlYBcFEZRGlSBoLSIigpIwJAwNI8NM0m0oMDNhzyQ5c61Jh2AmlVsasrPntWV8MYOFuXzv6DuxeLwgDcg9PhCm6H69Mc76moLaetpFNgcplYrpytURMxO53WJh8L-KcLgefXekpjGkcAFdVxe6dWlzUQUyf63PyFzvoYasRfz__o8-iRdA2qba66ff7EfytNvc14NBE2e78BKts7JDkdFcJG_2k3vi_aZq6PR8yHY96KM9HftSCxT3T2W2m-nOZWticBNhgQErJb4dnKON0L9XbXYfx1DG-OFh4lkR4LrazGHQ3tI72yXlhnzGoJxCW0QtKYQxhc2f25N_zVbcslLGWmi-Xiz3itKpMVeO9pD_OZHkc5XkOrzht414LiDXqhqrfotW_cgV0cf4dO-hjBHUawxwjWGMEdRrDGCF5gBPcwgjVGsMMIdhh5j35_3zv-9iNwrTYCSWLaBhJYdSRVwkgeygEVghZ5rBSVilAxICIvy7AYUCZiBqSwJClREOjhR6VM4jxn9ANarqaVWkdYcR5p1cBSpkUkJOdERblkJU9Ezosi3kBfvMGymVVUyXyq4Tgz9s20fTNr3w2UeKNmjhRaspcBEB6buPm_Ez-iVx1iP6Hltp6rLfRSXrSjpt52gLkBg1ePuQ |
| linkProvider | Elsevier |
| 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=Transforming+concurrent+programs+with+semaphores+into+logically+constrained+term+rewrite+systems&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Kojima%2C+Misaki&rft.au=Nishida%2C+Naoki&rft.au=Matsubara%2C+Yutaka&rft.date=2025-02-01&rft.pub=Elsevier+Inc&rft.issn=2352-2208&rft.volume=143&rft_id=info:doi/10.1016%2Fj.jlamp.2024.101033&rft.externalDocID=S2352220824000877 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon |