Formalisation and Verification of Java Card Security Properties in Dynamic Logic

We present how common Java Card security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illust...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Mostowski, Wojciech
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Dynamic Logic Exact sciences and technology Proof Obligation Proof Step Security Property Smart Card Software Software engineering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	371
container_issue
container_start_page	357
container_title
container_volume
creator	Mostowski, Wojciech
description	We present how common Java Card security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illustrate them with examples of real-life, industrial size, Java Card applications, and show how the properties are verified with the KeY Prover – an interactive theorem prover for Java Card source code based on a version of Dynamic Logic that models the full Java Card standard. We report on the experience related to formal verification of Java Card programs we gained during the course of this work. Thereafter, we present the current state of the art of formal verification techniques offered by the KeY system and give an assessment of interactive theorem proving as an alternative to static analysis.
doi_str_mv	10.1007/978-3-540-31984-9_27
format	Book Chapter
fullrecord	<record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16895085</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16895085</sourcerecordid><originalsourceid>FETCH-LOGICAL-p274t-5ca98cd82d7a4ae1fc6e847f030da195eebf1341fea844d8ddf4e45661665f953</originalsourceid><addsrcrecordid>eNotkEtLAzEQx-MLrLXfwEMuHqPJJtlNjlKtDwoWfOAtTPOQaLu7JKvQb2_aOpeB339mGH4IXTB6xShtrnWjCCdSUMKZVoJoUzUHaFIwL3DH9CEasZoxwrnQR-hsG1RSVPTjGI0opxXRjeCnaJLzFy3FWVlWI7SYdWkNq5hhiF2LoXX43acYot2DLuAn-AU8heTwi7c_KQ4bvEhd79MQfcaxxbebFtbR4nn3Ge05Ogmwyn7y38fobXb3On0g8-f7x-nNnPRVIwYiLWhlnapcAwI8C7b2SjShvOqAaen9MjAuWPCghHDKuSC8kHXN6loGLfkYXe7v9pAtrEKC1sZs-hTXkDaG1UpLqrZz1X4ul6j99Mksu-47G0bN1q0pEg03xZbZeTRbt_wPI0ZoDQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Formalisation and Verification of Java Card Security Properties in Dynamic Logic</title><source>Springer Books</source><creator>Mostowski, Wojciech</creator><contributor>Cerioli, Maura</contributor><creatorcontrib>Mostowski, Wojciech ; Cerioli, Maura</creatorcontrib><description>We present how common Java Card security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illustrate them with examples of real-life, industrial size, Java Card applications, and show how the properties are verified with the KeY Prover – an interactive theorem prover for Java Card source code based on a version of Dynamic Logic that models the full Java Card standard. We report on the experience related to formal verification of Java Card programs we gained during the course of this work. Thereafter, we present the current state of the art of formal verification techniques offered by the KeY system and give an assessment of interactive theorem proving as an alternative to static analysis.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 354025420X</identifier><identifier>ISBN: 9783540254201</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540319849</identifier><identifier>EISBN: 3540319840</identifier><identifier>DOI: 10.1007/978-3-540-31984-9_27</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Dynamic Logic ; Exact sciences and technology ; Proof Obligation ; Proof Step ; Security Property ; Smart Card ; Software ; Software engineering</subject><ispartof>Fundamental Approaches to Software Engineering, 2005, p.357-371</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-31984-9_27$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-31984-9_27$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16895085$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Cerioli, Maura</contributor><creatorcontrib>Mostowski, Wojciech</creatorcontrib><title>Formalisation and Verification of Java Card Security Properties in Dynamic Logic</title><title>Fundamental Approaches to Software Engineering</title><description>We present how common Java Card security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illustrate them with examples of real-life, industrial size, Java Card applications, and show how the properties are verified with the KeY Prover – an interactive theorem prover for Java Card source code based on a version of Dynamic Logic that models the full Java Card standard. We report on the experience related to formal verification of Java Card programs we gained during the course of this work. Thereafter, we present the current state of the art of formal verification techniques offered by the KeY system and give an assessment of interactive theorem proving as an alternative to static analysis.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Dynamic Logic</subject><subject>Exact sciences and technology</subject><subject>Proof Obligation</subject><subject>Proof Step</subject><subject>Security Property</subject><subject>Smart Card</subject><subject>Software</subject><subject>Software engineering</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>354025420X</isbn><isbn>9783540254201</isbn><isbn>9783540319849</isbn><isbn>3540319840</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkEtLAzEQx-MLrLXfwEMuHqPJJtlNjlKtDwoWfOAtTPOQaLu7JKvQb2_aOpeB339mGH4IXTB6xShtrnWjCCdSUMKZVoJoUzUHaFIwL3DH9CEasZoxwrnQR-hsG1RSVPTjGI0opxXRjeCnaJLzFy3FWVlWI7SYdWkNq5hhiF2LoXX43acYot2DLuAn-AU8heTwi7c_KQ4bvEhd79MQfcaxxbebFtbR4nn3Ge05Ogmwyn7y38fobXb3On0g8-f7x-nNnPRVIwYiLWhlnapcAwI8C7b2SjShvOqAaen9MjAuWPCghHDKuSC8kHXN6loGLfkYXe7v9pAtrEKC1sZs-hTXkDaG1UpLqrZz1X4ul6j99Mksu-47G0bN1q0pEg03xZbZeTRbt_wPI0ZoDQ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Mostowski, Wojciech</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Formalisation and Verification of Java Card Security Properties in Dynamic Logic</title><author>Mostowski, Wojciech</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p274t-5ca98cd82d7a4ae1fc6e847f030da195eebf1341fea844d8ddf4e45661665f953</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>Dynamic Logic</topic><topic>Exact sciences and technology</topic><topic>Proof Obligation</topic><topic>Proof Step</topic><topic>Security Property</topic><topic>Smart Card</topic><topic>Software</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mostowski, Wojciech</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mostowski, Wojciech</au><au>Cerioli, Maura</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Formalisation and Verification of Java Card Security Properties in Dynamic Logic</atitle><btitle>Fundamental Approaches to Software Engineering</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>357</spage><epage>371</epage><pages>357-371</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>354025420X</isbn><isbn>9783540254201</isbn><eisbn>9783540319849</eisbn><eisbn>3540319840</eisbn><abstract>We present how common Java Card security properties can be formalised in Dynamic Logic and verified, mostly automatically, with the KeY system. The properties we consider, are a large subset of properties that are of importance to the smart card industry. We discuss the properties one by one, illustrate them with examples of real-life, industrial size, Java Card applications, and show how the properties are verified with the KeY Prover – an interactive theorem prover for Java Card source code based on a version of Dynamic Logic that models the full Java Card standard. We report on the experience related to formal verification of Java Card programs we gained during the course of this work. Thereafter, we present the current state of the art of formal verification techniques offered by the KeY system and give an assessment of interactive theorem proving as an alternative to static analysis.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-31984-9_27</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Fundamental Approaches to Software Engineering, 2005, p.357-371
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_16895085
source	Springer Books
subjects	Applied sciences Computer science control theory systems Dynamic Logic Exact sciences and technology Proof Obligation Proof Step Security Property Smart Card Software Software engineering
title	Formalisation and Verification of Java Card Security Properties in Dynamic Logic
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T03%3A29%3A15IST&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=Formalisation%20and%20Verification%20of%20Java%20Card%20Security%20Properties%20in%20Dynamic%20Logic&rft.btitle=Fundamental%20Approaches%20to%20Software%20Engineering&rft.au=Mostowski,%20Wojciech&rft.date=2005&rft.spage=357&rft.epage=371&rft.pages=357-371&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=354025420X&rft.isbn_list=9783540254201&rft_id=info:doi/10.1007/978-3-540-31984-9_27&rft_dat=%3Cpascalfrancis_sprin%3E16895085%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540319849&rft.eisbn_list=3540319840&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true