Parallel search for LTL violations
Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algori...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Jones, Michael D. [verfasserIn] Sorber, Jacob [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2003 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: International Journal on Software Tools for Technology Transfer - Springer-Verlag, 1997, 7(2003), 1 vom: 28. Nov., Seite 31-42 |
|---|---|
| Übergeordnetes Werk: |
volume:7 ; year:2003 ; number:1 ; day:28 ; month:11 ; pages:31-42 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-003-0115-8 |
|---|
| Katalog-ID: |
SPR008002010 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR008002010 | ||
| 003 | DE-627 | ||
| 005 | 20201124023045.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201005s2003 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-003-0115-8 |2 doi | |
| 035 | |a (DE-627)SPR008002010 | ||
| 035 | |a (SPR)s10009-003-0115-8-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Jones, Michael D. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Parallel search for LTL violations |
| 264 | 1 | |c 2003 | |
| 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 Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. | ||
| 650 | 4 | |a Semiformal verification |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Explicit model checking |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Biologically inspired algorithms |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Sorber, Jacob |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International Journal on Software Tools for Technology Transfer |d Springer-Verlag, 1997 |g 7(2003), 1 vom: 28. Nov., Seite 31-42 |w (DE-627)SPR008001103 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:2003 |g number:1 |g day:28 |g month:11 |g pages:31-42 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s10009-003-0115-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 2003 |e 1 |b 28 |c 11 |h 31-42 | ||
| author_variant |
m d j md mdj j s js |
|---|---|
| matchkey_str |
jonesmichaeldsorberjacob:2003----:aallerholl |
| hierarchy_sort_str |
2003 |
| publishDate |
2003 |
| allfields |
10.1007/s10009-003-0115-8 doi (DE-627)SPR008002010 (SPR)s10009-003-0115-8-e DE-627 ger DE-627 rakwb eng Jones, Michael D. verfasserin aut Parallel search for LTL violations 2003 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. Semiformal verification (dpeaa)DE-He213 Explicit model checking (dpeaa)DE-He213 Biologically inspired algorithms (dpeaa)DE-He213 Sorber, Jacob verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 7(2003), 1 vom: 28. Nov., Seite 31-42 (DE-627)SPR008001103 nnns volume:7 year:2003 number:1 day:28 month:11 pages:31-42 https://dx.doi.org/10.1007/s10009-003-0115-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 7 2003 1 28 11 31-42 |
| spelling |
10.1007/s10009-003-0115-8 doi (DE-627)SPR008002010 (SPR)s10009-003-0115-8-e DE-627 ger DE-627 rakwb eng Jones, Michael D. verfasserin aut Parallel search for LTL violations 2003 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. Semiformal verification (dpeaa)DE-He213 Explicit model checking (dpeaa)DE-He213 Biologically inspired algorithms (dpeaa)DE-He213 Sorber, Jacob verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 7(2003), 1 vom: 28. Nov., Seite 31-42 (DE-627)SPR008001103 nnns volume:7 year:2003 number:1 day:28 month:11 pages:31-42 https://dx.doi.org/10.1007/s10009-003-0115-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 7 2003 1 28 11 31-42 |
| allfields_unstemmed |
10.1007/s10009-003-0115-8 doi (DE-627)SPR008002010 (SPR)s10009-003-0115-8-e DE-627 ger DE-627 rakwb eng Jones, Michael D. verfasserin aut Parallel search for LTL violations 2003 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. Semiformal verification (dpeaa)DE-He213 Explicit model checking (dpeaa)DE-He213 Biologically inspired algorithms (dpeaa)DE-He213 Sorber, Jacob verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 7(2003), 1 vom: 28. Nov., Seite 31-42 (DE-627)SPR008001103 nnns volume:7 year:2003 number:1 day:28 month:11 pages:31-42 https://dx.doi.org/10.1007/s10009-003-0115-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 7 2003 1 28 11 31-42 |
| allfieldsGer |
10.1007/s10009-003-0115-8 doi (DE-627)SPR008002010 (SPR)s10009-003-0115-8-e DE-627 ger DE-627 rakwb eng Jones, Michael D. verfasserin aut Parallel search for LTL violations 2003 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. Semiformal verification (dpeaa)DE-He213 Explicit model checking (dpeaa)DE-He213 Biologically inspired algorithms (dpeaa)DE-He213 Sorber, Jacob verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 7(2003), 1 vom: 28. Nov., Seite 31-42 (DE-627)SPR008001103 nnns volume:7 year:2003 number:1 day:28 month:11 pages:31-42 https://dx.doi.org/10.1007/s10009-003-0115-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 7 2003 1 28 11 31-42 |
| allfieldsSound |
10.1007/s10009-003-0115-8 doi (DE-627)SPR008002010 (SPR)s10009-003-0115-8-e DE-627 ger DE-627 rakwb eng Jones, Michael D. verfasserin aut Parallel search for LTL violations 2003 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. Semiformal verification (dpeaa)DE-He213 Explicit model checking (dpeaa)DE-He213 Biologically inspired algorithms (dpeaa)DE-He213 Sorber, Jacob verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 7(2003), 1 vom: 28. Nov., Seite 31-42 (DE-627)SPR008001103 nnns volume:7 year:2003 number:1 day:28 month:11 pages:31-42 https://dx.doi.org/10.1007/s10009-003-0115-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 7 2003 1 28 11 31-42 |
| language |
English |
| source |
Enthalten in International Journal on Software Tools for Technology Transfer 7(2003), 1 vom: 28. Nov., Seite 31-42 volume:7 year:2003 number:1 day:28 month:11 pages:31-42 |
| sourceStr |
Enthalten in International Journal on Software Tools for Technology Transfer 7(2003), 1 vom: 28. Nov., Seite 31-42 volume:7 year:2003 number:1 day:28 month:11 pages:31-42 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Semiformal verification Explicit model checking Biologically inspired algorithms |
| isfreeaccess_bool |
false |
| container_title |
International Journal on Software Tools for Technology Transfer |
| authorswithroles_txt_mv |
Jones, Michael D. @@aut@@ Sorber, Jacob @@aut@@ |
| publishDateDaySort_date |
2003-11-28T00:00:00Z |
| hierarchy_top_id |
SPR008001103 |
| id |
SPR008002010 |
| 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">SPR008002010</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124023045.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2003 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-003-0115-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR008002010</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-003-0115-8-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="100" ind1="1" ind2=" "><subfield code="a">Jones, Michael D.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel search for LTL violations</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">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 Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semiformal verification</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Explicit model checking</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Biologically inspired algorithms</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sorber, Jacob</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">International Journal on Software Tools for Technology Transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">7(2003), 1 vom: 28. Nov., Seite 31-42</subfield><subfield code="w">(DE-627)SPR008001103</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2003</subfield><subfield code="g">number:1</subfield><subfield code="g">day:28</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:31-42</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-003-0115-8</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2003</subfield><subfield code="e">1</subfield><subfield code="b">28</subfield><subfield code="c">11</subfield><subfield code="h">31-42</subfield></datafield></record></collection>
|
| author |
Jones, Michael D. |
| spellingShingle |
Jones, Michael D. misc Semiformal verification misc Explicit model checking misc Biologically inspired algorithms Parallel search for LTL violations |
| authorStr |
Jones, Michael D. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR008001103 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Parallel search for LTL violations Semiformal verification (dpeaa)DE-He213 Explicit model checking (dpeaa)DE-He213 Biologically inspired algorithms (dpeaa)DE-He213 |
| topic |
misc Semiformal verification misc Explicit model checking misc Biologically inspired algorithms |
| topic_unstemmed |
misc Semiformal verification misc Explicit model checking misc Biologically inspired algorithms |
| topic_browse |
misc Semiformal verification misc Explicit model checking misc Biologically inspired algorithms |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
International Journal on Software Tools for Technology Transfer |
| hierarchy_parent_id |
SPR008001103 |
| hierarchy_top_title |
International Journal on Software Tools for Technology Transfer |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR008001103 |
| title |
Parallel search for LTL violations |
| ctrlnum |
(DE-627)SPR008002010 (SPR)s10009-003-0115-8-e |
| title_full |
Parallel search for LTL violations |
| author_sort |
Jones, Michael D. |
| journal |
International Journal on Software Tools for Technology Transfer |
| journalStr |
International Journal on Software Tools for Technology Transfer |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2003 |
| contenttype_str_mv |
txt |
| container_start_page |
31 |
| author_browse |
Jones, Michael D. Sorber, Jacob |
| container_volume |
7 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Jones, Michael D. |
| doi_str_mv |
10.1007/s10009-003-0115-8 |
| author2-role |
verfasserin |
| title_sort |
parallel search for ltl violations |
| title_auth |
Parallel search for LTL violations |
| abstract |
Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. |
| abstractGer |
Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. |
| abstract_unstemmed |
Abstract Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
1 |
| title_short |
Parallel search for LTL violations |
| url |
https://dx.doi.org/10.1007/s10009-003-0115-8 |
| remote_bool |
true |
| author2 |
Sorber, Jacob |
| author2Str |
Sorber, Jacob |
| ppnlink |
SPR008001103 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-003-0115-8 |
| up_date |
2024-07-03T16:42:06.354Z |
| _version_ |
1803576857177620480 |
| 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">SPR008002010</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124023045.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2003 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-003-0115-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR008002010</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-003-0115-8-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="100" ind1="1" ind2=" "><subfield code="a">Jones, Michael D.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel search for LTL violations</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">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 Recent advances in parallel model checking for liveness properties achieve significant capacity increases over sequential model checkers. However, the capacity of parallel model checkers is in turn limited by available aggregate memory and network bandwidth. We propose a new parallel algorithm that sacrifices complete coverage for increased capacity to find errors. The algorithm, called BEE (for bee-based error exploration), uses coordinated depth-bounded random walks to reduce memory and bandwidth demands. A unique advantage of BEE is that it is well suited for use on clusters of nondedicated workstations.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semiformal verification</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Explicit model checking</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Biologically inspired algorithms</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sorber, Jacob</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">International Journal on Software Tools for Technology Transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">7(2003), 1 vom: 28. Nov., Seite 31-42</subfield><subfield code="w">(DE-627)SPR008001103</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2003</subfield><subfield code="g">number:1</subfield><subfield code="g">day:28</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:31-42</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-003-0115-8</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2003</subfield><subfield code="e">1</subfield><subfield code="b">28</subfield><subfield code="c">11</subfield><subfield code="h">31-42</subfield></datafield></record></collection>
|
| score |
7.4019556 |