Security types preserving compilation
Starting from the seminal work of Volpano and Smith, there has been growing evidence that type systems may be used to enforce confidentiality of programs through non-interference. However, most type systems operate on high-level languages and calculi, and “low-level languages have not received much...
Uložené v:
| Vydané v: | Computer languages, systems & structures Ročník 33; číslo 2; s. 35 - 59 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.07.2007
|
| Predmet: | |
| ISSN: | 1477-8424, 1873-6866 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Starting from the seminal work of Volpano and Smith, there has been growing evidence that type systems may be used to enforce confidentiality of programs through non-interference. However, most type systems operate on high-level languages and calculi, and “low-level languages have not received much attention in studies of secure information flow” (Sabelfeld and Myers, [Language-based information-flow security. IEEE Journal on Selected Areas in Communications 2003; 21:5–19]). Therefore, we introduce an information flow type system for a low-level language featuring jumps and calls, and show that the type system enforces termination-insensitive non-interference.
Furthermore, information flow type systems for low-level languages should appropriately relate to their counterparts for high-level languages. Therefore, we introduce a compiler from a high-level imperative programming language to our low-level language, and show that the compiler preserves information flow types. |
|---|---|
| AbstractList | Starting from the seminal work of Volpano and Smith, there has been growing evidence that type systems may be used to enforce confidentiality of programs through non-interference. However, most type systems operate on high-level languages and calculi, and “low-level languages have not received much attention in studies of secure information flow” (Sabelfeld and Myers, [Language-based information-flow security. IEEE Journal on Selected Areas in Communications 2003; 21:5–19]). Therefore, we introduce an information flow type system for a low-level language featuring jumps and calls, and show that the type system enforces termination-insensitive non-interference.
Furthermore, information flow type systems for low-level languages should appropriately relate to their counterparts for high-level languages. Therefore, we introduce a compiler from a high-level imperative programming language to our low-level language, and show that the compiler preserves information flow types. |
| Author | Barthe, Gilles Basu, Amitabh Rezk, Tamara |
| Author_xml | – sequence: 1 givenname: Gilles surname: Barthe fullname: Barthe, Gilles email: gilles.barthe@sophia.inria.fr organization: INRIA Sophia-Antipolis, France – sequence: 2 givenname: Tamara surname: Rezk fullname: Rezk, Tamara email: tamara.rezk@sophia.inria.fr organization: INRIA Sophia-Antipolis, France – sequence: 3 givenname: Amitabh surname: Basu fullname: Basu, Amitabh email: abasu@cs.sunysb.edu organization: Stony Brook University, USA |
| BookMark | eNp9j8FLwzAUh4NMcJvePe7isTVJ0zTxJkOnMPCgnkP38iIZXVuSOOh_b-s8CQo_eO_w-x7vW5BZ27VIyDWjOaNM3u5zaHJOaZlPofyMzJmqikwqKWfjLqoqU4KLC7KIcT8WqBLlnNy8InwGn4ZVGnqMqz5gxHD07ccKukPvmzr5rr0k565uIl79zCV5f3x4Wz9l25fN8_p-mwHXImWa1mDRKs0kL5h2HDUHAGq11UoUEqtdUSprNSi5q8qdA1oIjg5dVTpmabEk9HQXQhdjQGf64A91GAyjZtI0ewONmTTNFMpHRP5CwKfvp1OoffMfeHcCcRQ6egwmgscW0PqAkIzt_N_wF6LmbfE |
| CitedBy_id | crossref_primary_10_1145_3280984 crossref_primary_10_1145_3332371 crossref_primary_10_1145_3290389 crossref_primary_10_1145_2240276_2240279 crossref_primary_10_3233_JCS_191382 crossref_primary_10_1145_3436809 crossref_primary_10_1145_1805974_1805977 |
| Cites_doi | 10.21236/ADA486429 10.1007/3-540-36579-6_8 10.1007/3-540-47813-2_1 10.1109/JSAC.2002.806121 10.1007/3-540-45309-1_4 10.1145/596980.596983 10.3233/JCS-2002-10404 10.1145/277650.277752 10.1023/A:1025055424017 10.1145/324133.324266 10.1145/1045405.1045411 10.1007/10705424_4 10.1145/1040294.1040304 10.3233/JCS-1996-42-304 10.1002/cpe.798 10.1016/S0304-3975(02)00869-1 10.1007/978-3-540-24721-0_7 10.1145/176454.176456 10.1007/978-3-540-30579-8_23 10.1007/3-540-45949-9 |
| ContentType | Journal Article |
| Copyright | 2005 Elsevier Ltd |
| Copyright_xml | – notice: 2005 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cl.2005.05.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6866 |
| EndPage | 59 |
| ExternalDocumentID | 10_1016_j_cl_2005_05_002 S1477842405000230 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 RIG ROL RPZ SDF SDG SDP SES SEW SPC SSV SSZ T5K TN5 XFK YYM ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c294t-90acded89162319f2e92ccc0d9d98436e7b358dd9c86b75bfc0342efef75f1d03 |
| ISICitedReferencesCount | 14 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000243811700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1477-8424 |
| IngestDate | Tue Nov 18 21:46:44 EST 2025 Sat Nov 29 01:36:50 EST 2025 Fri Feb 23 02:17:32 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Low-level languages Non-interference Program analysis Security |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c294t-90acded89162319f2e92ccc0d9d98436e7b358dd9c86b75bfc0342efef75f1d03 |
| PageCount | 25 |
| ParticipantIDs | crossref_primary_10_1016_j_cl_2005_05_002 crossref_citationtrail_10_1016_j_cl_2005_05_002 elsevier_sciencedirect_doi_10_1016_j_cl_2005_05_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-07-01 |
| PublicationDateYYYYMMDD | 2007-07-01 |
| PublicationDate_xml | – month: 07 year: 2007 text: 2007-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Computer languages, systems & structures |
| PublicationYear | 2007 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Bernardeschi C, De Francesco N. Combining abstract interpretation and model checking for analysing security properties of Java Bytecode. In: Cortesi A, editor. Proceedings of VMCAI’02, Lecture notes in computer science, vol. 2294. Berlin: Springer; 2002. p. 1–15. Volpano D, Smith G, Irvine C. A sound type system for secure flow analysis. Journal of Computer Security 1996;167–87. Klein, Nipkow (bib30) 2002; 298 Leroy (bib12) 2003; 30 Abadi (bib13) 1999; 46 Jacobs B, Pieters W, Warnier M. Statically checking confidentiality via dynamic labels, to appear, 2005. Banerjee, Naumann (bib7) 2002 Coq Development Team. The coq proof assistant user's guide. Version 8.0, January 2004. Morrisett, Walker, Crary, Glew (bib27) 1998 with, Palsberg, Appel (bib17) 2002 Necula GC, Lee P. The design and implementation of a certifying compiler. In: Proceedings of PLDI’98, 1998. p. 333–44. Heintze, Riecke (bib4) 1998 Barthe G, Dufay G. A tool-assisted framework for certified bytecode verification. In: Proceedings of FASE’04, Lecture notes in computer science, vol. 2984. Berlin: Springer; 2004. p. 99–113. Goguen, Meseguer (bib2) 1982 Volpano D, Smith G. A type-based approach to program security. In: Bidoit M, Dauchet M, editors. Proceedings of TAPSOFT’97, Lecture notes in computer science, vol. 1214. Berlin: Springer; 1997. p. 607–21. Zdancewic S, Myers A. Secure information flow and CPS. In: Sands D, editor. Proceedings of ESOP’01, Lecture notes in computer science, vol. 2028. Berlin: Springer; 2001. p. 46–61. Myers (bib8) 1999 Pottier, Simonet (bib9) 2003; 25 Necula (bib14) 1997 Bonelli E, Compagnoni A, Medel R. SIFTAL: A typed assembly language for secure information flow analysis. In: Sabelfeld A, editor. Informal Proceedings of FCS’05; 2004. Bieber, Cazin, Wiels, Zanon, Girard, Lanet (bib11) 2002; 10 Sabelfeld, Myers (bib1) 2003; 21 Barthe G, Serpette B. Partial evaluation and non-interference for object calculi. In: Middeldorp A, Sato T, editors. Proceedings of FLOPS’99, Lecture notes in computer science, vol. 1722. Berlin: Springer; 1999. p. 53–67. Henrio L, Serpette B. A parameterized polyvariant bytecode verifier. In: Filliatre J-C, editor. Proceedings of JFLA’03, 2003. Genaim S, Spoto F. Information flow analysis for Java bytecode. In Cousot R, editor. Proceedings of VMCAI’05, Lecture notes in computer science, vol. 3385. Berlin: Springer; 2005. p. 346–62. Ball (bib15) 1993; 2 Nipkow T, Paulson LC, Wenzel M. Isabelle/HOL: a proof assistant for higher-order logic, Lecture notes in computer science, vol. 2283. Berlin: Springer; 2002. Honda, Yoshida (bib5) 2002 Coglio (bib19) 2004; 16 League C, Shao Z, Trifonov V. Precision in practice: a type-preserving Java compiler. In Hedin G, editor. Proceedings of CC’03, Lecture notes in computer science, vol. 2622. Berlin: Springer; 2003. p. 106–20. Barthe A, Rezk T. Non-interference for a JVM-like language. In: Fähndrich M, editor. Proceedings of TLDI’05. New York: ACM Press; 2005, pp. 103–112. Goguen (10.1016/j.cl.2005.05.002_bib2) 1982 Pottier (10.1016/j.cl.2005.05.002_bib9) 2003; 25 Klein (10.1016/j.cl.2005.05.002_bib30) 2002; 298 Coglio (10.1016/j.cl.2005.05.002_bib19) 2004; 16 10.1016/j.cl.2005.05.002_bib6 10.1016/j.cl.2005.05.002_bib31 10.1016/j.cl.2005.05.002_bib10 Bieber (10.1016/j.cl.2005.05.002_bib11) 2002; 10 10.1016/j.cl.2005.05.002_bib3 Myers (10.1016/j.cl.2005.05.002_bib8) 1999 Leroy (10.1016/j.cl.2005.05.002_bib12) 2003; 30 10.1016/j.cl.2005.05.002_bib16 10.1016/j.cl.2005.05.002_bib18 Banerjee (10.1016/j.cl.2005.05.002_bib7) 2002 Abadi (10.1016/j.cl.2005.05.002_bib13) 1999; 46 Necula (10.1016/j.cl.2005.05.002_bib14) 1997 Heintze (10.1016/j.cl.2005.05.002_bib4) 1998 Sabelfeld (10.1016/j.cl.2005.05.002_bib1) 2003; 21 10.1016/j.cl.2005.05.002_bib23 Morrisett (10.1016/j.cl.2005.05.002_bib27) 1998 Honda (10.1016/j.cl.2005.05.002_bib5) 2002 10.1016/j.cl.2005.05.002_bib24 10.1016/j.cl.2005.05.002_bib25 10.1016/j.cl.2005.05.002_bib26 10.1016/j.cl.2005.05.002_bib20 10.1016/j.cl.2005.05.002_bib21 10.1016/j.cl.2005.05.002_bib22 10.1016/j.cl.2005.05.002_bib28 10.1016/j.cl.2005.05.002_bib29 Ball (10.1016/j.cl.2005.05.002_bib15) 1993; 2 with (10.1016/j.cl.2005.05.002_bib17) 2002 |
| References_xml | – start-page: 85 year: 1998 end-page: 97 ident: bib27 article-title: From system F to typed assembly language publication-title: Proceedings of POPL’98 – reference: Volpano D, Smith G. A type-based approach to program security. In: Bidoit M, Dauchet M, editors. Proceedings of TAPSOFT’97, Lecture notes in computer science, vol. 1214. Berlin: Springer; 1997. p. 607–21. – reference: Bonelli E, Compagnoni A, Medel R. SIFTAL: A typed assembly language for secure information flow analysis. In: Sabelfeld A, editor. Informal Proceedings of FCS’05; 2004. – reference: Jacobs B, Pieters W, Warnier M. Statically checking confidentiality via dynamic labels, to appear, 2005. – start-page: 106 year: 1997 end-page: 119 ident: bib14 article-title: Proof-carrying code publication-title: Proceedings of POPL’97 – reference: Volpano D, Smith G, Irvine C. A sound type system for secure flow analysis. Journal of Computer Security 1996;167–87. – year: 2002 ident: bib17 article-title: Modern compiler implementation in Java – volume: 298 start-page: 583 year: 2002 end-page: 626 ident: bib30 article-title: Verified bytecode verifiers publication-title: Theoretical Computer Science – volume: 10 start-page: 369 year: 2002 end-page: 398 ident: bib11 article-title: Checking secure interactions of smart card applets: extended version publication-title: Journal of Computer Security – volume: 30 start-page: 235 year: 2003 end-page: 269 ident: bib12 article-title: Java bytecode verification: algorithms and formalizations publication-title: Journal of Automated Reasoning – reference: Barthe A, Rezk T. Non-interference for a JVM-like language. In: Fähndrich M, editor. Proceedings of TLDI’05. New York: ACM Press; 2005, pp. 103–112. – reference: Zdancewic S, Myers A. Secure information flow and CPS. In: Sands D, editor. Proceedings of ESOP’01, Lecture notes in computer science, vol. 2028. Berlin: Springer; 2001. p. 46–61. – start-page: 81 year: 2002 end-page: 92 ident: bib5 article-title: A uniform type structure for secure information flow publication-title: Proceedings of POPL’02 – volume: 2 start-page: 1 year: 1993 end-page: 16 ident: bib15 article-title: What's in a region? Or computing control dependence regions in near-linear time for reducible control flow publication-title: ACM Letters on Programming Languages and Systems – reference: League C, Shao Z, Trifonov V. Precision in practice: a type-preserving Java compiler. In Hedin G, editor. Proceedings of CC’03, Lecture notes in computer science, vol. 2622. Berlin: Springer; 2003. p. 106–20. – volume: 21 start-page: 5 year: 2003 end-page: 19 ident: bib1 article-title: Language-based information-flow security publication-title: IEEE Journal on Selected Areas in Communications – reference: Barthe G, Serpette B. Partial evaluation and non-interference for object calculi. In: Middeldorp A, Sato T, editors. Proceedings of FLOPS’99, Lecture notes in computer science, vol. 1722. Berlin: Springer; 1999. p. 53–67. – year: 2002 ident: bib7 article-title: Secure information flow and pointer confinement in a Java-like language publication-title: Proceedings of CSFW’02 – reference: Coq Development Team. The coq proof assistant user's guide. Version 8.0, January 2004. – start-page: 11 year: 1982 end-page: 22 ident: bib2 article-title: Security policies and security models publication-title: Proceedings of SOSP’82 – volume: 25 start-page: 117 year: 2003 end-page: 158 ident: bib9 article-title: Information flow inference for ML publication-title: ACM Transactions on Programming Languages and Systems – reference: Genaim S, Spoto F. Information flow analysis for Java bytecode. In Cousot R, editor. Proceedings of VMCAI’05, Lecture notes in computer science, vol. 3385. Berlin: Springer; 2005. p. 346–62. – reference: Barthe G, Dufay G. A tool-assisted framework for certified bytecode verification. In: Proceedings of FASE’04, Lecture notes in computer science, vol. 2984. Berlin: Springer; 2004. p. 99–113. – reference: Bernardeschi C, De Francesco N. Combining abstract interpretation and model checking for analysing security properties of Java Bytecode. In: Cortesi A, editor. Proceedings of VMCAI’02, Lecture notes in computer science, vol. 2294. Berlin: Springer; 2002. p. 1–15. – reference: Henrio L, Serpette B. A parameterized polyvariant bytecode verifier. In: Filliatre J-C, editor. Proceedings of JFLA’03, 2003. – reference: Necula GC, Lee P. The design and implementation of a certifying compiler. In: Proceedings of PLDI’98, 1998. p. 333–44. – volume: 16 start-page: 647 year: 2004 end-page: 670 ident: bib19 article-title: Simple verification technique for complex Java bytecode subroutines publication-title: Concurrency and Computation: Practice and Experience – start-page: 228 year: 1999 end-page: 241 ident: bib8 article-title: Jflow: Practical mostly-static information flow control publication-title: Proceedings of POPL’99 – reference: Nipkow T, Paulson LC, Wenzel M. Isabelle/HOL: a proof assistant for higher-order logic, Lecture notes in computer science, vol. 2283. Berlin: Springer; 2002. – start-page: 365 year: 1998 end-page: 377 ident: bib4 article-title: The SLam calculus: programming with secrecy and integrity publication-title: Proceedings of POPL’98 – volume: 46 start-page: 749 year: 1999 end-page: 786 ident: bib13 article-title: Secrecy by typing in security protocols publication-title: Journal of the ACM – ident: 10.1016/j.cl.2005.05.002_bib21 doi: 10.21236/ADA486429 – ident: 10.1016/j.cl.2005.05.002_bib24 doi: 10.1007/3-540-36579-6_8 – year: 2002 ident: 10.1016/j.cl.2005.05.002_bib17 – ident: 10.1016/j.cl.2005.05.002_bib10 doi: 10.1007/3-540-47813-2_1 – volume: 21 start-page: 5 year: 2003 ident: 10.1016/j.cl.2005.05.002_bib1 article-title: Language-based information-flow security publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/JSAC.2002.806121 – ident: 10.1016/j.cl.2005.05.002_bib25 doi: 10.1007/3-540-45309-1_4 – start-page: 228 year: 1999 ident: 10.1016/j.cl.2005.05.002_bib8 article-title: Jflow: Practical mostly-static information flow control – volume: 25 start-page: 117 issue: 1 year: 2003 ident: 10.1016/j.cl.2005.05.002_bib9 article-title: Information flow inference for ML publication-title: ACM Transactions on Programming Languages and Systems doi: 10.1145/596980.596983 – volume: 10 start-page: 369 year: 2002 ident: 10.1016/j.cl.2005.05.002_bib11 article-title: Checking secure interactions of smart card applets: extended version publication-title: Journal of Computer Security doi: 10.3233/JCS-2002-10404 – ident: 10.1016/j.cl.2005.05.002_bib26 doi: 10.1145/277650.277752 – volume: 30 start-page: 235 issue: 3–4 year: 2003 ident: 10.1016/j.cl.2005.05.002_bib12 article-title: Java bytecode verification: algorithms and formalizations publication-title: Journal of Automated Reasoning doi: 10.1023/A:1025055424017 – start-page: 106 year: 1997 ident: 10.1016/j.cl.2005.05.002_bib14 article-title: Proof-carrying code – volume: 46 start-page: 749 issue: 5 year: 1999 ident: 10.1016/j.cl.2005.05.002_bib13 article-title: Secrecy by typing in security protocols publication-title: Journal of the ACM doi: 10.1145/324133.324266 – ident: 10.1016/j.cl.2005.05.002_bib18 doi: 10.1145/1045405.1045411 – start-page: 365 year: 1998 ident: 10.1016/j.cl.2005.05.002_bib4 article-title: The SLam calculus: programming with secrecy and integrity – ident: 10.1016/j.cl.2005.05.002_bib6 doi: 10.1007/10705424_4 – start-page: 81 year: 2002 ident: 10.1016/j.cl.2005.05.002_bib5 article-title: A uniform type structure for secure information flow – ident: 10.1016/j.cl.2005.05.002_bib16 doi: 10.1145/1040294.1040304 – ident: 10.1016/j.cl.2005.05.002_bib29 – ident: 10.1016/j.cl.2005.05.002_bib3 doi: 10.3233/JCS-1996-42-304 – year: 2002 ident: 10.1016/j.cl.2005.05.002_bib7 article-title: Secure information flow and pointer confinement in a Java-like language – ident: 10.1016/j.cl.2005.05.002_bib20 – start-page: 11 year: 1982 ident: 10.1016/j.cl.2005.05.002_bib2 article-title: Security policies and security models – volume: 16 start-page: 647 issue: 7 year: 2004 ident: 10.1016/j.cl.2005.05.002_bib19 article-title: Simple verification technique for complex Java bytecode subroutines publication-title: Concurrency and Computation: Practice and Experience doi: 10.1002/cpe.798 – volume: 298 start-page: 583 issue: 3 year: 2002 ident: 10.1016/j.cl.2005.05.002_bib30 article-title: Verified bytecode verifiers publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(02)00869-1 – ident: 10.1016/j.cl.2005.05.002_bib28 doi: 10.1007/978-3-540-24721-0_7 – start-page: 85 year: 1998 ident: 10.1016/j.cl.2005.05.002_bib27 article-title: From system F to typed assembly language – ident: 10.1016/j.cl.2005.05.002_bib22 – volume: 2 start-page: 1 issue: 1–4 year: 1993 ident: 10.1016/j.cl.2005.05.002_bib15 article-title: What's in a region? Or computing control dependence regions in near-linear time for reducible control flow publication-title: ACM Letters on Programming Languages and Systems doi: 10.1145/176454.176456 – ident: 10.1016/j.cl.2005.05.002_bib23 doi: 10.1007/978-3-540-30579-8_23 – ident: 10.1016/j.cl.2005.05.002_bib31 doi: 10.1007/3-540-45949-9 |
| SSID | ssj0020845 |
| Score | 1.7982378 |
| Snippet | Starting from the seminal work of Volpano and Smith, there has been growing evidence that type systems may be used to enforce confidentiality of programs... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 35 |
| SubjectTerms | Low-level languages Non-interference Program analysis Security |
| Title | Security types preserving compilation |
| URI | https://dx.doi.org/10.1016/j.cl.2005.05.002 |
| Volume | 33 |
| WOSCitedRecordID | wos000243811700001&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: 1873-6866 dateEnd: 20181231 omitProxy: false ssIdentifier: ssj0020845 issn: 1477-8424 databaseCode: AIEXJ dateStart: 20020401 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT4QwEG6MevDi2_gOBz14QIECbY9qfMYYEzXZG4G2xDUrbpbVGH-90xesz-jBhBBCgALfMDMdZr5BaIuFPEgDIn0eisSPcUx9sDvYD6lgvKRpygtN4npBLi9pp8OubLujWrcTIFVFX15Y_1-hhn0Atiqd_QPczUVhB2wD6LAG2GH9K-CvbUc6HV2tFQmACrza2tp-t9dC4QgKbGOHJnapoTUUz7UWDUMy-zRo8w0PYOA7HQs9UcWEbcK8fDWp1_lDPmjn-nn9pJXQQ3eYF3fvIg2kyUp1yjEmYNFiU_PstKehsbBSEo2oQsNCYo2qYf3-pK5N5OB-l_dsdEsHuFrT5H7Hf7BYTR6hS1G7z3hPNdRMMrUobtGJiCQM9N7E_tlR57yZggdUt61unsT-uDYZf-_v4mtHZcT5uJlF03bW4O0btOfQmKzm0YwDzrMKegFtO_A9Db7Xgu-NgL-Ibo-Pbg5PfdsIw-cRi4c-C3IupKDgyoM7zspIsohzHggmGI1xKkmBEyrg66JpQZKi5IrYUZayJEkZigAvofHqsZLLyNP8ezgsYyxUYVDCUoqJiBhVVHRpFK-gPffUGbcs8apZSS_77l2voJ3mjL5hSPnhWOxeZGY9POO5ZSAR3561-ocR1tBUK7rraBy-D7mBJvnzsFsPNq04vAEkW21S |
| 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=Security+types+preserving+compilation&rft.jtitle=Computer+languages%2C+systems+%26+structures&rft.au=Barthe%2C+Gilles&rft.au=Rezk%2C+Tamara&rft.au=Basu%2C+Amitabh&rft.date=2007-07-01&rft.issn=1477-8424&rft.volume=33&rft.issue=2&rft.spage=35&rft.epage=59&rft_id=info:doi/10.1016%2Fj.cl.2005.05.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cl_2005_05_002 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1477-8424&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1477-8424&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1477-8424&client=summon |