Efficient verification of security protocols using partial-order reductions
Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. The...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Clarke, Edmund [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2003 |
|---|
| Anmerkung: |
© Springer-Verlag 2003 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal on software tools for technology transfer - Springer-Verlag, 1997, 4(2003), 2 vom: Feb., Seite 173-188 |
|---|---|
| Übergeordnetes Werk: |
volume:4 ; year:2003 ; number:2 ; month:02 ; pages:173-188 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-002-0103-4 |
|---|
| Katalog-ID: |
OLC2051500177 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2051500177 | ||
| 003 | DE-627 | ||
| 005 | 20230502154906.0 | ||
| 007 | tu | ||
| 008 | 200819s2003 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-002-0103-4 |2 doi | |
| 035 | |a (DE-627)OLC2051500177 | ||
| 035 | |a (DE-He213)s10009-002-0103-4-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Clarke, Edmund |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Efficient verification of security protocols using partial-order reductions |
| 264 | 1 | |c 2003 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag 2003 | ||
| 520 | |a Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. | ||
| 700 | 1 | |a Jha, Somesh |4 aut | |
| 700 | 1 | |a Marrero, Will |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International journal on software tools for technology transfer |d Springer-Verlag, 1997 |g 4(2003), 2 vom: Feb., Seite 173-188 |w (DE-627)244783365 |w (DE-600)1429686-X |w (DE-576)077448456 |x 1433-2779 |7 nnns |
| 773 | 1 | 8 | |g volume:4 |g year:2003 |g number:2 |g month:02 |g pages:173-188 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10009-002-0103-4 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4247 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 951 | |a AR | ||
| 952 | |d 4 |j 2003 |e 2 |c 02 |h 173-188 | ||
| author_variant |
e c ec s j sj w m wm |
|---|---|
| matchkey_str |
article:14332779:2003----::fiinvrfctooscrtpooossnpr |
| hierarchy_sort_str |
2003 |
| publishDate |
2003 |
| allfields |
10.1007/s10009-002-0103-4 doi (DE-627)OLC2051500177 (DE-He213)s10009-002-0103-4-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Efficient verification of security protocols using partial-order reductions 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2003 Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. Jha, Somesh aut Marrero, Will aut Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 4(2003), 2 vom: Feb., Seite 173-188 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:4 year:2003 number:2 month:02 pages:173-188 https://doi.org/10.1007/s10009-002-0103-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 4 2003 2 02 173-188 |
| spelling |
10.1007/s10009-002-0103-4 doi (DE-627)OLC2051500177 (DE-He213)s10009-002-0103-4-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Efficient verification of security protocols using partial-order reductions 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2003 Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. Jha, Somesh aut Marrero, Will aut Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 4(2003), 2 vom: Feb., Seite 173-188 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:4 year:2003 number:2 month:02 pages:173-188 https://doi.org/10.1007/s10009-002-0103-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 4 2003 2 02 173-188 |
| allfields_unstemmed |
10.1007/s10009-002-0103-4 doi (DE-627)OLC2051500177 (DE-He213)s10009-002-0103-4-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Efficient verification of security protocols using partial-order reductions 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2003 Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. Jha, Somesh aut Marrero, Will aut Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 4(2003), 2 vom: Feb., Seite 173-188 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:4 year:2003 number:2 month:02 pages:173-188 https://doi.org/10.1007/s10009-002-0103-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 4 2003 2 02 173-188 |
| allfieldsGer |
10.1007/s10009-002-0103-4 doi (DE-627)OLC2051500177 (DE-He213)s10009-002-0103-4-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Efficient verification of security protocols using partial-order reductions 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2003 Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. Jha, Somesh aut Marrero, Will aut Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 4(2003), 2 vom: Feb., Seite 173-188 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:4 year:2003 number:2 month:02 pages:173-188 https://doi.org/10.1007/s10009-002-0103-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 4 2003 2 02 173-188 |
| allfieldsSound |
10.1007/s10009-002-0103-4 doi (DE-627)OLC2051500177 (DE-He213)s10009-002-0103-4-p DE-627 ger DE-627 rakwb eng 004 VZ Clarke, Edmund verfasserin aut Efficient verification of security protocols using partial-order reductions 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2003 Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. Jha, Somesh aut Marrero, Will aut Enthalten in International journal on software tools for technology transfer Springer-Verlag, 1997 4(2003), 2 vom: Feb., Seite 173-188 (DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 1433-2779 nnns volume:4 year:2003 number:2 month:02 pages:173-188 https://doi.org/10.1007/s10009-002-0103-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 AR 4 2003 2 02 173-188 |
| language |
English |
| source |
Enthalten in International journal on software tools for technology transfer 4(2003), 2 vom: Feb., Seite 173-188 volume:4 year:2003 number:2 month:02 pages:173-188 |
| sourceStr |
Enthalten in International journal on software tools for technology transfer 4(2003), 2 vom: Feb., Seite 173-188 volume:4 year:2003 number:2 month:02 pages:173-188 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
International journal on software tools for technology transfer |
| authorswithroles_txt_mv |
Clarke, Edmund @@aut@@ Jha, Somesh @@aut@@ Marrero, Will @@aut@@ |
| publishDateDaySort_date |
2003-02-01T00:00:00Z |
| hierarchy_top_id |
244783365 |
| dewey-sort |
14 |
| id |
OLC2051500177 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2051500177</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502154906.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2003 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-002-0103-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051500177</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10009-002-0103-4-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clarke, Edmund</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient verification of security protocols using partial-order reductions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2003</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2003</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jha, Somesh</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marrero, Will</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal on software tools for technology transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">4(2003), 2 vom: Feb., Seite 173-188</subfield><subfield code="w">(DE-627)244783365</subfield><subfield code="w">(DE-600)1429686-X</subfield><subfield code="w">(DE-576)077448456</subfield><subfield code="x">1433-2779</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2003</subfield><subfield code="g">number:2</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:173-188</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10009-002-0103-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2003</subfield><subfield code="e">2</subfield><subfield code="c">02</subfield><subfield code="h">173-188</subfield></datafield></record></collection>
|
| author |
Clarke, Edmund |
| spellingShingle |
Clarke, Edmund ddc 004 Efficient verification of security protocols using partial-order reductions |
| authorStr |
Clarke, Edmund |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)244783365 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1433-2779 |
| topic_title |
004 VZ Efficient verification of security protocols using partial-order reductions |
| topic |
ddc 004 |
| topic_unstemmed |
ddc 004 |
| topic_browse |
ddc 004 |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
International journal on software tools for technology transfer |
| hierarchy_parent_id |
244783365 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
International journal on software tools for technology transfer |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)244783365 (DE-600)1429686-X (DE-576)077448456 |
| title |
Efficient verification of security protocols using partial-order reductions |
| ctrlnum |
(DE-627)OLC2051500177 (DE-He213)s10009-002-0103-4-p |
| title_full |
Efficient verification of security protocols using partial-order reductions |
| author_sort |
Clarke, Edmund |
| journal |
International journal on software tools for technology transfer |
| journalStr |
International journal on software tools for technology transfer |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2003 |
| contenttype_str_mv |
txt |
| container_start_page |
173 |
| author_browse |
Clarke, Edmund Jha, Somesh Marrero, Will |
| container_volume |
4 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Clarke, Edmund |
| doi_str_mv |
10.1007/s10009-002-0103-4 |
| dewey-full |
004 |
| title_sort |
efficient verification of security protocols using partial-order reductions |
| title_auth |
Efficient verification of security protocols using partial-order reductions |
| abstract |
Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. © Springer-Verlag 2003 |
| abstractGer |
Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. © Springer-Verlag 2003 |
| abstract_unstemmed |
Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented. © Springer-Verlag 2003 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_40 GBV_ILN_70 GBV_ILN_120 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4247 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4305 GBV_ILN_4306 |
| container_issue |
2 |
| title_short |
Efficient verification of security protocols using partial-order reductions |
| url |
https://doi.org/10.1007/s10009-002-0103-4 |
| remote_bool |
false |
| author2 |
Jha, Somesh Marrero, Will |
| author2Str |
Jha, Somesh Marrero, Will |
| ppnlink |
244783365 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-002-0103-4 |
| up_date |
2024-07-04T04:35:47.541Z |
| _version_ |
1803621758449745920 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2051500177</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502154906.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2003 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-002-0103-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2051500177</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10009-002-0103-4-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Clarke, Edmund</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient verification of security protocols using partial-order reductions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2003</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2003</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. In this paper we explore how partial-order reduction can make the task of verifying security protocols more efficient. These reduction techniques have been implemented in our tool Brutus. Partial-order reductions have proved very useful in the domain of model checking reactive systems. These reductions are not directly applicable in our context because of additional complications caused by tracking knowledge of various agents. We present partial-order reductions in the context of verifying security protocols and prove their correctness. Experimental results demonstrating the effectiveness of this reduction technique are also presented.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jha, Somesh</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marrero, Will</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal on software tools for technology transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">4(2003), 2 vom: Feb., Seite 173-188</subfield><subfield code="w">(DE-627)244783365</subfield><subfield code="w">(DE-600)1429686-X</subfield><subfield code="w">(DE-576)077448456</subfield><subfield code="x">1433-2779</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:4</subfield><subfield code="g">year:2003</subfield><subfield code="g">number:2</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:173-188</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10009-002-0103-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">4</subfield><subfield code="j">2003</subfield><subfield code="e">2</subfield><subfield code="c">02</subfield><subfield code="h">173-188</subfield></datafield></record></collection>
|
| score |
7.3993273 |