Intensional Kleene and Rice theorems for abstract program semantics
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later work investigated intensional generalisations of such results that take into account the way in which function...
Uložené v:
| Vydané v: | Information and computation Ročník 289; s. 104953 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.11.2022
|
| Predmet: | |
| ISSN: | 0890-5401, 1090-2651 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later work investigated intensional generalisations of such results that take into account the way in which functions are computed, thus affected by the specific programs computing them. In this paper, we single out a novel class of program semantics based on abstract domains of program properties that are able to capture nonextensional aspects of program computations, such as their asymptotic complexity or logical invariants, and allow us to generalise some foundational computability results such as Rice's Theorem and Kleene's Second Recursion Theorem to these semantics. In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable over-approximation necessarily includes an infinite set of false positives which covers all the values of the semantic abstract domain. |
|---|---|
| AbstractList | Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later work investigated intensional generalisations of such results that take into account the way in which functions are computed, thus affected by the specific programs computing them. In this paper, we single out a novel class of program semantics based on abstract domains of program properties that are able to capture nonextensional aspects of program computations, such as their asymptotic complexity or logical invariants, and allow us to generalise some foundational computability results such as Rice's Theorem and Kleene's Second Recursion Theorem to these semantics. In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable over-approximation necessarily includes an infinite set of false positives which covers all the values of the semantic abstract domain. |
| ArticleNumber | 104953 |
| Author | Zhang, Linpeng Baldan, Paolo Ranzato, Francesco |
| Author_xml | – sequence: 1 givenname: Paolo surname: Baldan fullname: Baldan, Paolo organization: Dipartimento di Matematica, University of Padova, Italy – sequence: 2 givenname: Francesco orcidid: 0000-0003-0159-0068 surname: Ranzato fullname: Ranzato, Francesco email: ranzato@math.unipd.it organization: Dipartimento di Matematica, University of Padova, Italy – sequence: 3 givenname: Linpeng surname: Zhang fullname: Zhang, Linpeng organization: Department of Computer Science, University College London, UK |
| BookMark | eNp9kE1LAzEQQINUsK3ePeYPbM0km_3wJkVtsSCInkM2mWjKbrYkQfDfu6WeBD3NzOENvLcgszAGJOQa2AoYVDf7lTcrzjifzrKV4ozMgbWs4JWEGZmzZtplyeCCLFLaMwYgy2pO1tuQMSQ_Bt3Tpx4xINXB0hdvkOYPHCMOiboxUt2lHLXJ9BDH96gHmnDQIXuTLsm5033Cq5-5JG8P96_rTbF7ftyu73aFEaLKRSd0XXe66aRFFBJadE3blgiMWc6ddJLbRkqoXdnUAE0p6raSjFsLTmpTiiVhp78mjilFdOoQ_aDjlwKmjhHUXnmjjhHUKcKEVL8Q47POk-7k4vv_wNsTiJPQp8eokvEYDFof0WRlR_83_A3DXXbg |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2025_115452 |
| Cites_doi | 10.1007/BF00268497 10.1007/BF00290339 10.2307/2267778 10.1145/570886.570889 10.1016/0304-3975(80)90017-1 10.1002/malq.19750210121 10.1002/malq.19770231302 10.3233/JCS-2009-0393 10.1002/malq.19580040705 10.1561/2500000034 10.1145/321637.321648 10.1145/161494.161501 10.1090/S0002-9947-1953-0053041-6 10.1145/345099.345137 10.2307/2964292 10.1002/malq.19760220150 10.1145/321386.321395 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier Inc. |
| Copyright_xml | – notice: 2022 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ic.2022.104953 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2651 |
| ExternalDocumentID | 10_1016_j_ic_2022_104953 S0890540122001080 |
| GroupedDBID | --K --M --Z -~X .~1 0R~ 1B1 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 DM4 DU5 E3Z EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ H~9 IHE IXB J1W KOM LG5 LX9 M41 MHUIS MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSW SSZ T5K TN5 WH7 WUQ XJT XPP ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c336t-b3a77ba8b5dee3519ef8994e100d22f5f52d85517f48711843796502dd1f5ac43 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000914897100028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0890-5401 |
| IngestDate | Sat Nov 29 01:56:36 EST 2025 Tue Nov 18 22:32:40 EST 2025 Fri Feb 23 02:38:54 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Kleene's second recursion theorem Recursive function Program analysis Computability theory Affine program invariants Rice's theorem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c336t-b3a77ba8b5dee3519ef8994e100d22f5f52d85517f48711843796502dd1f5ac43 |
| ORCID | 0000-0003-0159-0068 |
| OpenAccessLink | https://hdl.handle.net/11577/3454761 |
| ParticipantIDs | crossref_primary_10_1016_j_ic_2022_104953 crossref_citationtrail_10_1016_j_ic_2022_104953 elsevier_sciencedirect_doi_10_1016_j_ic_2022_104953 |
| PublicationCentury | 2000 |
| PublicationDate | November 2022 2022-11-00 |
| PublicationDateYYYYMMDD | 2022-11-01 |
| PublicationDate_xml | – month: 11 year: 2022 text: November 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Information and computation |
| PublicationYear | 2022 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Cutland (br0120) 1980 Smullyan (br0370) 1958; 4 Karr (br0170) 1976; 6 Kozen (br0190) 1980; 11 Kleene (br0180) 1938; 3 Asperti (br0010) 2008 Cousot, Giacobazzi, Ranzato (br0110) 2018 Clarkson, Schneider (br0080) 2010; 18 Papadimitriou (br0290) 1994 Chakaravarthy (br0060) 2003 Rival, Yi (br0340) 2020 Lischke (br0220) 1976; 22 Reif, Lewis (br0310) 1977 Hecht (br0130) 1977 Charlesworth (br0070) 2002; 24 Moyen, Simonsen (br0250) 2019 Bruni, Giacobazzi, Gori, Garcia-Contreras, Pavlovic (br0050) 2020 Lischke (br0210) 1975; 21 Rogers (br0350) 1958; 23 Odifreddi (br0280) 1989 Blum (br0030) April 1967; 14 Miné (br0240) 2017; 4 Cousot, Cousot (br0100) 1977 Kam, Ullman (br0160) 1977; 7 Blum (br0040) April 1971; 18 Ranzato (br0300) 2020; vol. 171 Rogers (br0360) 1967 Landi (br0200) dec 1992; 1 Müller-Olm, Seidl (br0260) 2004 Cousot (br0090) 2021 Müller-Olm, Seidl (br0270) 2004 Reps (br0320) 2000; 22 Henry (br0330) 1953; 74 Hrushovski, Ouaknine, Pouly, Worrell (br0150) 2018 Lischke (br0230) 1977; 23 Hoyrup (br0140) 2016; vol. 55 Baldan, Ranzato, Zhang (br0020) 2021; vol. 198 Clarkson (10.1016/j.ic.2022.104953_br0080) 2010; 18 Lischke (10.1016/j.ic.2022.104953_br0220) 1976; 22 Ranzato (10.1016/j.ic.2022.104953_br0300) 2020; vol. 171 Rogers (10.1016/j.ic.2022.104953_br0350) 1958; 23 Kleene (10.1016/j.ic.2022.104953_br0180) 1938; 3 Moyen (10.1016/j.ic.2022.104953_br0250) 2019 Hoyrup (10.1016/j.ic.2022.104953_br0140) 2016; vol. 55 Rival (10.1016/j.ic.2022.104953_br0340) 2020 Cousot (10.1016/j.ic.2022.104953_br0110) 2018 Landi (10.1016/j.ic.2022.104953_br0200) 1992; 1 Müller-Olm (10.1016/j.ic.2022.104953_br0270) 2004 Papadimitriou (10.1016/j.ic.2022.104953_br0290) 1994 Hecht (10.1016/j.ic.2022.104953_br0130) 1977 Chakaravarthy (10.1016/j.ic.2022.104953_br0060) 2003 Müller-Olm (10.1016/j.ic.2022.104953_br0260) 2004 Odifreddi (10.1016/j.ic.2022.104953_br0280) 1989 Reps (10.1016/j.ic.2022.104953_br0320) 2000; 22 Kam (10.1016/j.ic.2022.104953_br0160) 1977; 7 Blum (10.1016/j.ic.2022.104953_br0030) 1967; 14 Baldan (10.1016/j.ic.2022.104953_br0020) 2021; vol. 198 Charlesworth (10.1016/j.ic.2022.104953_br0070) 2002; 24 Asperti (10.1016/j.ic.2022.104953_br0010) 2008 Cousot (10.1016/j.ic.2022.104953_br0090) 2021 Smullyan (10.1016/j.ic.2022.104953_br0370) 1958; 4 Hrushovski (10.1016/j.ic.2022.104953_br0150) 2018 Karr (10.1016/j.ic.2022.104953_br0170) 1976; 6 Bruni (10.1016/j.ic.2022.104953_br0050) 2020 Rogers (10.1016/j.ic.2022.104953_br0360) 1967 Blum (10.1016/j.ic.2022.104953_br0040) 1971; 18 Reif (10.1016/j.ic.2022.104953_br0310) 1977 Lischke (10.1016/j.ic.2022.104953_br0210) 1975; 21 Lischke (10.1016/j.ic.2022.104953_br0230) 1977; 23 Henry (10.1016/j.ic.2022.104953_br0330) 1953; 74 Miné (10.1016/j.ic.2022.104953_br0240) 2017; 4 Cutland (10.1016/j.ic.2022.104953_br0120) 1980 Kozen (10.1016/j.ic.2022.104953_br0190) 1980; 11 Cousot (10.1016/j.ic.2022.104953_br0100) 1977 |
| References_xml | – start-page: 530 year: 2018 end-page: 539 ident: br0150 article-title: Polynomial invariants for affine programs publication-title: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018) – volume: 14 start-page: 322 year: April 1967 end-page: 336 ident: br0030 article-title: A machine-independent theory of the complexity of recursive functions publication-title: J. ACM – start-page: 330 year: 2004 end-page: 341 ident: br0270 article-title: Precise interprocedural analysis through linear algebra publication-title: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2004) – volume: 18 start-page: 290 year: April 1971 end-page: 305 ident: br0040 article-title: On effective procedures for speeding up algorithms publication-title: J. ACM – year: 1980 ident: br0120 article-title: Computability: An Introduction to Recursive Function Theory – volume: 6 start-page: 133 year: 1976 end-page: 151 ident: br0170 article-title: Affine relationships among variables of a program publication-title: Acta Inform. – volume: 1 start-page: 323 year: dec 1992 end-page: 337 ident: br0200 article-title: Undecidability of static analysis publication-title: ACM Lett. Program. Lang. Syst. – year: 2020 ident: br0340 article-title: Introduction to Static Analysis – An Abstract Interpretation Perspective – volume: 7 start-page: 305 year: 1977 end-page: 317 ident: br0160 article-title: Monotone data flow analysis frameworks publication-title: Acta Inform. – year: 2021 ident: br0090 article-title: Principles of Abstract Interpretation – volume: 23 start-page: 331 year: 1958 end-page: 341 ident: br0350 article-title: Gödel numberings of partial recursive functions publication-title: J. Symb. Log. – year: 1977 ident: br0130 article-title: Flow Analysis of Computer Programs – year: 1989 ident: br0280 article-title: Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers – year: 1977 ident: br0100 article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints publication-title: Proc. 4th ACM Symp. on Principles of Programming Languages (POPL 1977) – volume: 22 start-page: 162 year: 2000 end-page: 186 ident: br0320 article-title: Undecidability of context-sensitive data-independence analysis publication-title: ACM Trans. Program. Lang. Syst. – start-page: 113 year: 2008 end-page: 119 ident: br0010 article-title: The intensional content of Rice's theorem publication-title: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008 – start-page: 217 year: 2019 end-page: 229 ident: br0250 article-title: More intensional versions of Rice's theorem publication-title: Proc. Computability in Europe (CIE 2019), Computing with Foresight and Industry – volume: vol. 55 year: 2016 ident: br0140 article-title: The decidable properties of subrecursive functions publication-title: Proc. Int. Coll. on Automata, Languages and Programming (ICALP 2016) – volume: 24 start-page: 554 year: 2002 end-page: 565 ident: br0070 article-title: The undecidability of associativity and commutativity analysis publication-title: ACM Trans. Program. Lang. Syst. – volume: 18 start-page: 1157 year: 2010 end-page: 1210 ident: br0080 article-title: Hyperproperties publication-title: J. Comput. Secur. – volume: 4 start-page: 143 year: 1958 end-page: 147 ident: br0370 article-title: Undecidability and recursive inseparability publication-title: Math. Log. Q. – year: 1994 ident: br0290 article-title: Computational Complexity – start-page: 1016 year: 2004 end-page: 1028 ident: br0260 article-title: A note on Karr's algorithm publication-title: Proc. Int. Coll. on Automata, Languages and Programming (ICALP 2004) – volume: 11 start-page: 277 year: 1980 end-page: 301 ident: br0190 article-title: Indexings of subrecursive classes publication-title: Theor. Comput. Sci. – start-page: 104 year: 1977 end-page: 118 ident: br0310 article-title: Symbolic evaluation and the global value graph publication-title: Proc. 4th ACM Symp. on Principles of Programming Languages (POPL 1977) – volume: 22 start-page: 413 year: 1976 end-page: 418 ident: br0220 article-title: Natürliche Kompliziertheitsmasse und Erhaltungssätze I publication-title: Math. Log. Q. – year: 1967 ident: br0360 article-title: Theory of Recursive Functions and Effective Computability publication-title: Higher Mathematics Series – volume: 23 start-page: 193 year: 1977 end-page: 200 ident: br0230 article-title: Natürliche Kompliziertheitsmasse und Erhaltungssätze II publication-title: Math. Log. Q. – volume: vol. 198 year: 2021 ident: br0020 article-title: A Rice's theorem for abstract semantics publication-title: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 – start-page: 115 year: 2003 end-page: 125 ident: br0060 article-title: New results on the computability and complexity of points-to analysis publication-title: Proceedings of the ACM on Programming Languages (POPL 2003) – volume: 4 start-page: 120 year: 2017 end-page: 372 ident: br0240 article-title: Tutorial on static inference of numeric invariants by abstract interpretation publication-title: Found. Trends Program. Lang. – volume: 74 start-page: 358 year: 1953 end-page: 366 ident: br0330 article-title: Classes of recursively enumerable sets and their decision problems publication-title: Trans. Am. Math. Soc. – year: 2020 ident: br0050 article-title: Abstract extensionality: on the properties of incomplete abstract interpretations publication-title: Proceedings of the ACM on Programming Languages (POPL 2020) – volume: 3 start-page: 150 year: 1938 end-page: 155 ident: br0180 article-title: On notation for ordinal numbers publication-title: J. Symb. Log. – start-page: 75 year: 2018 end-page: 95 ident: br0110 article-title: Program analysis is harder than verification: a computability perspective publication-title: Proc. Int. Conf. on Computer Aided Verification (CAV 2018) – volume: vol. 171 year: 2020 ident: br0300 article-title: Decidability and synthesis of abstract inductive invariants publication-title: Proc. 31st International Conference on Concurrency Theory (CONCUR 2020) – volume: 21 start-page: 159 year: 1975 end-page: 166 ident: br0210 article-title: Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse publication-title: Math. Log. Q. – year: 2020 ident: 10.1016/j.ic.2022.104953_br0340 – volume: 6 start-page: 133 year: 1976 ident: 10.1016/j.ic.2022.104953_br0170 article-title: Affine relationships among variables of a program publication-title: Acta Inform. doi: 10.1007/BF00268497 – start-page: 1016 year: 2004 ident: 10.1016/j.ic.2022.104953_br0260 article-title: A note on Karr's algorithm – year: 1980 ident: 10.1016/j.ic.2022.104953_br0120 – volume: 7 start-page: 305 year: 1977 ident: 10.1016/j.ic.2022.104953_br0160 article-title: Monotone data flow analysis frameworks publication-title: Acta Inform. doi: 10.1007/BF00290339 – volume: 3 start-page: 150 issue: 4 year: 1938 ident: 10.1016/j.ic.2022.104953_br0180 article-title: On notation for ordinal numbers publication-title: J. Symb. Log. doi: 10.2307/2267778 – volume: 24 start-page: 554 issue: 5 year: 2002 ident: 10.1016/j.ic.2022.104953_br0070 article-title: The undecidability of associativity and commutativity analysis publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/570886.570889 – volume: 11 start-page: 277 year: 1980 ident: 10.1016/j.ic.2022.104953_br0190 article-title: Indexings of subrecursive classes publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(80)90017-1 – year: 2021 ident: 10.1016/j.ic.2022.104953_br0090 – year: 1994 ident: 10.1016/j.ic.2022.104953_br0290 – start-page: 530 year: 2018 ident: 10.1016/j.ic.2022.104953_br0150 article-title: Polynomial invariants for affine programs – volume: 21 start-page: 159 issue: 1 year: 1975 ident: 10.1016/j.ic.2022.104953_br0210 article-title: Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse publication-title: Math. Log. Q. doi: 10.1002/malq.19750210121 – volume: vol. 198 year: 2021 ident: 10.1016/j.ic.2022.104953_br0020 article-title: A Rice's theorem for abstract semantics – volume: 23 start-page: 193 issue: 13–15 year: 1977 ident: 10.1016/j.ic.2022.104953_br0230 article-title: Natürliche Kompliziertheitsmasse und Erhaltungssätze II publication-title: Math. Log. Q. doi: 10.1002/malq.19770231302 – volume: 18 start-page: 1157 issue: 6 year: 2010 ident: 10.1016/j.ic.2022.104953_br0080 article-title: Hyperproperties publication-title: J. Comput. Secur. doi: 10.3233/JCS-2009-0393 – start-page: 104 year: 1977 ident: 10.1016/j.ic.2022.104953_br0310 article-title: Symbolic evaluation and the global value graph – year: 1989 ident: 10.1016/j.ic.2022.104953_br0280 – volume: vol. 55 year: 2016 ident: 10.1016/j.ic.2022.104953_br0140 article-title: The decidable properties of subrecursive functions – start-page: 115 year: 2003 ident: 10.1016/j.ic.2022.104953_br0060 article-title: New results on the computability and complexity of points-to analysis – year: 1967 ident: 10.1016/j.ic.2022.104953_br0360 article-title: Theory of Recursive Functions and Effective Computability – start-page: 113 year: 2008 ident: 10.1016/j.ic.2022.104953_br0010 article-title: The intensional content of Rice's theorem – volume: 4 start-page: 143 issue: 7–11 year: 1958 ident: 10.1016/j.ic.2022.104953_br0370 article-title: Undecidability and recursive inseparability publication-title: Math. Log. Q. doi: 10.1002/malq.19580040705 – start-page: 75 year: 2018 ident: 10.1016/j.ic.2022.104953_br0110 article-title: Program analysis is harder than verification: a computability perspective – volume: 4 start-page: 120 issue: 3–4 year: 2017 ident: 10.1016/j.ic.2022.104953_br0240 article-title: Tutorial on static inference of numeric invariants by abstract interpretation publication-title: Found. Trends Program. Lang. doi: 10.1561/2500000034 – volume: vol. 171 year: 2020 ident: 10.1016/j.ic.2022.104953_br0300 article-title: Decidability and synthesis of abstract inductive invariants – volume: 18 start-page: 290 issue: 2 year: 1971 ident: 10.1016/j.ic.2022.104953_br0040 article-title: On effective procedures for speeding up algorithms publication-title: J. ACM doi: 10.1145/321637.321648 – volume: 1 start-page: 323 issue: 4 year: 1992 ident: 10.1016/j.ic.2022.104953_br0200 article-title: Undecidability of static analysis publication-title: ACM Lett. Program. Lang. Syst. doi: 10.1145/161494.161501 – volume: 74 start-page: 358 year: 1953 ident: 10.1016/j.ic.2022.104953_br0330 article-title: Classes of recursively enumerable sets and their decision problems publication-title: Trans. Am. Math. Soc. doi: 10.1090/S0002-9947-1953-0053041-6 – year: 1977 ident: 10.1016/j.ic.2022.104953_br0100 article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints – volume: 22 start-page: 162 issue: 1 year: 2000 ident: 10.1016/j.ic.2022.104953_br0320 article-title: Undecidability of context-sensitive data-independence analysis publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/345099.345137 – volume: 23 start-page: 331 issue: 3 year: 1958 ident: 10.1016/j.ic.2022.104953_br0350 article-title: Gödel numberings of partial recursive functions publication-title: J. Symb. Log. doi: 10.2307/2964292 – year: 1977 ident: 10.1016/j.ic.2022.104953_br0130 – volume: 22 start-page: 413 issue: 1 year: 1976 ident: 10.1016/j.ic.2022.104953_br0220 article-title: Natürliche Kompliziertheitsmasse und Erhaltungssätze I publication-title: Math. Log. Q. doi: 10.1002/malq.19760220150 – start-page: 330 year: 2004 ident: 10.1016/j.ic.2022.104953_br0270 article-title: Precise interprocedural analysis through linear algebra – volume: 14 start-page: 322 issue: 2 year: 1967 ident: 10.1016/j.ic.2022.104953_br0030 article-title: A machine-independent theory of the complexity of recursive functions publication-title: J. ACM doi: 10.1145/321386.321395 – year: 2020 ident: 10.1016/j.ic.2022.104953_br0050 article-title: Abstract extensionality: on the properties of incomplete abstract interpretations – start-page: 217 year: 2019 ident: 10.1016/j.ic.2022.104953_br0250 article-title: More intensional versions of Rice's theorem |
| SSID | ssj0011546 |
| Score | 2.3323529 |
| Snippet | Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 104953 |
| SubjectTerms | Affine program invariants Computability theory Kleene's second recursion theorem Program analysis Recursive function Rice's theorem |
| Title | Intensional Kleene and Rice theorems for abstract program semantics |
| URI | https://dx.doi.org/10.1016/j.ic.2022.104953 |
| Volume | 289 |
| WOSCitedRecordID | wos000914897100028&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 customDbUrl: eissn: 1090-2651 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011546 issn: 0890-5401 databaseCode: AIEXJ dateStart: 20211207 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JS8NAFB7cDnpwF3fm4EUkmkySTuZYi-KGiAv0FiazQIvGYquIv943nZnYuqGCl1CmmUx47_X17R9CW1QKEnGuAyYSHSQ6JgFjVANDVBzpmpZK9-fMntHz86zZZBcOjLPbhxOgZZk9P7POv7Ia1oDZpnX2F-yuHgoL8BmYDldgO1x_xHhXlN6P8J2aQgmbILgEjeDaFu0Mhh1emDCHGV1sa7R2uuoO6OzL39v-cVV_o--B6zwO5-_3-a20cdQLDrr0LXVUvvA-SpOF71BdUX1XxanBF-4o9-_pgg_gt0ZDwYeqK2aoaDPMWGgKLux9yirWENZIzQ2XdZqXWPSgD1rcBhTauy0zY5IQk4dmdqTwu9nYV-YocxIxpWFg_I6icUJTBuptvH580DypEkqR69nyr-Yy1rbUb_iczy2UAavjehZNO3cB1y2b59CIKufRjIfiwE4zz6OpgbmSC6gxIAPYygAG3mEjA9jLAAa-Yi8D2MkArmRgEd0cHlw3jgKHlhGIOK71giLmlBY8K1KplIFdVBp86URFYSgJ0alOiczAPqYafNTIwPxQBuY5kTLSKRdJvITGyvtSLSMsokwSpiiQliXwc-WkAMIRsF01JYrHK2jPUygXbpS8QTS5zX3NYDtvidzQNLc0XUHb1Y6OHaPyzb2xJ3ruzEBr3uUgH1_uWv3TrjU0-SbW62is9_CoNtCEeOq1ug-bToheAVcWfxY |
| 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=Intensional+Kleene+and+Rice+theorems+for+abstract+program+semantics&rft.jtitle=Information+and+computation&rft.au=Baldan%2C+Paolo&rft.au=Ranzato%2C+Francesco&rft.au=Zhang%2C+Linpeng&rft.date=2022-11-01&rft.pub=Elsevier+Inc&rft.issn=0890-5401&rft.eissn=1090-2651&rft.volume=289&rft_id=info:doi/10.1016%2Fj.ic.2022.104953&rft.externalDocID=S0890540122001080 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon |