A UTP semantic model for Orc language with execution status and fault handling
Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semant...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Qin [verfasserIn] Zhao, Yongxin [verfasserIn] Zhu, Huibiao [verfasserIn] He, Jifeng [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Frontiers of computer science in China - Beijing : Higher Education Press, 2007, 8(2014), 5 vom: 26. Aug., Seite 709-725 |
|---|---|
| Übergeordnetes Werk: |
volume:8 ; year:2014 ; number:5 ; day:26 ; month:08 ; pages:709-725 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11704-014-3385-2 |
|---|
| Katalog-ID: |
SPR021937931 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR021937931 | ||
| 003 | DE-627 | ||
| 005 | 20220111090307.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201006s2014 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11704-014-3385-2 |2 doi | |
| 035 | |a (DE-627)SPR021937931 | ||
| 035 | |a (SPR)s11704-014-3385-2-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q ASE |
| 084 | |a 54.00 |2 bkl | ||
| 100 | 1 | |a Li, Qin |e verfasserin |4 aut | |
| 245 | 1 | 2 | |a A UTP semantic model for Orc language with execution status and fault handling |
| 264 | 1 | |c 2014 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. | ||
| 650 | 4 | |a Orc language |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a service oriented computing |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a unifying theories of programming |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a denotational semantics |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a operational semantics |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Zhao, Yongxin |e verfasserin |4 aut | |
| 700 | 1 | |a Zhu, Huibiao |e verfasserin |4 aut | |
| 700 | 1 | |a He, Jifeng |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Frontiers of computer science in China |d Beijing : Higher Education Press, 2007 |g 8(2014), 5 vom: 26. Aug., Seite 709-725 |w (DE-627)545787726 |w (DE-600)2388878-7 |x 1673-7466 |7 nnns |
| 773 | 1 | 8 | |g volume:8 |g year:2014 |g number:5 |g day:26 |g month:08 |g pages:709-725 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11704-014-3385-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_74 | ||
| 912 | |a GBV_ILN_90 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_101 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_138 | ||
| 912 | |a GBV_ILN_152 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_171 | ||
| 912 | |a GBV_ILN_187 | ||
| 912 | |a GBV_ILN_224 | ||
| 912 | |a GBV_ILN_250 | ||
| 912 | |a GBV_ILN_281 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_702 | ||
| 912 | |a GBV_ILN_2005 | ||
| 936 | b | k | |a 54.00 |q ASE |
| 951 | |a AR | ||
| 952 | |d 8 |j 2014 |e 5 |b 26 |c 08 |h 709-725 | ||
| author_variant |
q l ql y z yz h z hz j h jh |
|---|---|
| matchkey_str |
article:16737466:2014----::upeatcoefrrlnugwteeuintt |
| hierarchy_sort_str |
2014 |
| bklnumber |
54.00 |
| publishDate |
2014 |
| allfields |
10.1007/s11704-014-3385-2 doi (DE-627)SPR021937931 (SPR)s11704-014-3385-2-e DE-627 ger DE-627 rakwb eng 004 ASE 54.00 bkl Li, Qin verfasserin aut A UTP semantic model for Orc language with execution status and fault handling 2014 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. Orc language (dpeaa)DE-He213 service oriented computing (dpeaa)DE-He213 unifying theories of programming (dpeaa)DE-He213 denotational semantics (dpeaa)DE-He213 operational semantics (dpeaa)DE-He213 Zhao, Yongxin verfasserin aut Zhu, Huibiao verfasserin aut He, Jifeng verfasserin aut Enthalten in Frontiers of computer science in China Beijing : Higher Education Press, 2007 8(2014), 5 vom: 26. Aug., Seite 709-725 (DE-627)545787726 (DE-600)2388878-7 1673-7466 nnns volume:8 year:2014 number:5 day:26 month:08 pages:709-725 https://dx.doi.org/10.1007/s11704-014-3385-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2005 54.00 ASE AR 8 2014 5 26 08 709-725 |
| spelling |
10.1007/s11704-014-3385-2 doi (DE-627)SPR021937931 (SPR)s11704-014-3385-2-e DE-627 ger DE-627 rakwb eng 004 ASE 54.00 bkl Li, Qin verfasserin aut A UTP semantic model for Orc language with execution status and fault handling 2014 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. Orc language (dpeaa)DE-He213 service oriented computing (dpeaa)DE-He213 unifying theories of programming (dpeaa)DE-He213 denotational semantics (dpeaa)DE-He213 operational semantics (dpeaa)DE-He213 Zhao, Yongxin verfasserin aut Zhu, Huibiao verfasserin aut He, Jifeng verfasserin aut Enthalten in Frontiers of computer science in China Beijing : Higher Education Press, 2007 8(2014), 5 vom: 26. Aug., Seite 709-725 (DE-627)545787726 (DE-600)2388878-7 1673-7466 nnns volume:8 year:2014 number:5 day:26 month:08 pages:709-725 https://dx.doi.org/10.1007/s11704-014-3385-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2005 54.00 ASE AR 8 2014 5 26 08 709-725 |
| allfields_unstemmed |
10.1007/s11704-014-3385-2 doi (DE-627)SPR021937931 (SPR)s11704-014-3385-2-e DE-627 ger DE-627 rakwb eng 004 ASE 54.00 bkl Li, Qin verfasserin aut A UTP semantic model for Orc language with execution status and fault handling 2014 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. Orc language (dpeaa)DE-He213 service oriented computing (dpeaa)DE-He213 unifying theories of programming (dpeaa)DE-He213 denotational semantics (dpeaa)DE-He213 operational semantics (dpeaa)DE-He213 Zhao, Yongxin verfasserin aut Zhu, Huibiao verfasserin aut He, Jifeng verfasserin aut Enthalten in Frontiers of computer science in China Beijing : Higher Education Press, 2007 8(2014), 5 vom: 26. Aug., Seite 709-725 (DE-627)545787726 (DE-600)2388878-7 1673-7466 nnns volume:8 year:2014 number:5 day:26 month:08 pages:709-725 https://dx.doi.org/10.1007/s11704-014-3385-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2005 54.00 ASE AR 8 2014 5 26 08 709-725 |
| allfieldsGer |
10.1007/s11704-014-3385-2 doi (DE-627)SPR021937931 (SPR)s11704-014-3385-2-e DE-627 ger DE-627 rakwb eng 004 ASE 54.00 bkl Li, Qin verfasserin aut A UTP semantic model for Orc language with execution status and fault handling 2014 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. Orc language (dpeaa)DE-He213 service oriented computing (dpeaa)DE-He213 unifying theories of programming (dpeaa)DE-He213 denotational semantics (dpeaa)DE-He213 operational semantics (dpeaa)DE-He213 Zhao, Yongxin verfasserin aut Zhu, Huibiao verfasserin aut He, Jifeng verfasserin aut Enthalten in Frontiers of computer science in China Beijing : Higher Education Press, 2007 8(2014), 5 vom: 26. Aug., Seite 709-725 (DE-627)545787726 (DE-600)2388878-7 1673-7466 nnns volume:8 year:2014 number:5 day:26 month:08 pages:709-725 https://dx.doi.org/10.1007/s11704-014-3385-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2005 54.00 ASE AR 8 2014 5 26 08 709-725 |
| allfieldsSound |
10.1007/s11704-014-3385-2 doi (DE-627)SPR021937931 (SPR)s11704-014-3385-2-e DE-627 ger DE-627 rakwb eng 004 ASE 54.00 bkl Li, Qin verfasserin aut A UTP semantic model for Orc language with execution status and fault handling 2014 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. Orc language (dpeaa)DE-He213 service oriented computing (dpeaa)DE-He213 unifying theories of programming (dpeaa)DE-He213 denotational semantics (dpeaa)DE-He213 operational semantics (dpeaa)DE-He213 Zhao, Yongxin verfasserin aut Zhu, Huibiao verfasserin aut He, Jifeng verfasserin aut Enthalten in Frontiers of computer science in China Beijing : Higher Education Press, 2007 8(2014), 5 vom: 26. Aug., Seite 709-725 (DE-627)545787726 (DE-600)2388878-7 1673-7466 nnns volume:8 year:2014 number:5 day:26 month:08 pages:709-725 https://dx.doi.org/10.1007/s11704-014-3385-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2005 54.00 ASE AR 8 2014 5 26 08 709-725 |
| language |
English |
| source |
Enthalten in Frontiers of computer science in China 8(2014), 5 vom: 26. Aug., Seite 709-725 volume:8 year:2014 number:5 day:26 month:08 pages:709-725 |
| sourceStr |
Enthalten in Frontiers of computer science in China 8(2014), 5 vom: 26. Aug., Seite 709-725 volume:8 year:2014 number:5 day:26 month:08 pages:709-725 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Orc language service oriented computing unifying theories of programming denotational semantics operational semantics |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Frontiers of computer science in China |
| authorswithroles_txt_mv |
Li, Qin @@aut@@ Zhao, Yongxin @@aut@@ Zhu, Huibiao @@aut@@ He, Jifeng @@aut@@ |
| publishDateDaySort_date |
2014-08-26T00:00:00Z |
| hierarchy_top_id |
545787726 |
| dewey-sort |
14 |
| id |
SPR021937931 |
| 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">SPR021937931</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111090307.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11704-014-3385-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR021937931</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11704-014-3385-2-e</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">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Qin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A UTP semantic model for Orc language with execution status and fault handling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Orc language</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">service oriented computing</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">unifying theories of programming</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">denotational semantics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">operational semantics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Yongxin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Huibiao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">He, Jifeng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Frontiers of computer science in China</subfield><subfield code="d">Beijing : Higher Education Press, 2007</subfield><subfield code="g">8(2014), 5 vom: 26. Aug., Seite 709-725</subfield><subfield code="w">(DE-627)545787726</subfield><subfield code="w">(DE-600)2388878-7</subfield><subfield code="x">1673-7466</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:5</subfield><subfield code="g">day:26</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:709-725</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11704-014-3385-2</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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</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_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</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_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2014</subfield><subfield code="e">5</subfield><subfield code="b">26</subfield><subfield code="c">08</subfield><subfield code="h">709-725</subfield></datafield></record></collection>
|
| author |
Li, Qin |
| spellingShingle |
Li, Qin ddc 004 bkl 54.00 misc Orc language misc service oriented computing misc unifying theories of programming misc denotational semantics misc operational semantics A UTP semantic model for Orc language with execution status and fault handling |
| authorStr |
Li, Qin |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)545787726 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1673-7466 |
| topic_title |
004 ASE 54.00 bkl A UTP semantic model for Orc language with execution status and fault handling Orc language (dpeaa)DE-He213 service oriented computing (dpeaa)DE-He213 unifying theories of programming (dpeaa)DE-He213 denotational semantics (dpeaa)DE-He213 operational semantics (dpeaa)DE-He213 |
| topic |
ddc 004 bkl 54.00 misc Orc language misc service oriented computing misc unifying theories of programming misc denotational semantics misc operational semantics |
| topic_unstemmed |
ddc 004 bkl 54.00 misc Orc language misc service oriented computing misc unifying theories of programming misc denotational semantics misc operational semantics |
| topic_browse |
ddc 004 bkl 54.00 misc Orc language misc service oriented computing misc unifying theories of programming misc denotational semantics misc operational semantics |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Frontiers of computer science in China |
| hierarchy_parent_id |
545787726 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Frontiers of computer science in China |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)545787726 (DE-600)2388878-7 |
| title |
A UTP semantic model for Orc language with execution status and fault handling |
| ctrlnum |
(DE-627)SPR021937931 (SPR)s11704-014-3385-2-e |
| title_full |
A UTP semantic model for Orc language with execution status and fault handling |
| author_sort |
Li, Qin |
| journal |
Frontiers of computer science in China |
| journalStr |
Frontiers of computer science in China |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
txt |
| container_start_page |
709 |
| author_browse |
Li, Qin Zhao, Yongxin Zhu, Huibiao He, Jifeng |
| container_volume |
8 |
| class |
004 ASE 54.00 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Li, Qin |
| doi_str_mv |
10.1007/s11704-014-3385-2 |
| dewey-full |
004 |
| author2-role |
verfasserin |
| title_sort |
utp semantic model for orc language with execution status and fault handling |
| title_auth |
A UTP semantic model for Orc language with execution status and fault handling |
| abstract |
Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. |
| abstractGer |
Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. |
| abstract_unstemmed |
Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2005 |
| container_issue |
5 |
| title_short |
A UTP semantic model for Orc language with execution status and fault handling |
| url |
https://dx.doi.org/10.1007/s11704-014-3385-2 |
| remote_bool |
true |
| author2 |
Zhao, Yongxin Zhu, Huibiao He, Jifeng |
| author2Str |
Zhao, Yongxin Zhu, Huibiao He, Jifeng |
| ppnlink |
545787726 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11704-014-3385-2 |
| up_date |
2024-07-04T01:06:12.745Z |
| _version_ |
1803608572823601152 |
| 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">SPR021937931</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111090307.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2014 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11704-014-3385-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR021937931</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11704-014-3385-2-e</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">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Qin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A UTP semantic model for Orc language with execution status and fault handling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Orc language</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">service oriented computing</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">unifying theories of programming</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">denotational semantics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">operational semantics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhao, Yongxin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Huibiao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">He, Jifeng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Frontiers of computer science in China</subfield><subfield code="d">Beijing : Higher Education Press, 2007</subfield><subfield code="g">8(2014), 5 vom: 26. Aug., Seite 709-725</subfield><subfield code="w">(DE-627)545787726</subfield><subfield code="w">(DE-600)2388878-7</subfield><subfield code="x">1673-7466</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:5</subfield><subfield code="g">day:26</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:709-725</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11704-014-3385-2</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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</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_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</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_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2014</subfield><subfield code="e">5</subfield><subfield code="b">26</subfield><subfield code="c">08</subfield><subfield code="h">709-725</subfield></datafield></record></collection>
|
| score |
7.4014387 |