Model checking linear logic specifications
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi,...
Uloženo v:
| Vydáno v: | Theory and practice of logic programming Ročník 4; číslo 5-6; s. 573 - 619 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, UK
Cambridge University Press
01.09.2004
|
| Témata: | |
| ISSN: | 1471-0684, 1475-3081 |
| 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 | The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems (Andreoli, 1992; Cervesato, 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al., 2002). Following this line of research, we define here a general framework for the bottom-up. evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings Abdulla et al., 1996; Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic. |
|---|---|
| AbstractList | The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems (Andreoli, 1992; Cervesato, 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al., 2002). Following this line of research, we define here a general framework for the bottom-up. evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings Abdulla et al., 1996; Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic. The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems (Andreoli, 1992; Cervesato, 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al., 2002). Following this line of research, we define here a general framework for the bottom-up. evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings Abdulla et al., 1996; Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic. [PUBLICATION ABSTRACT] |
| Author | BOZZANO, MARCO MARTELLI, MAURIZIO DELZANNO, GIORGIO |
| Author_xml | – sequence: 1 givenname: MARCO surname: BOZZANO fullname: BOZZANO, MARCO email: bozzano@irst.itc.it organization: ITC-IRST, Via Sommarive 18, Povo, 38050 Trento, Italy (e-mail: bozzano@irst.itc.it) – sequence: 2 givenname: GIORGIO surname: DELZANNO fullname: DELZANNO, GIORGIO email: giorgio@disi.unige.it organization: Dipartimento di Informatica e Scienze dell'Informazione, Università di Genova, Via Dodecaneso 35, 16146 Genova, Italy (e-mail: giorgio@disi.unige.it, martelli@disi.unige.it) – sequence: 3 givenname: MAURIZIO surname: MARTELLI fullname: MARTELLI, MAURIZIO email: giorgio@disi.unige.it organization: Dipartimento di Informatica e Scienze dell'Informazione, Università di Genova, Via Dodecaneso 35, 16146 Genova, Italy (e-mail: giorgio@disi.unige.it, martelli@disi.unige.it) |
| BookMark | eNp1kE1LAzEQhoNUsK3-AG-LR2F18r17lOIXVDyo5yVNZmvqNqnJ9uC_d2sLHsTTDDPzvPPyTsgoxICEnFO4okD19QsVmoKqBAgABkodkfEwkiWHio5-elru9idkkvMKgCrOxJhcPkWHXWHf0X74sCw6H9CkootLb4u8Qetbb03vY8in5Lg1XcazQ52St7vb19lDOX--f5zdzEvLlOpLp9FIbpSzqhVOgqqFoeAcODRKouYLJw223LAWKyYkOKqYlEJzAG4XNZ-Si73uJsXPLea-WcVtCsPLhg22a60H71NC90c2xZwTts0m-bVJXw2FZpdI8yeRgeEHxqwXybsl_ir_T30DhyVi5Q |
| ContentType | Journal Article |
| Copyright | 2004 Cambridge University Press |
| Copyright_xml | – notice: 2004 Cambridge University Press |
| DBID | AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U |
| DOI | 10.1017/S1471068404002066 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1475-3081 |
| EndPage | 619 |
| ExternalDocumentID | 1403176431 10_1017_S1471068404002066 |
| Genre | Feature |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 3V. 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAEED AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYOK ABBXD ABITZ ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABZCX ACBMC ACCHT ACGFS ACIMK ACNCT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AEYYC AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGOOT AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ATUCA AUXHV AZQEC BBLKV BENPR BGHMG BGLVJ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCTKK CFAFE CHEAL CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EJD GNUQQ HCIFZ HG- HST HZ~ I.6 IH6 IOEEP IPYYG IS6 I~P J36 J38 J3A J9A JHPGK JQKCU K6V K7- KCGVB KFECR L98 LW7 M-V M0N NIKVX O9- OK1 OYBOY P2P P62 PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WXY WYP ZYDXJ AAYXX ABGDZ ABVKB ABVZP ABXHF ACAJB ACDLN AFFHD AFZFC AKMAY CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c266t-d7ea53a6dc6f4d50694a10dd0dea65e73bd5aef3a2fe82450d16255473003cb93 |
| IEDL.DBID | P5Z |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000224448000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-0684 |
| IngestDate | Fri Jul 25 03:01:03 EDT 2025 Sat Nov 29 07:49:48 EST 2025 Wed Mar 13 05:56:06 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5-6 |
| Keywords | linear logic fixpoint semantics bottom-up evaluation |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c266t-d7ea53a6dc6f4d50694a10dd0dea65e73bd5aef3a2fe82450d16255473003cb93 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 201697716 |
| PQPubID | 43613 |
| PageCount | 47 |
| ParticipantIDs | proquest_journals_201697716 crossref_primary_10_1017_S1471068404002066 cambridge_journals_10_1017_S1471068404002066 |
| PublicationCentury | 2000 |
| PublicationDate | 20040900 2004-09-00 20040901 |
| PublicationDateYYYYMMDD | 2004-09-01 |
| PublicationDate_xml | – month: 9 year: 2004 text: 20040900 |
| PublicationDecade | 2000 |
| PublicationPlace | Cambridge, UK |
| PublicationPlace_xml | – name: Cambridge, UK – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationTitleAlternate | Theory and Practice of Logic Programming |
| PublicationYear | 2004 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| SSID | ssj0016324 |
| Score | 1.6711327 |
| Snippet | The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 573 |
| SubjectTerms | Regular Papers |
| Title | Model checking linear logic specifications |
| URI | https://www.cambridge.org/core/product/identifier/S1471068404002066/type/journal_article https://www.proquest.com/docview/201697716 |
| Volume | 4 |
| WOSCitedRecordID | wos000224448000003&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: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1475-3081 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: P5Z dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1475-3081 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: K7- dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1475-3081 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0016324 issn: 1471-0684 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB5s68GL9Ym1WnLwVAzsK4-eRKVFEEoRheJlySZZEKSt3ervN7ObrRahF6_JEpbJzOQxX74P4Aqri4EVikYyMzTJM0mljizVAY8GJjDaRKoUmxDjsZxOBxOPzSk8rLLOiWWiNnONd-TukB5yt1cJ-c3ig6JoFBZXvYJGA1pIkoDKDRP2ui4iIBN5-bhIILhHJnVRExmjsRHb0IeR0fw3tcLmErWZoctlZ9T-5w8fwL7fb5LbykEOYcfOjqBdazkQH9rH0EdRtHfiplDj5TnB3adakjIzEnyOiZCi6nbvBF5Gw-f7B-p1FKh2y--KGmEVixU3mueJYfjUVYWBcTNhFWdWxJlhyuaxinIro4QFJnSnIhQldiGvs0F8Cs3ZfGbPgIS5ZjgIVzp2_bHM8jyMeKaVdicjyzpwvTZj6qOhSCskmUj_WL0D_drS6aJi19j2cbc29M_Qayufb-3twl4FuUFw2AU0V8tPewm7-mv1Vix70LobjidPPWg8Ctornegb9-nI4A |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JSwMxFH6UKujFumKtSw56KQZmMjPJ9CAiamlpLR4q9DZmkgwI0ta2Kv4o_6N5s1SL0JsHr8kQwrw9b_kATjG76BghKQtjTf0kDmmomKHK4ayhHa00kynYhOj1wsGgcV-Cz6IXBssqC52YKmo9UvhGboN0l1tfxeWX4xeKoFGYXC0QNDKu6JiPdxuxTS_aN5a8Z4w1b_vXLZqDClBlbdGMamFk4EmuFU98HWDfp3Qdba9lJA-M8GIdSJN4kiUmZH7gaNeGCIjQa_lfxTh7yWr8Fd8LBYpVR9B50gInn6fNTAKLiUK_SKLihGpcxDWUGZyg_nOUw6JJXLQIqZlrVv7ZD9qEjdyfJleZAGxByQy3oVJgVZBcde1AHUHfnollUYXJAYLetZyQVPMTbDfFkqns9XIXHv7kxntQHo6GZh-Im6gAD-FSeXbfC-MkcRmPlVQ28jNBFc7nZItyaZ9GWaWciH5RuQr1grLROJsesuzjWkHY76PnVD1YunsCa63-XTfqtnudGqxn5UVYCHcI5dnk1RzBqnqbPU0nxynLEnj8axb4AkpaI7s |
| 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=Model+checking+linear+logic+specifications&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=BOZZANO%2C+MARCO&rft.au=DELZANNO%2C+GIORGIO&rft.au=MARTELLI%2C+MAURIZIO&rft.date=2004-09-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=4&rft.issue=5-6&rft.spage=573&rft.epage=619&rft_id=info:doi/10.1017%2FS1471068404002066&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068404002066 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon |