{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1363670320219654912.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1145/363235.363259"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/10.1145/363235.363259"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/pdf/10.1145/363235.363259"}},{"identifier":{"@type":"NAID","@value":"30022112080"}}],"dc:title":[{"@value":"An axiomatic basis for computer programming"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:p>In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantage, both theoretical and practical, may follow from a pursuance of these topics.</jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1580572701443929472","@type":"Researcher","foaf:name":[{"@value":"C. A. R. Hoare"}],"jpcoar:affiliationName":[{"@value":"Queen's Univ. of Belfast, Northern Ireland"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00010782"},{"@type":"EISSN","@value":"15577317"}],"prism:publicationName":[{"@value":"Communications of the ACM"}],"dc:publisher":[{"@value":"Association for Computing Machinery (ACM)"}],"prism:publicationDate":"1969-10","prism:volume":"12","prism:number":"10","prism:startingPage":"576","prism:endingPage":"580"},"reviewed":"false","dc:rights":["https://www.acm.org/publications/policies/copyright_policy#Background"],"url":[{"@id":"https://dl.acm.org/doi/10.1145/363235.363259"},{"@id":"https://dl.acm.org/doi/pdf/10.1145/363235.363259"}],"createdAt":"2002-07-27","modifiedAt":"2025-06-17","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1050001337883766784","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"多重ループからの脱出でのgoto文の是非：Hoare論理の観点から"},{"@language":"en","@value":"On the Use of goto's in Escaping from Nested Loops: from the Hoare Logic Viewpoint"},{"@language":"ja-Kana","@value":"タジュウ ループ カラ ノ ダッシュツ デ ノ gotoブン ノ ゼヒ Hoare ロンリ ノ カンテン カラ"}]},{"@id":"https://cir.nii.ac.jp/crid/1050001337887698176","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"A General - Purpose Reasoning Assistant System EUODHILOS -Basic Features and Potential Usefulness- Every universe of discourse has its logical structure. S. K. Langer (1925)"},{"@language":"en","@value":"A General - Purpose Reasoning Assistant System EUODHILOS -Basic Features and Potential Usefulness- Every universe of discourse has its logical structure. S. K. Langer (1925)"}]},{"@id":"https://cir.nii.ac.jp/crid/1050282677609646592","@type":"Article","resourceType":"会議発表資料(conference paper)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Automating relatively complete verification of higher-order functional programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1050282812863376128","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"A Systematic Approach to Parallel Program Verification"},{"@language":"en","@value":"A Systematic Approach to Parallel Program Verification"},{"@language":"ja-Kana","@value":"Systematic Approach to Parallel Program"}]},{"@id":"https://cir.nii.ac.jp/crid/1050564287840106112","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"Using BAN Logic for the Proof of a Network Address Registration Protocol"},{"@language":"en","@value":"Using BAN Logic for the Proof of a Network Address Registration Protocol"}]},{"@id":"https://cir.nii.ac.jp/crid/1050564287841276032","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"プログラムにおける実時間問題のν－転換による解析と動作条件"},{"@language":"en","@value":"An Analysis of a Real Time Problem Using ν - Conversion and Its Safety Conditions"}]},{"@id":"https://cir.nii.ac.jp/crid/1050845762467291520","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"A Behavioral Specification of Imperative Programming Languages"}]},{"@id":"https://cir.nii.ac.jp/crid/1050845762813857792","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"有限状態機械に基づくプログラミングでのgoto文使用の是非：Hoare論理の観点から"},{"@language":"en","@value":"On the Use of goto's in Programming Based on Finite State Machines: From the Hoare Logic Viewpoint"},{"@language":"ja-Kana","@value":"ユウゲン ジョウタイ キカイ ニ モトヅク プログラミング デ ノ gotoブン シヨウ ノ ゼヒ Hoare ロンリ ノ カンテン カラ"}]},{"@id":"https://cir.nii.ac.jp/crid/1050845762817978880","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"汎用論証支援システムEUODHILOSの応用と評価"},{"@language":"en","@value":"Application and Evaluation of General - Purpose Reasoning Assistant System EUODHILOS"}]},{"@id":"https://cir.nii.ac.jp/crid/1050845763734809216","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"関数呼び出しを持つプログラムの非線形ループ不変式の自動生成"},{"@language":"ja-Kana","@value":"カンスウ ヨビダシ オ モツ プログラム ノ ヒセンケイ ループ フヘンシキ ノ ジドウ セイセイ"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004230785895296","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Generic Weakest Precondition Semantics from Monads Enriched with Order"}]},{"@id":"https://cir.nii.ac.jp/crid/1360004236277831552","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Polymorphic Manifest Contracts, Revised and Resolved"}]},{"@id":"https://cir.nii.ac.jp/crid/1360283690777329280","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Semantics of higher-order quantum computation via geometry of interaction"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298757420354560","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Goal-Aware RSS for Complex Scenarios via Program Logic"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567186231510272","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Stateful manifest contracts"}]},{"@id":"https://cir.nii.ac.jp/crid/1360576118768012416","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"SIT-SE: A Specification-Based Incremental Testing Method With Symbolic Execution"}]},{"@id":"https://cir.nii.ac.jp/crid/1360584341809927936","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360587979571223808","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Relative Completeness of Incorrectness Separation Logic"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655435983616","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Nonstandard Static Analysis: Literal Transfer of Deductive Verification Frameworks from Discrete to Hybrid"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657452672896","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Completeness for recursive procedures in separation logic"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848661206951424","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Healthiness from Duality"}]},{"@id":"https://cir.nii.ac.jp/crid/1360853567833588224","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Relational characterisations of paths"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137046414861184","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Observation-Based Concurrent Program Logic for Relaxed Memory Consistency Models"}]},{"@id":"https://cir.nii.ac.jp/crid/1361975846141570944","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Packet Reachability Verification in OpenFlow Networks"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204738279808","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Assertion Verification Design by Active Function."},{"@language":"ja","@value":"続・システム検証の科学技術　　能動関数によるアサーション検証設計"},{"@value":"能動関数によるアサーション検証設計"},{"@language":"ja-Kana","@value":"ノウドウ カンスウ ニ ヨル アサーション ケンショウ セッケイ"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679714267008","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"Assertions: a personal perspective"},{"@language":"en","@value":"Assertions: a personal perspective"},{"@value":"2001年京都賞受賞講演 Assertions: a personal perspective〔英文〕"},{"@language":"ja-Kana","@value":"2001ネン キョウトショウ ジュショウ コウエン Assertions a personal perspective エイブン"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680060482304","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"暗号安全性証明の確率Hoare 論理を用いた形式的検証"},{"@language":"en","@value":"Formal Verification of Security Proofs of Cryptographic Schemes Using Probabilistic Hoare Logic"},{"@language":"ja-Kana","@value":"アンゴウ アンゼンセイ ショウメイ ノ カクリツ Hoare ロンリ オ モチイタ ケイシキテキ ケンショウ"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680084525440","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Software Development and Testing for Machine Learning Studies"},{"@language":"ja","@value":"機械学習研究におけるプログラム開発と検証"}]},{"@id":"https://cir.nii.ac.jp/crid/1390587903889921792","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Incorrectness Separation Logic with Arrays and Pointer Arithmetic"}]},{"@id":"https://cir.nii.ac.jp/crid/1520009409283596160","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"クリーニ代数入門"},{"@language":"ja-Kana","@value":"クリーニ ダイスウ ニュウモン"}]},{"@id":"https://cir.nii.ac.jp/crid/1520290885251426688","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"IO正則表現によるデータフローネットワークの検証"},{"@language":"ja-Kana","@value":"IO セイソクヒョウゲン ニ ヨル データフローネットワーク ノ ケンショウ"}]},{"@id":"https://cir.nii.ac.jp/crid/1520853834438327552","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"データ管理領域におけるプログラム検証の自動化に関する考察"},{"@language":"ja-Kana","@value":"データ カンリ リョウイキ ニ オケル プログラム ケンショウ ノ ジドウカ ニ カンスル コウサツ"}]},{"@id":"https://cir.nii.ac.jp/crid/1520853835232729216","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"プログラム変更に対する正当性検証技法と分割技法の適用"},{"@language":"ja-Kana","@value":"プログラム ヘンコウ ニ タイスル セイトウセイ ケンショウ ギホウ ト ブン"}]},{"@id":"https://cir.nii.ac.jp/crid/1573950402231987328","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"An Approach to Specifying Concurrent, Distributed, and Autonomous Object Behaviors Using a High-Level Meta-Object Protocol"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1145/363235.363259"},{"@type":"CIA","@value":"30022112080"},{"@type":"CROSSREF","@value":"10.1007/978-3-662-44124-4_2_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1145/2994594_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1527/tjsai.27.253_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1145/2429069.2429081_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-47958-3_4_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1016/j.tcs.2015.03.047_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1016/j.tcs.2016.04.004_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1109/tiv.2022.3169762_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1145/3009837.3009875_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1016/j.apal.2016.10.010_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1016/j.artint.2023.104045_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.2197/ipsjjip.33.826_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1007/978-981-97-8943-6_13_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1007/978-3-030-17910-6_1_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1145/2933575.2935319_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1016/j.jlamp.2020.100590_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1109/tr.2021.3078714_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.4216/jpssj.45.15_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"},{"@type":"CROSSREF","@value":"10.1145/3384544.3384573_references_DOI_3xy1KWftwxH8nkVtwlm3xbiUUWV"}]}