A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits:
Abstract: "Up until now classical logic has been the logic of choice in formal hardware verification. This report advances the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes at the same time. The model-theoretic pro...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1995
|
| Schriftenreihe: | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP
1995,18 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Up until now classical logic has been the logic of choice in formal hardware verification. This report advances the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes at the same time. The model-theoretic properties are exploited to handle the second-order nature of bounded delays in a purely propositional setting without need to introduce explicit time and temporal operators. The proof theoretic properties are exploited to extract quantitative timing information and to reintroduce explicit time in a convenient and systematic way. We present a natural Kripke-style semantics for intuitionistic propositional logic, as a special case of a Kripke constraint model for Propositional Lax Logic (4), in which validity is validity up to stabilization. We show that this semantics is equivalently characterized in terms of stabilization bounds so that implication [superset of] comes out as 'boundedly gives rise to'. An intensional semantics for proofs is presented which allows us effectively to compute quantitative stabilization bounds. We discuss the application of the theory to the timing analysis of combinational circuits. To test our ideas we have implemented an experimental prototype tool and run several simple examples." |
| Beschreibung: | 23, 3 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010529179 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951215s1995 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)36067076 | ||
| 035 | |a (DE-599)BVBBV010529179 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-384 |a DE-91G |a DE-634 | ||
| 084 | |a SS 5600 |0 (DE-625)143571: |2 rvk | ||
| 100 | 1 | |a Mendler, Michael V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits |c M. Mendler |
| 264 | 1 | |a Passau |c 1995 | |
| 300 | |a 23, 3 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |v 1995,18 | |
| 520 | 3 | |a Abstract: "Up until now classical logic has been the logic of choice in formal hardware verification. This report advances the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes at the same time. The model-theoretic properties are exploited to handle the second-order nature of bounded delays in a purely propositional setting without need to introduce explicit time and temporal operators. The proof theoretic properties are exploited to extract quantitative timing information and to reintroduce explicit time in a convenient and systematic way. We present a natural Kripke-style semantics for intuitionistic propositional logic, as a special case of a Kripke constraint model for Propositional Lax Logic (4), in which validity is validity up to stabilization. We show that this semantics is equivalently characterized in terms of stabilization bounds so that implication [superset of] comes out as 'boundedly gives rise to'. An intensional semantics for proofs is presented which allows us effectively to compute quantitative stabilization bounds. We discuss the application of the theory to the timing analysis of combinational circuits. To test our ideas we have implemented an experimental prototype tool and run several simple examples." | |
| 650 | 4 | |a Digital electronics | |
| 650 | 4 | |a Discrete-time systems | |
| 650 | 4 | |a Intuitionistic mathematics | |
| 650 | 4 | |a Proof theory | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Fakultät für Mathematik und Informatik: MIP |t Universität <Passau> |v 1995,18 |w (DE-604)BV000905393 |9 1995,18 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007018177 | ||
Datensatz im Suchindex
| _version_ | 1804124997130649600 |
|---|---|
| any_adam_object | |
| author | Mendler, Michael V. |
| author_facet | Mendler, Michael V. |
| author_role | aut |
| author_sort | Mendler, Michael V. |
| author_variant | m v m mv mvm |
| building | Verbundindex |
| bvnumber | BV010529179 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)36067076 (DE-599)BVBBV010529179 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02892nam a2200421 cb4500</leader><controlfield tag="001">BV010529179</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951215s1995 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36067076</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010529179</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-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 5600</subfield><subfield code="0">(DE-625)143571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mendler, Michael V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits</subfield><subfield code="c">M. Mendler</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23, 3 S.</subfield><subfield code="b">graph. Darst.</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">Universität <Passau> / Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="v">1995,18</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Up until now classical logic has been the logic of choice in formal hardware verification. This report advances the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes at the same time. The model-theoretic properties are exploited to handle the second-order nature of bounded delays in a purely propositional setting without need to introduce explicit time and temporal operators. The proof theoretic properties are exploited to extract quantitative timing information and to reintroduce explicit time in a convenient and systematic way. We present a natural Kripke-style semantics for intuitionistic propositional logic, as a special case of a Kripke constraint model for Propositional Lax Logic (4), in which validity is validity up to stabilization. We show that this semantics is equivalently characterized in terms of stabilization bounds so that implication [superset of] comes out as 'boundedly gives rise to'. An intensional semantics for proofs is presented which allows us effectively to compute quantitative stabilization bounds. We discuss the application of the theory to the timing analysis of combinational circuits. To test our ideas we have implemented an experimental prototype tool and run several simple examples."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Digital electronics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete-time systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intuitionistic mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fakultät für Mathematik und Informatik: MIP</subfield><subfield code="t">Universität <Passau></subfield><subfield code="v">1995,18</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1995,18</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007018177</subfield></datafield></record></collection> |
| id | DE-604.BV010529179 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:54:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007018177 |
| oclc_num | 36067076 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-384 DE-91G DE-BY-TUM DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-384 DE-91G DE-BY-TUM DE-634 |
| physical | 23, 3 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Universität <Passau> / Fakultät für Mathematik und Informatik: MIP |
| spelling | Mendler, Michael V. Verfasser aut A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits M. Mendler Passau 1995 23, 3 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1995,18 Abstract: "Up until now classical logic has been the logic of choice in formal hardware verification. This report advances the application of intuitionistic logic to the timing analysis of digital circuits. The intuitionistic setting serves two purposes at the same time. The model-theoretic properties are exploited to handle the second-order nature of bounded delays in a purely propositional setting without need to introduce explicit time and temporal operators. The proof theoretic properties are exploited to extract quantitative timing information and to reintroduce explicit time in a convenient and systematic way. We present a natural Kripke-style semantics for intuitionistic propositional logic, as a special case of a Kripke constraint model for Propositional Lax Logic (4), in which validity is validity up to stabilization. We show that this semantics is equivalently characterized in terms of stabilization bounds so that implication [superset of] comes out as 'boundedly gives rise to'. An intensional semantics for proofs is presented which allows us effectively to compute quantitative stabilization bounds. We discuss the application of the theory to the timing analysis of combinational circuits. To test our ideas we have implemented an experimental prototype tool and run several simple examples." Digital electronics Discrete-time systems Intuitionistic mathematics Proof theory Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Fakultät für Mathematik und Informatik: MIP Universität <Passau> 1995,18 (DE-604)BV000905393 1995,18 |
| spellingShingle | Mendler, Michael V. A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits Digital electronics Discrete-time systems Intuitionistic mathematics Proof theory Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)4037944-9 |
| title | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits |
| title_auth | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits |
| title_exact_search | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits |
| title_full | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits M. Mendler |
| title_fullStr | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits M. Mendler |
| title_full_unstemmed | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits M. Mendler |
| title_short | A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits |
| title_sort | a timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits |
| topic | Digital electronics Discrete-time systems Intuitionistic mathematics Proof theory Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Digital electronics Discrete-time systems Intuitionistic mathematics Proof theory Theoretische Informatik Informatik Mathematik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT mendlermichaelv atimingrefinementofintuitionisticproofsanditsapplicationtothetiminganalysisofcombinationalcircuits |