Origin tracking:
Abstract: "In the framework of conditional, not necessarily orthogonal, term rewriting systems, we introduce the notion of an origin. Origins are relations between subterms of intermediate terms which occur during rewriting, and subterms of the initial term. Origin tracking is a method for incr...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,30 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In the framework of conditional, not necessarily orthogonal, term rewriting systems, we introduce the notion of an origin. Origins are relations between subterms of intermediate terms which occur during rewriting, and subterms of the initial term. Origin tracking is a method for incrementally computing origins during rewriting. Origins are a generalization of the well-known concept of residuals (also called descendants). We give a formal definition of origins, and present a method for implementing them. Origin tracking is a highly versatile technique when applied to the prototyping of algebraic specifications of programming languages For example, origin tracking allows program execution to be visualized in a semi-automatic way, given an algebraic specification of the dynamic semantics of the programming language. Furthermore, various notions of breakpoints for generic debuggers can be defined without difficulty. Finally, given a specification of the static semantics of a programming language, origin tracking enables, once an error (such as type- incompatibility) has been detected, to infer the position of the error in the source program automatically. |
| Beschreibung: | 48 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015240 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27824602 | ||
| 035 | |a (DE-599)BVBBV009015240 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Deursen, Arie van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Origin tracking |c A. van Deursen ; P. Klint ; F. Tip |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 48 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 92,30 | |
| 520 | 3 | |a Abstract: "In the framework of conditional, not necessarily orthogonal, term rewriting systems, we introduce the notion of an origin. Origins are relations between subterms of intermediate terms which occur during rewriting, and subterms of the initial term. Origin tracking is a method for incrementally computing origins during rewriting. Origins are a generalization of the well-known concept of residuals (also called descendants). We give a formal definition of origins, and present a method for implementing them. Origin tracking is a highly versatile technique when applied to the prototyping of algebraic specifications of programming languages | |
| 520 | 3 | |a For example, origin tracking allows program execution to be visualized in a semi-automatic way, given an algebraic specification of the dynamic semantics of the programming language. Furthermore, various notions of breakpoints for generic debuggers can be defined without difficulty. Finally, given a specification of the static semantics of a programming language, origin tracking enables, once an error (such as type- incompatibility) has been detected, to infer the position of the error in the source program automatically. | |
| 650 | 4 | |a Debugging in computer science | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Klint, Paul |e Verfasser |4 aut | |
| 700 | 1 | |a Tip, F. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,30 |w (DE-604)BV008928356 |9 92,30 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005960895 | ||
Datensatz im Suchindex
| _version_ | 1804123364525080576 |
|---|---|
| any_adam_object | |
| author | Deursen, Arie van Klint, Paul Tip, F. |
| author_facet | Deursen, Arie van Klint, Paul Tip, F. |
| author_role | aut aut aut |
| author_sort | Deursen, Arie van |
| author_variant | a v d av avd p k pk f t ft |
| building | Verbundindex |
| bvnumber | BV009015240 |
| ctrlnum | (OCoLC)27824602 (DE-599)BVBBV009015240 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02286nam a2200337 cb4500</leader><controlfield tag="001">BV009015240</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27824602</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015240</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Deursen, Arie van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Origin tracking</subfield><subfield code="c">A. van Deursen ; P. Klint ; F. Tip</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">48 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">92,30</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In the framework of conditional, not necessarily orthogonal, term rewriting systems, we introduce the notion of an origin. Origins are relations between subterms of intermediate terms which occur during rewriting, and subterms of the initial term. Origin tracking is a method for incrementally computing origins during rewriting. Origins are a generalization of the well-known concept of residuals (also called descendants). We give a formal definition of origins, and present a method for implementing them. Origin tracking is a highly versatile technique when applied to the prototyping of algebraic specifications of programming languages</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">For example, origin tracking allows program execution to be visualized in a semi-automatic way, given an algebraic specification of the dynamic semantics of the programming language. Furthermore, various notions of breakpoints for generic debuggers can be defined without difficulty. Finally, given a specification of the static semantics of a programming language, origin tracking enables, once an error (such as type- incompatibility) has been detected, to infer the position of the error in the source program automatically.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Debugging in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Klint, Paul</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tip, F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">92,30</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,30</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005960895</subfield></datafield></record></collection> |
| id | DE-604.BV009015240 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005960895 |
| oclc_num | 27824602 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 48 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Deursen, Arie van Verfasser aut Origin tracking A. van Deursen ; P. Klint ; F. Tip Amsterdam 1992 48 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,30 Abstract: "In the framework of conditional, not necessarily orthogonal, term rewriting systems, we introduce the notion of an origin. Origins are relations between subterms of intermediate terms which occur during rewriting, and subterms of the initial term. Origin tracking is a method for incrementally computing origins during rewriting. Origins are a generalization of the well-known concept of residuals (also called descendants). We give a formal definition of origins, and present a method for implementing them. Origin tracking is a highly versatile technique when applied to the prototyping of algebraic specifications of programming languages For example, origin tracking allows program execution to be visualized in a semi-automatic way, given an algebraic specification of the dynamic semantics of the programming language. Furthermore, various notions of breakpoints for generic debuggers can be defined without difficulty. Finally, given a specification of the static semantics of a programming language, origin tracking enables, once an error (such as type- incompatibility) has been detected, to infer the position of the error in the source program automatically. Debugging in computer science Rewriting systems (Computer science) Klint, Paul Verfasser aut Tip, F. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,30 (DE-604)BV008928356 92,30 |
| spellingShingle | Deursen, Arie van Klint, Paul Tip, F. Origin tracking Debugging in computer science Rewriting systems (Computer science) |
| title | Origin tracking |
| title_auth | Origin tracking |
| title_exact_search | Origin tracking |
| title_full | Origin tracking A. van Deursen ; P. Klint ; F. Tip |
| title_fullStr | Origin tracking A. van Deursen ; P. Klint ; F. Tip |
| title_full_unstemmed | Origin tracking A. van Deursen ; P. Klint ; F. Tip |
| title_short | Origin tracking |
| title_sort | origin tracking |
| topic | Debugging in computer science Rewriting systems (Computer science) |
| topic_facet | Debugging in computer science Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT deursenarievan origintracking AT klintpaul origintracking AT tipf origintracking |