Fast: A Transducer-Based Language for Tree Manipulation

Fast: A Transducer-Based Language for Tree Manipulation

Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on programming languages and systems 2015-10, Vol.38 (1), p.1-32, Article 1
Hauptverfasser: D'antoni, Loris, Veanes, Margus, Livshits, Benjamin, Molnar, David
Format: Artikel
Sprache:eng
Schlagworte:
Alphabets
Applications programs
Equivalence
Formalism
Logic
Mathematical analysis
Models of computation
Programming languages
Theory of computation
Transducers
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 32
container_issue 1
container_start_page 1
container_title ACM transactions on programming languages and systems
container_volume 38
creator D'antoni, Loris
Veanes, Margus
Livshits, Benjamin
Molnar, David
description Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametric theories. Admitting infinite alphabets makes these models more general and succinct than their classic counterparts. Despite this, we show how the main operations, such as composition and language equivalence, remain computable given a decision procedure for the alphabet theory. We introduce a high-level language called Fast that acts as a front-end for the preceding formalisms.
doi_str_mv 10.1145/2791292
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1793248095</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1793248095</sourcerecordid><originalsourceid>FETCH-LOGICAL-a239t-e5dc792ab44330abcd714c38690921e01bcba5f6facca4219a66fb35a276bde13</originalsourceid><addsrcrecordid>eNo9z81KAzEUBeAgFRyruPcFdBPNzX-WUqwKBTftOtxkEqjMODWZLnx7R6a6OovzceAQcgPsAUCqR24ccMfPSANKWSqVEwvSMNCSMsfVBbms9YMxBlbZhizWWMcrcp6xq-n6lEuyWz9vV6908_7ytnraUOTCjTSpNhrHMUgpBMMQWwMyCqvdNAyJQYgBVdYZY0TJwaHWOQiF3OjQJhBLcj_vHsrwdUx19P2-xtR1-JmGY_VgnODSMqcmejfTWIZaS8r-UPY9lm8PzP_-9Kefk7ydJcb-H_2VP_HhSgg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1793248095</pqid></control><display><type>article</type><title>Fast: A Transducer-Based Language for Tree Manipulation</title><source>Business Source Complete</source><source>ACM Digital Library Complete</source><creator>D'antoni, Loris ; Veanes, Margus ; Livshits, Benjamin ; Molnar, David</creator><creatorcontrib>D'antoni, Loris ; Veanes, Margus ; Livshits, Benjamin ; Molnar, David</creatorcontrib><description>Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametric theories. Admitting infinite alphabets makes these models more general and succinct than their classic counterparts. Despite this, we show how the main operations, such as composition and language equivalence, remain computable given a decision procedure for the alphabet theory. We introduce a high-level language called Fast that acts as a front-end for the preceding formalisms.</description><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/2791292</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Alphabets ; Applications programs ; Equivalence ; Formalism ; Logic ; Mathematical analysis ; Models of computation ; Programming languages ; Theory of computation ; Transducers ; Trees</subject><ispartof>ACM transactions on programming languages and systems, 2015-10, Vol.38 (1), p.1-32, Article 1</ispartof><rights>ACM</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-a239t-e5dc792ab44330abcd714c38690921e01bcba5f6facca4219a66fb35a276bde13</cites><orcidid>0000-0001-9625-4037</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/2791292$$EPDF$$P50$$Gacm$$Hfree_for_read</linktopdf><link.rule.ids>314,777,781,2276,27905,27906,40177,75977</link.rule.ids></links><search><creatorcontrib>D'antoni, Loris</creatorcontrib><creatorcontrib>Veanes, Margus</creatorcontrib><creatorcontrib>Livshits, Benjamin</creatorcontrib><creatorcontrib>Molnar, David</creatorcontrib><title>Fast: A Transducer-Based Language for Tree Manipulation</title><title>ACM transactions on programming languages and systems</title><addtitle>ACM TOPLAS</addtitle><description>Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametric theories. Admitting infinite alphabets makes these models more general and succinct than their classic counterparts. Despite this, we show how the main operations, such as composition and language equivalence, remain computable given a decision procedure for the alphabet theory. We introduce a high-level language called Fast that acts as a front-end for the preceding formalisms.</description><subject>Alphabets</subject><subject>Applications programs</subject><subject>Equivalence</subject><subject>Formalism</subject><subject>Logic</subject><subject>Mathematical analysis</subject><subject>Models of computation</subject><subject>Programming languages</subject><subject>Theory of computation</subject><subject>Transducers</subject><subject>Trees</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNo9z81KAzEUBeAgFRyruPcFdBPNzX-WUqwKBTftOtxkEqjMODWZLnx7R6a6OovzceAQcgPsAUCqR24ccMfPSANKWSqVEwvSMNCSMsfVBbms9YMxBlbZhizWWMcrcp6xq-n6lEuyWz9vV6908_7ytnraUOTCjTSpNhrHMUgpBMMQWwMyCqvdNAyJQYgBVdYZY0TJwaHWOQiF3OjQJhBLcj_vHsrwdUx19P2-xtR1-JmGY_VgnODSMqcmejfTWIZaS8r-UPY9lm8PzP_-9Kefk7ydJcb-H_2VP_HhSgg</recordid><startdate>20151001</startdate><enddate>20151001</enddate><creator>D'antoni, Loris</creator><creator>Veanes, Margus</creator><creator>Livshits, Benjamin</creator><creator>Molnar, David</creator><general>ACM</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-9625-4037</orcidid></search><sort><creationdate>20151001</creationdate><title>Fast</title><author>D'antoni, Loris ; Veanes, Margus ; Livshits, Benjamin ; Molnar, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a239t-e5dc792ab44330abcd714c38690921e01bcba5f6facca4219a66fb35a276bde13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Alphabets</topic><topic>Applications programs</topic><topic>Equivalence</topic><topic>Formalism</topic><topic>Logic</topic><topic>Mathematical analysis</topic><topic>Models of computation</topic><topic>Programming languages</topic><topic>Theory of computation</topic><topic>Transducers</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>D'antoni, Loris</creatorcontrib><creatorcontrib>Veanes, Margus</creatorcontrib><creatorcontrib>Livshits, Benjamin</creatorcontrib><creatorcontrib>Molnar, David</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on programming languages and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>D'antoni, Loris</au><au>Veanes, Margus</au><au>Livshits, Benjamin</au><au>Molnar, David</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast: A Transducer-Based Language for Tree Manipulation</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><stitle>ACM TOPLAS</stitle><date>2015-10-01</date><risdate>2015</risdate><volume>38</volume><issue>1</issue><spage>1</spage><epage>32</epage><pages>1-32</pages><artnum>1</artnum><issn>0164-0925</issn><eissn>1558-4593</eissn><abstract>Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametric theories. Admitting infinite alphabets makes these models more general and succinct than their classic counterparts. Despite this, we show how the main operations, such as composition and language equivalence, remain computable given a decision procedure for the alphabet theory. We introduce a high-level language called Fast that acts as a front-end for the preceding formalisms.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/2791292</doi><tpages>32</tpages><orcidid>https://orcid.org/0000-0001-9625-4037</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0164-0925
ispartof ACM transactions on programming languages and systems, 2015-10, Vol.38 (1), p.1-32, Article 1
issn 0164-0925
1558-4593
language eng
recordid cdi_proquest_miscellaneous_1793248095
source Business Source Complete; ACM Digital Library Complete
subjects Alphabets
Applications programs
Equivalence
Formalism
Logic
Mathematical analysis
Models of computation
Programming languages
Theory of computation
Transducers
Trees
title Fast: A Transducer-Based Language for Tree Manipulation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T22%3A18%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast:%20A%20Transducer-Based%20Language%20for%20Tree%20Manipulation&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=D'antoni,%20Loris&rft.date=2015-10-01&rft.volume=38&rft.issue=1&rft.spage=1&rft.epage=32&rft.pages=1-32&rft.artnum=1&rft.issn=0164-0925&rft.eissn=1558-4593&rft_id=info:doi/10.1145/2791292&rft_dat=%3Cproquest_cross%3E1793248095%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1793248095&rft_id=info:pmid/&rfr_iscdi=true