Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Edinburgh
1991
|
| Schriftenreihe: | University <Edinburgh>
533 |
| Schlagwörter: | |
| Abstract: | Abstract: "We lay a foundation for using constructive type theory as a tool for combining hardware synthesis and verification. Specifically, we specialize the proofs-as-programs paradigm for the Nuprl constructive type theory to 'proofs-as-circuits', whereby representations of circuits can be automatically synthesized from constructive proofs. We use a limited form of syntactic reflection to guarantee that synthesized objects correspond to circuits; the soundness of the type theory guarantees that these objects meet their stated behavioral specifications. Our approach allows the modular construction of combinational and parameterized combinational circuits in parallel with their proofs of correctness." |
| Umfang: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010453750 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 951030s1991 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)25807935 | ||
| 035 | |a (DE-599)BVBBV010453750 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Basin, David A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Extracting circuits from constructive proofs |
| 264 | 1 | |a Edinburgh |c 1991 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 533 | |
| 520 | 3 | |a Abstract: "We lay a foundation for using constructive type theory as a tool for combining hardware synthesis and verification. Specifically, we specialize the proofs-as-programs paradigm for the Nuprl constructive type theory to 'proofs-as-circuits', whereby representations of circuits can be automatically synthesized from constructive proofs. We use a limited form of syntactic reflection to guarantee that synthesized objects correspond to circuits; the soundness of the type theory guarantees that these objects meet their stated behavioral specifications. Our approach allows the modular construction of combinational and parameterized combinational circuits in parallel with their proofs of correctness." | |
| 650 | 4 | |a Type theory | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 533 |w (DE-604)BV010450646 |9 533 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006966476 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6034-533 |
|---|---|
| DE-BY-TUM_katkey | 663899 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010051044 |
| _version_ | 1821930933983379456 |
| any_adam_object | |
| author | Basin, David A. |
| author_facet | Basin, David A. |
| author_role | aut |
| author_sort | Basin, David A. |
| author_variant | d a b da dab |
| building | Verbundindex |
| bvnumber | BV010453750 |
| ctrlnum | (OCoLC)25807935 (DE-599)BVBBV010453750 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01612nam a2200289 cb4500</leader><controlfield tag="001">BV010453750</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">951030s1991 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25807935</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010453750</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="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Basin, David A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Extracting circuits from constructive proofs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">533</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We lay a foundation for using constructive type theory as a tool for combining hardware synthesis and verification. Specifically, we specialize the proofs-as-programs paradigm for the Nuprl constructive type theory to 'proofs-as-circuits', whereby representations of circuits can be automatically synthesized from constructive proofs. We use a limited form of syntactic reflection to guarantee that synthesized objects correspond to circuits; the soundness of the type theory guarantees that these objects meet their stated behavioral specifications. Our approach allows the modular construction of combinational and parameterized combinational circuits in parallel with their proofs of correctness."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Type theory</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">533</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">533</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006966476</subfield></datafield></record></collection> |
| id | DE-604.BV010453750 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:54:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006966476 |
| oclc_num | 25807935 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spellingShingle | Basin, David A. Extracting circuits from constructive proofs Type theory |
| title | Extracting circuits from constructive proofs |
| title_auth | Extracting circuits from constructive proofs |
| title_exact_search | Extracting circuits from constructive proofs |
| title_full | Extracting circuits from constructive proofs |
| title_fullStr | Extracting circuits from constructive proofs |
| title_full_unstemmed | Extracting circuits from constructive proofs |
| title_short | Extracting circuits from constructive proofs |
| title_sort | extracting circuits from constructive proofs |
| topic | Type theory |
| topic_facet | Type theory |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT basindavida extractingcircuitsfromconstructiveproofs |
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: | 0111 2001 B 6034-533 |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |