Denotational Semantics for Abadi and Leino’s Logic of Objects

Denotational Semantics for Abadi and Leino’s Logic of Objects

Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store (”higher-order store”). We present a new soundness proof for this logic using a denotational seman...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Reus, Bernhard, Schwinghammer, Jan
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming languages
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 278
container_issue
container_start_page 263
container_title
container_volume
creator Reus, Bernhard
Schwinghammer, Jan
description Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store (”higher-order store”). We present a new soundness proof for this logic using a denotational semantics where object specifications are recursive predicates on the domain of objects. Our semantics reveals which of the limitations of Abadi and Leino’s logic are deliberate design decisions and which follow from the use of higher-order store. We discuss the implications for the development of other, more expressive, program logics.
doi_str_mv 10.1007/978-3-540-31987-0_19
format Book Chapter
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16894959</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16894959</sourcerecordid><originalsourceid>FETCH-LOGICAL-p274t-327ccf07a800765f69b7937cf7d8945b5048e4d6ae9fe76262bc08173b44ae7c3</originalsourceid><addsrcrecordid>eNotkLtOAzEQRc1LIoT8AYUbSoPt8WNdoSg8pZVSALXl9drRhmQdrbeh4zf4Pb4EkzDNSPfemdEchK4YvWGU6lujKwJECkqAmUoTapk5QhdQlL0gj9GEKcYIgDAnB4NLAbI6RRMKlBOjBZyjWc5rWqoMKQoTdHcf-jS6sUu92-DXsHX92PmMYxrwvHFth13f4jp0ffr5-s64TqvO4xTxslkHP-ZLdBbdJofZf5-i98eHt8UzqZdPL4t5TXZci5EA195Hql1VnlEyKtNoA9pH3VZGyEZSUQXRKhdMDFpxxRtPK6ahEcIF7WGKrg97dy57t4mD632X7W7otm74tEyVNUaakuOHXC5WvwqDbVL6yJYVYOW0LRwt2ALH7rHZP47wCwdGYHw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Denotational Semantics for Abadi and Leino’s Logic of Objects</title><source>Springer Books</source><creator>Reus, Bernhard ; Schwinghammer, Jan</creator><contributor>Sagiv, Mooly</contributor><creatorcontrib>Reus, Bernhard ; Schwinghammer, Jan ; Sagiv, Mooly</creatorcontrib><description>Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store (”higher-order store”). We present a new soundness proof for this logic using a denotational semantics where object specifications are recursive predicates on the domain of objects. Our semantics reveals which of the limitations of Abadi and Leino’s logic are deliberate design decisions and which follow from the use of higher-order store. We discuss the implications for the development of other, more expressive, program logics.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540254358</identifier><identifier>ISBN: 9783540254355</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319875</identifier><identifier>EISBN: 9783540319870</identifier><identifier>DOI: 10.1007/978-3-540-31987-0_19</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Programming languages ; Software</subject><ispartof>Lecture notes in computer science, 2005, p.263-278</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-31987-0_19$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-31987-0_19$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16894959$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Sagiv, Mooly</contributor><creatorcontrib>Reus, Bernhard</creatorcontrib><creatorcontrib>Schwinghammer, Jan</creatorcontrib><title>Denotational Semantics for Abadi and Leino’s Logic of Objects</title><title>Lecture notes in computer science</title><description>Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store (”higher-order store”). We present a new soundness proof for this logic using a denotational semantics where object specifications are recursive predicates on the domain of objects. Our semantics reveals which of the limitations of Abadi and Leino’s logic are deliberate design decisions and which follow from the use of higher-order store. We discuss the implications for the development of other, more expressive, program logics.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Programming languages</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540254358</isbn><isbn>9783540254355</isbn><isbn>3540319875</isbn><isbn>9783540319870</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkLtOAzEQRc1LIoT8AYUbSoPt8WNdoSg8pZVSALXl9drRhmQdrbeh4zf4Pb4EkzDNSPfemdEchK4YvWGU6lujKwJECkqAmUoTapk5QhdQlL0gj9GEKcYIgDAnB4NLAbI6RRMKlBOjBZyjWc5rWqoMKQoTdHcf-jS6sUu92-DXsHX92PmMYxrwvHFth13f4jp0ffr5-s64TqvO4xTxslkHP-ZLdBbdJofZf5-i98eHt8UzqZdPL4t5TXZci5EA195Hql1VnlEyKtNoA9pH3VZGyEZSUQXRKhdMDFpxxRtPK6ahEcIF7WGKrg97dy57t4mD632X7W7otm74tEyVNUaakuOHXC5WvwqDbVL6yJYVYOW0LRwt2ALH7rHZP47wCwdGYHw</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Reus, Bernhard</creator><creator>Schwinghammer, Jan</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Denotational Semantics for Abadi and Leino’s Logic of Objects</title><author>Reus, Bernhard ; Schwinghammer, Jan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p274t-327ccf07a800765f69b7937cf7d8945b5048e4d6ae9fe76262bc08173b44ae7c3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Programming languages</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Reus, Bernhard</creatorcontrib><creatorcontrib>Schwinghammer, Jan</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Reus, Bernhard</au><au>Schwinghammer, Jan</au><au>Sagiv, Mooly</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Denotational Semantics for Abadi and Leino’s Logic of Objects</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>263</spage><epage>278</epage><pages>263-278</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540254358</isbn><isbn>9783540254355</isbn><eisbn>3540319875</eisbn><eisbn>9783540319870</eisbn><abstract>Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store (”higher-order store”). We present a new soundness proof for this logic using a denotational semantics where object specifications are recursive predicates on the domain of objects. Our semantics reveals which of the limitations of Abadi and Leino’s logic are deliberate design decisions and which follow from the use of higher-order store. We discuss the implications for the development of other, more expressive, program logics.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-31987-0_19</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2005, p.263-278
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16894959
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming languages
Software
title Denotational Semantics for Abadi and Leino’s Logic of Objects
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T01%3A52%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Denotational%20Semantics%20for%20Abadi%20and%20Leino%E2%80%99s%20Logic%20of%20Objects&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Reus,%20Bernhard&rft.date=2005&rft.spage=263&rft.epage=278&rft.pages=263-278&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540254358&rft.isbn_list=9783540254355&rft_id=info:doi/10.1007/978-3-540-31987-0_19&rft_dat=%3Cpascalfrancis_sprin%3E16894959%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319875&rft.eisbn_list=9783540319870&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true