Completion based inductive theorem proving: a case study in verifying sorting algorithms
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Kaiserslautern
Fachber. Informatik, Univ. Kaiserslautern
1990
|
| Schriftenreihe: | Seki-Report
1990,4 |
| Umfang: | 45 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004171446 | ||
| 003 | DE-604 | ||
| 005 | 19901213 | ||
| 007 | t| | ||
| 008 | 901211s1990 xx |||| 00||| undod | ||
| 035 | |a (OCoLC)46087110 | ||
| 035 | |a (DE-599)BVBBV004171446 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Gramlich, Bernhard |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Completion based inductive theorem proving |b a case study in verifying sorting algorithms |
| 264 | 1 | |a Kaiserslautern |b Fachber. Informatik, Univ. Kaiserslautern |c 1990 | |
| 300 | |a 45 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Seki-Report |v 1990,4 | |
| 830 | 0 | |a Seki-Report |v 1990,4 |w (DE-604)BV006186516 |9 1990,4 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-002600732 | |
Datensatz im Suchindex
| _version_ | 1818946401849049088 |
|---|---|
| any_adam_object | |
| author | Gramlich, Bernhard |
| author_facet | Gramlich, Bernhard |
| author_role | aut |
| author_sort | Gramlich, Bernhard |
| author_variant | b g bg |
| building | Verbundindex |
| bvnumber | BV004171446 |
| ctrlnum | (OCoLC)46087110 (DE-599)BVBBV004171446 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00818nam a2200265 cb4500</leader><controlfield tag="001">BV004171446</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19901213 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">901211s1990 xx |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46087110</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004171446</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gramlich, Bernhard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Completion based inductive theorem proving</subfield><subfield code="b">a case study in verifying sorting algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="b">Fachber. Informatik, Univ. Kaiserslautern</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">45 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Seki-Report</subfield><subfield code="v">1990,4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Seki-Report</subfield><subfield code="v">1990,4</subfield><subfield code="w">(DE-604)BV006186516</subfield><subfield code="9">1990,4</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002600732</subfield></datafield></record></collection> |
| id | DE-604.BV004171446 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T08:14:26Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002600732 |
| oclc_num | 46087110 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 45 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | Fachber. Informatik, Univ. Kaiserslautern |
| record_format | marc |
| series | Seki-Report |
| series2 | Seki-Report |
| spelling | Gramlich, Bernhard Verfasser aut Completion based inductive theorem proving a case study in verifying sorting algorithms Kaiserslautern Fachber. Informatik, Univ. Kaiserslautern 1990 45 S. txt rdacontent n rdamedia nc rdacarrier Seki-Report 1990,4 Seki-Report 1990,4 (DE-604)BV006186516 1990,4 |
| spellingShingle | Gramlich, Bernhard Completion based inductive theorem proving a case study in verifying sorting algorithms Seki-Report |
| title | Completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_auth | Completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_exact_search | Completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_full | Completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_fullStr | Completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_full_unstemmed | Completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_short | Completion based inductive theorem proving |
| title_sort | completion based inductive theorem proving a case study in verifying sorting algorithms |
| title_sub | a case study in verifying sorting algorithms |
| volume_link | (DE-604)BV006186516 |
| work_keys_str_mv | AT gramlichbernhard completionbasedinductivetheoremprovingacasestudyinverifyingsortingalgorithms |