Integrating Cardinality Constraints into Constraint Logic Programming with Sets
Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Logic Programming tool $$\{ log\} $$ provides a decision procedure for deciding the sa...
Uložené v:
| Vydané v: | Theory and practice of logic programming Ročník 23; číslo 2; s. 468 - 502 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Cambridge
Cambridge University Press
01.03.2023
|
| Predmet: | |
| ISSN: | 1471-0684, 1475-3081 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Logic Programming tool
$$\{ log\} $$
provides a decision procedure for deciding the satisfiability of formulas involving very general forms of finite sets, although it does not provide cardinality constraints. In this paper we adapt and integrate a decision procedure for a theory of finite sets with cardinality into
$$\{ log\} $$
. The proposed solver is proved to be a decision procedure for its formulas. Besides, the new CLP instance is implemented as part of the
$$\{ log\} $$
tool. In turn, the implementation uses Howe and King’s Prolog SAT solver and Prolog’s CLP(Q) library, as an integer linear programming solver. The empirical evaluation of this implementation based on +250 real verification conditions shows that it can be useful in practice.
Under consideration in Theory and Practice of Logic Programming (TPLP) |
|---|---|
| AbstractList | Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Logic Programming tool \[\{ log\} \] provides a decision procedure for deciding the satisfiability of formulas involving very general forms of finite sets, although it does not provide cardinality constraints. In this paper we adapt and integrate a decision procedure for a theory of finite sets with cardinality into \[\{ log\} \]. The proposed solver is proved to be a decision procedure for its formulas. Besides, the new CLP instance is implemented as part of the \[\{ log\} \] tool. In turn, the implementation uses Howe and King’s Prolog SAT solver and Prolog’s CLP(Q) library, as an integer linear programming solver. The empirical evaluation of this implementation based on +250 real verification conditions shows that it can be useful in practice.Under consideration in Theory and Practice of Logic Programming (TPLP) Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Logic Programming tool $$\{ log\} $$ provides a decision procedure for deciding the satisfiability of formulas involving very general forms of finite sets, although it does not provide cardinality constraints. In this paper we adapt and integrate a decision procedure for a theory of finite sets with cardinality into $$\{ log\} $$ . The proposed solver is proved to be a decision procedure for its formulas. Besides, the new CLP instance is implemented as part of the $$\{ log\} $$ tool. In turn, the implementation uses Howe and King’s Prolog SAT solver and Prolog’s CLP(Q) library, as an integer linear programming solver. The empirical evaluation of this implementation based on +250 real verification conditions shows that it can be useful in practice. Under consideration in Theory and Practice of Logic Programming (TPLP) |
| Author | CRISTIÁ, MAXIMILIANO ROSSI, GIANFRANCO |
| Author_xml | – sequence: 1 givenname: MAXIMILIANO orcidid: 0000-0001-9163-2609 surname: CRISTIÁ fullname: CRISTIÁ, MAXIMILIANO – sequence: 2 givenname: GIANFRANCO surname: ROSSI fullname: ROSSI, GIANFRANCO |
| BookMark | eNp9kE1LAzEQhoMo2FZ_gLcFz6szSTabPcriR6FQoXpesrtpTWmTmqRI_71Z60EUvMz3M8y8Y3JqndWEXCHcIGB5u0BeIgjJKQJAQfGEjFKpyBlIPP2KMR_652QcwhoABaN8ROZTG_XKq2jsKquV741VGxMPWe1siF4ZG0OWjPtRyGZuZbrs2bsEbrcD-WHiW7bQMVyQs6XaBH357Sfk9eH-pX7KZ_PHaX03yzuGIuYalpVudd9Wbc9YL0VZaCV4W2gBjEvRpoyVTAFrkSmlUkylpIWguuO9KNiEXB_37rx73-sQm7Xb-3R7aKisKBO8qkSawuNU510IXi-bnTdb5Q8NQjPo1vzRLTHlL6YzMenj7PD95h_yE_k9cxM |
| CitedBy_id | crossref_primary_10_1007_s10817_024_09713_6 crossref_primary_10_1017_S1471068424000206 crossref_primary_10_1007_s10817_023_09666_2 crossref_primary_10_1145_3625230 |
| Cites_doi | 10.1007/978-3-642-14203-1_13 10.1017/S1471068406002730 10.1007/3-540-45620-1_30 10.1007/978-3-319-63046-5_12 10.1007/s10817-021-09602-2 10.1007/3-540-10009-1_8 10.1016/0743-1066(95)00147-6 10.1007/11609773_28 10.1007/978-3-319-63046-5_11 10.1007/978-3-030-39322-9_17 10.1007/s10817-020-09577-6 10.1145/888251.888272 10.1016/j.tcs.2012.02.024 10.1007/978-3-030-02149-8_20 10.1007/978-3-642-11319-2_27 10.1007/978-3-642-40561-7_16 10.1007/s10817-006-9042-1 10.1007/978-3-030-25543-5_15 10.1007/s10817-021-09589-w 10.1007/3-540-45988-X_9 10.1145/365151.365169 10.1007/BF00137870 10.1007/978-3-642-18275-4_28 10.1609/aaai.v34i03.5677 10.1007/s10601-006-9012-6 10.1007/978-3-030-51074-9_1 10.1007/978-0-387-92280-5_3 10.1007/s10817-005-3075-8 10.1613/jair.1638 10.1007/s10703-017-0279-6 10.1007/BFb0027284 10.1017/CBO9780511624162 10.1007/978-3-540-78163-9_20 10.1007/s10817-019-09520-4 10.1007/978-3-540-45236-2_46 |
| ContentType | Journal Article |
| Copyright | The Author(s), 2021. Published by Cambridge University Press |
| Copyright_xml | – notice: The Author(s), 2021. Published by 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/S1471068421000521 |
| 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 Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Collection (ProQuest) 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 | Computer Science Database CrossRef |
| 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 | 502 |
| ExternalDocumentID | 10_1017_S1471068421000521 |
| GroupedDBID | -E. .FH 09C 09E 0E1 0R~ 123 29Q 4.4 5VS 74X 74Y 7~V 8FE 8FG 8R4 8R5 AAAZR AABES AABWE AACJH AAFUK AAGFV AAKTX AANRG AARAB AASVR AAUKB AAYXX ABBXD ABGDZ ABITZ ABJNI ABKKG ABMWE ABQTM ABQWD ABROB ABTCQ ABUWG ABVKB ABVZP ABXHF ABZCX ACAJB ACBMC ACDLN ACGFS ACIMK ACNCT ACUIJ ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADKIL ADOVH ADVJH AEBAK AEHGV AEMTW AENEX AENGE AFFHD AFFUJ AFKQG AFKRA AFLOS AFLVW AFUTZ AFZFC AGABE AGBYD AGJUD AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKMAY 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 CITATION 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 NIKVX O9- OYBOY P2P P62 PHGZM PHGZT PQGLB PQQKQ PROAC PYCCK Q2X RAMDC RCA ROL RR0 S6- S6U SAAAG T9M UT1 WFFJZ WQ3 WXU WYP ZYDXJ 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c316t-e0f9ebedb9bd33d8675ea64b5e603486bea6373a03b13aaa3732882562ec4d653 |
| IEDL.DBID | K7- |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000792182300001&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 | Mon Jul 14 10:42:30 EDT 2025 Tue Nov 18 19:37:50 EST 2025 Sat Nov 29 04:58:37 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c316t-e0f9ebedb9bd33d8675ea64b5e603486bea6373a03b13aaa3732882562ec4d653 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9163-2609 |
| OpenAccessLink | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/242E672E63FC5956829A0C5943F45030/S1471068421000521a.pdf/div-class-title-integrating-cardinality-constraints-into-constraint-logic-programming-with-sets-div.pdf |
| PQID | 2892364996 |
| PQPubID | 43613 |
| PageCount | 35 |
| ParticipantIDs | proquest_journals_2892364996 crossref_primary_10_1017_S1471068421000521 crossref_citationtrail_10_1017_S1471068421000521 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-03-00 20230301 |
| PublicationDateYYYYMMDD | 2023-03-01 |
| PublicationDate_xml | – month: 03 year: 2023 text: 2023-03-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Cambridge |
| PublicationPlace_xml | – name: Cambridge |
| PublicationTitle | Theory and practice of logic programming |
| PublicationYear | 2023 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S1471068421000521_ref3 S1471068421000521_ref28 S1471068421000521_ref27 S1471068421000521_ref1 S1471068421000521_ref26 S1471068421000521_ref25 S1471068421000521_ref47 S1471068421000521_ref2 S1471068421000521_ref46 S1471068421000521_ref24 S1471068421000521_ref7 S1471068421000521_ref23 S1471068421000521_ref45 S1471068421000521_ref22 S1471068421000521_ref44 S1471068421000521_ref5 S1471068421000521_ref43 S1471068421000521_ref6 S1471068421000521_ref21 S1471068421000521_ref20 S1471068421000521_ref42 Ding (S1471068421000521_ref19) 2020 S1471068421000521_ref41 S1471068421000521_ref40 Bansal (S1471068421000521_ref4) 2018 S1471068421000521_ref9 S1471068421000521_ref29 S1471068421000521_ref17 S1471068421000521_ref39 S1471068421000521_ref38 S1471068421000521_ref16 Cantone (S1471068421000521_ref8) 2001 S1471068421000521_ref15 S1471068421000521_ref37 S1471068421000521_ref36 S1471068421000521_ref14 S1471068421000521_ref13 S1471068421000521_ref35 S1471068421000521_ref34 S1471068421000521_ref12 S1471068421000521_ref33 S1471068421000521_ref11 S1471068421000521_ref10 S1471068421000521_ref32 S1471068421000521_ref31 S1471068421000521_ref30 S1471068421000521_ref18 |
| References_xml | – ident: S1471068421000521_ref36 doi: 10.1007/978-3-642-14203-1_13 – ident: S1471068421000521_ref22 doi: 10.1017/S1471068406002730 – ident: S1471068421000521_ref45 doi: 10.1007/3-540-45620-1_30 – ident: S1471068421000521_ref40 – ident: S1471068421000521_ref10 doi: 10.1007/978-3-319-63046-5_12 – start-page: 4 year: 2018 ident: S1471068421000521_ref4 article-title: Reasoning with finite sets and cardinality constraints in SMT publication-title: Log. Methods Comput. Sci. 14, – ident: S1471068421000521_ref16 doi: 10.1007/s10817-021-09602-2 – ident: S1471068421000521_ref23 doi: 10.1007/3-540-10009-1_8 – ident: S1471068421000521_ref20 doi: 10.1016/0743-1066(95)00147-6 – ident: S1471068421000521_ref7 doi: 10.1007/11609773_28 – ident: S1471068421000521_ref5 doi: 10.1007/978-3-319-63046-5_11 – ident: S1471068421000521_ref33 doi: 10.1007/978-3-030-39322-9_17 – start-page: 1 year: 2020 ident: S1471068421000521_ref19 article-title: The logic of comparative cardinality publication-title: J. Symb. Log. – ident: S1471068421000521_ref27 – ident: S1471068421000521_ref14 doi: 10.1007/s10817-020-09577-6 – ident: S1471068421000521_ref18 doi: 10.1145/888251.888272 – ident: S1471068421000521_ref29 doi: 10.1016/j.tcs.2012.02.024 – ident: S1471068421000521_ref11 doi: 10.1007/978-3-030-02149-8_20 – ident: S1471068421000521_ref44 doi: 10.1007/978-3-642-11319-2_27 – ident: S1471068421000521_ref37 – ident: S1471068421000521_ref17 doi: 10.1007/978-3-642-40561-7_16 – ident: S1471068421000521_ref31 doi: 10.1007/s10817-006-9042-1 – ident: S1471068421000521_ref6 doi: 10.1007/978-3-030-25543-5_15 – ident: S1471068421000521_ref15 doi: 10.1007/s10817-021-09589-w – ident: S1471068421000521_ref9 – ident: S1471068421000521_ref46 doi: 10.1007/3-540-45988-X_9 – ident: S1471068421000521_ref12 – ident: S1471068421000521_ref21 doi: 10.1145/365151.365169 – ident: S1471068421000521_ref39 – volume-title: Monographs in Computer Science year: 2001 ident: S1471068421000521_ref8 – ident: S1471068421000521_ref25 doi: 10.1007/BF00137870 – ident: S1471068421000521_ref42 doi: 10.1007/978-3-642-18275-4_28 – ident: S1471068421000521_ref30 doi: 10.1609/aaai.v34i03.5677 – ident: S1471068421000521_ref3 doi: 10.1007/s10601-006-9012-6 – ident: S1471068421000521_ref24 – ident: S1471068421000521_ref34 doi: 10.1007/978-3-030-51074-9_1 – ident: S1471068421000521_ref43 doi: 10.1007/978-0-387-92280-5_3 – ident: S1471068421000521_ref28 – ident: S1471068421000521_ref41 – ident: S1471068421000521_ref47 doi: 10.1007/s10817-005-3075-8 – ident: S1471068421000521_ref26 doi: 10.1613/jair.1638 – ident: S1471068421000521_ref2 doi: 10.1007/s10703-017-0279-6 – ident: S1471068421000521_ref38 doi: 10.1007/BFb0027284 – ident: S1471068421000521_ref1 doi: 10.1017/CBO9780511624162 – ident: S1471068421000521_ref35 doi: 10.1007/978-3-540-78163-9_20 – ident: S1471068421000521_ref13 doi: 10.1007/s10817-019-09520-4 – ident: S1471068421000521_ref32 doi: 10.1007/978-3-540-45236-2_46 |
| SSID | ssj0016324 |
| Score | 2.3605547 |
| Snippet | Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 468 |
| SubjectTerms | Applications programs Data structures Decision theory Integer programming Linear programming Logic programming Program verification (computers) Prolog Solvers |
| Title | Integrating Cardinality Constraints into Constraint Logic Programming with Sets |
| URI | https://www.proquest.com/docview/2892364996 |
| Volume | 23 |
| WOSCitedRecordID | wos000792182300001&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: 20241207 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: 20241207 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: 20241207 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/eLvHCXMwpV3NS8MwFA-6efDi_MTpHDl4EoJN0qbtSXRsKMIsfsDwUpqPgqDbXKt_v3ltOh2CFy-BpkkJeS95eXmvvx9Cp1L6gnlBTiDIR3ymGJE0pMTQ2MQqjvKcyYpsIhyPo8kkTtyFW-HSKps9sdqo9UzBHfm5dQwA69wezy_m7wRYoyC66ig01lGbMkZBz29DsowiABR59XdRCNk9kd9ENQEyGiqhjtEq2kVX7dLqtlzZmlHnv6PcRlvulIkva7XYQWtmuos6DYMDdgt6D93dOLQIa8DwAJSlPpdj4PGs2CPKAtti9qMCAz2zwkmd2PUGPeEyFz-YsthHT6Ph4-CaOIoFojgVJTFeHlsxahlLzbmOrPtgMuHLwAiP-5GQ9omHPPO4pDzLMg7YPtapFMwoX4uAH6DWdDY1hwhnQmsvtl-VoTX7ysu0ymxbX4WxZkr5XeQ1E5wqhz8O435N60SzMP0lky46W3aZ1-AbfzXuNSJJ3Tos0m95HP39-hhtApF8nV3WQ61y8WFO0Ib6LF-KRR-1r4bj5L5fqZctk-D5CxWh1Tg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB6KCnqxPvFRdQ96EYLJ7jaPg4hUxaLWggriJWYfBUFbbaLin_I3OpOHDwRvPXgJZLMbNpnZeezMzgewqZT0udvsORTkcyTX3FFe4DnWi2yko7DX4yoHmwg6nfD6OurW4L06C0NplZVMzAW1GWjaI99Bx4BqnaN5vvf45BBqFEVXKwiNgi1O7NsrumzpbvsA6bvF-dHhZevYKVEFHC08P3Os24tw5kZFyghhQrSYbeJL1bS-K2ToK7wTgUhcoTyRJImgcjboR_ncaml8QolAkT8uJTpLuH66zZvPqAWVPs9PMwWUTRTKKopKJaqpkdq4l0fXvJ968KcayHXbUf2__ZUZmC6taLZfsP0s1Gx_DuoVQgUrBdY8nLfLahiooFmLFkPhdzDCKc3RMbKU4WXwrYER_LRm3SJx7YFG0mY1u7BZugBXI_msRRjrD_p2CVjiG-NG-FYVoFmj3cToBPtKHUSGay2Xwa0IGuuyvjrN-z4uEumC-BcPLMP255DHorjIX50bFQvEpZxJ4y_6r_z9eAMmjy_PTuPTdudkFaY4mmpFJl0DxrLhs12DCf2S3aXD9ZylGdyOmls-AAGSMCY |
| 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=Integrating+Cardinality+Constraints+into+Constraint+Logic+Programming+with+Sets&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=CRISTI%C3%81%2C+MAXIMILIANO&rft.au=Rossi%2C+Gianfranco&rft.date=2023-03-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=23&rft.issue=2&rft.spage=468&rft.epage=502&rft_id=info:doi/10.1017%2FS1471068421000521 |
| 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 |