A HOL semantics for a subset of ELLA:
Abstract: "Formal verification is an important tool in the design of computer systems, especially when the systems are safety or security critical. However, the formal techniques currently available are not well integrated into the set of tools more traditionally used by designers. This work is...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1992
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
254 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Formal verification is an important tool in the design of computer systems, especially when the systems are safety or security critical. However, the formal techniques currently available are not well integrated into the set of tools more traditionally used by designers. This work is aimed at improving the integration by providing a formal semantics for a subset of the hardware description language ELLA, and by supporting this semantics in the HOL theorem proving system, which has been used extensively for hardware verification. A semantics for a subset of ELLA is described, and an outline of a proof of the equivalence of parallel and recursive implementations of an n-bit adder is given as an illustration of the semantics The proof has been performed in an extension of the HOL system. Some proof tools written to support the verification are also described. |
| Beschreibung: | 104 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010411742 | ||
| 003 | DE-604 | ||
| 005 | 19960925 | ||
| 007 | t | ||
| 008 | 951006s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)29515673 | ||
| 035 | |a (DE-599)BVBBV010411742 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 360f |2 stub | ||
| 084 | |a DAT 557f |2 stub | ||
| 084 | |a DAT 540f |2 stub | ||
| 100 | 1 | |a Boulton, Richard J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A HOL semantics for a subset of ELLA |
| 264 | 1 | |a Cambridge |c 1992 | |
| 300 | |a 104 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 254 | |
| 520 | 3 | |a Abstract: "Formal verification is an important tool in the design of computer systems, especially when the systems are safety or security critical. However, the formal techniques currently available are not well integrated into the set of tools more traditionally used by designers. This work is aimed at improving the integration by providing a formal semantics for a subset of the hardware description language ELLA, and by supporting this semantics in the HOL theorem proving system, which has been used extensively for hardware verification. A semantics for a subset of ELLA is described, and an outline of a proof of the equivalence of parallel and recursive implementations of an n-bit adder is given as an illustration of the semantics | |
| 520 | 3 | |a The proof has been performed in an extension of the HOL system. Some proof tools written to support the verification are also described. | |
| 650 | 7 | |a Computer hardware |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 254 |w (DE-604)BV004055605 |9 254 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006933662 | ||
Datensatz im Suchindex
| _version_ | 1804124840171405312 |
|---|---|
| any_adam_object | |
| author | Boulton, Richard J. |
| author_facet | Boulton, Richard J. |
| author_role | aut |
| author_sort | Boulton, Richard J. |
| author_variant | r j b rj rjb |
| building | Verbundindex |
| bvnumber | BV010411742 |
| classification_tum | DAT 360f DAT 557f DAT 540f |
| ctrlnum | (OCoLC)29515673 (DE-599)BVBBV010411742 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01897nam a2200349 cb4500</leader><controlfield tag="001">BV010411742</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960925 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29515673</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411742</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="084" ind1=" " ind2=" "><subfield code="a">DAT 360f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 557f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Boulton, Richard J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A HOL semantics for a subset of ELLA</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">104 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">254</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Formal verification is an important tool in the design of computer systems, especially when the systems are safety or security critical. However, the formal techniques currently available are not well integrated into the set of tools more traditionally used by designers. This work is aimed at improving the integration by providing a formal semantics for a subset of the hardware description language ELLA, and by supporting this semantics in the HOL theorem proving system, which has been used extensively for hardware verification. A semantics for a subset of ELLA is described, and an outline of a proof of the equivalence of parallel and recursive implementations of an n-bit adder is given as an illustration of the semantics</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The proof has been performed in an extension of the HOL system. Some proof tools written to support the verification are also described.</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="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">254</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">254</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933662</subfield></datafield></record></collection> |
| id | DE-604.BV010411742 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:03Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933662 |
| oclc_num | 29515673 |
| open_access_boolean | |
| physical | 104 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Boulton, Richard J. Verfasser aut A HOL semantics for a subset of ELLA Cambridge 1992 104 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 254 Abstract: "Formal verification is an important tool in the design of computer systems, especially when the systems are safety or security critical. However, the formal techniques currently available are not well integrated into the set of tools more traditionally used by designers. This work is aimed at improving the integration by providing a formal semantics for a subset of the hardware description language ELLA, and by supporting this semantics in the HOL theorem proving system, which has been used extensively for hardware verification. A semantics for a subset of ELLA is described, and an outline of a proof of the equivalence of parallel and recursive implementations of an n-bit adder is given as an illustration of the semantics The proof has been performed in an extension of the HOL system. Some proof tools written to support the verification are also described. Computer hardware sigle Computer software sigle Automatic theorem proving Computer Laboratory <Cambridge>: Technical report 254 (DE-604)BV004055605 254 |
| spellingShingle | Boulton, Richard J. A HOL semantics for a subset of ELLA Computer Laboratory <Cambridge>: Technical report Computer hardware sigle Computer software sigle Automatic theorem proving |
| title | A HOL semantics for a subset of ELLA |
| title_auth | A HOL semantics for a subset of ELLA |
| title_exact_search | A HOL semantics for a subset of ELLA |
| title_full | A HOL semantics for a subset of ELLA |
| title_fullStr | A HOL semantics for a subset of ELLA |
| title_full_unstemmed | A HOL semantics for a subset of ELLA |
| title_short | A HOL semantics for a subset of ELLA |
| title_sort | a hol semantics for a subset of ella |
| topic | Computer hardware sigle Computer software sigle Automatic theorem proving |
| topic_facet | Computer hardware Computer software Automatic theorem proving |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT boultonrichardj aholsemanticsforasubsetofella |