The HOL verification of ELLA designs:
Abstract: "HOL is a public domain system for generating proofs in higher order predicate calculus. It has been in experimental and commercial use in several countries for a number of years. ELLA is a hardware design language developed at the Royal Signals and Radar Establishment (RSRE) and mark...
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Cambridge
1990
|
Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
199 |
Schlagworte: | |
Zusammenfassung: | Abstract: "HOL is a public domain system for generating proofs in higher order predicate calculus. It has been in experimental and commercial use in several countries for a number of years. ELLA is a hardware design language developed at the Royal Signals and Radar Establishment (RSRE) and marketed by Praxis. It supports simulation models at a variety of different abstraction levels. A preliminary methodology for reasoning about ELLA designs using HOL is described. Our approach is to semantically embed a subset of the ELLA language in higher order logic, and then to make this embedding convenient to use with parsers and pretty-printers There are a number of semantic issues that may impact on the ease of verification. We discuss some of these briefly. We also give a simple example to illustrate the methodology. |
Beschreibung: | 22 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010411334 | ||
003 | DE-604 | ||
005 | 19960119 | ||
007 | t | ||
008 | 951006s1990 |||| 00||| engod | ||
035 | |a (OCoLC)24313738 | ||
035 | |a (DE-599)BVBBV010411334 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
245 | 1 | 0 | |a The HOL verification of ELLA designs |c by Richard Boulton ... |
264 | 1 | |a Cambridge |c 1990 | |
300 | |a 22 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 199 | |
520 | 3 | |a Abstract: "HOL is a public domain system for generating proofs in higher order predicate calculus. It has been in experimental and commercial use in several countries for a number of years. ELLA is a hardware design language developed at the Royal Signals and Radar Establishment (RSRE) and marketed by Praxis. It supports simulation models at a variety of different abstraction levels. A preliminary methodology for reasoning about ELLA designs using HOL is described. Our approach is to semantically embed a subset of the ELLA language in higher order logic, and then to make this embedding convenient to use with parsers and pretty-printers | |
520 | 3 | |a There are a number of semantic issues that may impact on the ease of verification. We discuss some of these briefly. We also give a simple example to illustrate the methodology. | |
650 | 7 | |a Computer hardware |2 sigle | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Information theory |2 sigle | |
650 | 4 | |a Computer programs |x Verification | |
650 | 4 | |a Logic programming | |
700 | 1 | |a Boulton, Richard |e Sonstige |4 oth | |
830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 199 |w (DE-604)BV004055605 |9 199 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006933294 |
Datensatz im Suchindex
_version_ | 1804124839625097216 |
---|---|
any_adam_object | |
building | Verbundindex |
bvnumber | BV010411334 |
ctrlnum | (OCoLC)24313738 (DE-599)BVBBV010411334 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01847nam a2200337 cb4500</leader><controlfield tag="001">BV010411334</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960119 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24313738</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411334</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="245" ind1="1" ind2="0"><subfield code="a">The HOL verification of ELLA designs</subfield><subfield code="c">by Richard Boulton ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">199</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "HOL is a public domain system for generating proofs in higher order predicate calculus. It has been in experimental and commercial use in several countries for a number of years. ELLA is a hardware design language developed at the Royal Signals and Radar Establishment (RSRE) and marketed by Praxis. It supports simulation models at a variety of different abstraction levels. A preliminary methodology for reasoning about ELLA designs using HOL is described. Our approach is to semantically embed a subset of the ELLA language in higher order logic, and then to make this embedding convenient to use with parsers and pretty-printers</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">There are a number of semantic issues that may impact on the ease of verification. We discuss some of these briefly. We also give a simple example to illustrate the methodology.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer hardware</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield><subfield code="x">Verification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boulton, Richard</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">199</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">199</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933294</subfield></datafield></record></collection> |
id | DE-604.BV010411334 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:52:03Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933294 |
oclc_num | 24313738 |
open_access_boolean | |
physical | 22 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series | Computer Laboratory <Cambridge>: Technical report |
series2 | Computer Laboratory <Cambridge>: Technical report |
spelling | The HOL verification of ELLA designs by Richard Boulton ... Cambridge 1990 22 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 199 Abstract: "HOL is a public domain system for generating proofs in higher order predicate calculus. It has been in experimental and commercial use in several countries for a number of years. ELLA is a hardware design language developed at the Royal Signals and Radar Establishment (RSRE) and marketed by Praxis. It supports simulation models at a variety of different abstraction levels. A preliminary methodology for reasoning about ELLA designs using HOL is described. Our approach is to semantically embed a subset of the ELLA language in higher order logic, and then to make this embedding convenient to use with parsers and pretty-printers There are a number of semantic issues that may impact on the ease of verification. We discuss some of these briefly. We also give a simple example to illustrate the methodology. Computer hardware sigle Computer software sigle Information theory sigle Computer programs Verification Logic programming Boulton, Richard Sonstige oth Computer Laboratory <Cambridge>: Technical report 199 (DE-604)BV004055605 199 |
spellingShingle | The HOL verification of ELLA designs Computer Laboratory <Cambridge>: Technical report Computer hardware sigle Computer software sigle Information theory sigle Computer programs Verification Logic programming |
title | The HOL verification of ELLA designs |
title_auth | The HOL verification of ELLA designs |
title_exact_search | The HOL verification of ELLA designs |
title_full | The HOL verification of ELLA designs by Richard Boulton ... |
title_fullStr | The HOL verification of ELLA designs by Richard Boulton ... |
title_full_unstemmed | The HOL verification of ELLA designs by Richard Boulton ... |
title_short | The HOL verification of ELLA designs |
title_sort | the hol verification of ella designs |
topic | Computer hardware sigle Computer software sigle Information theory sigle Computer programs Verification Logic programming |
topic_facet | Computer hardware Computer software Information theory Computer programs Verification Logic programming |
volume_link | (DE-604)BV004055605 |
work_keys_str_mv | AT boultonrichard theholverificationofelladesigns |