Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal ver...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 337 |
|---|---|
| container_issue | |
| container_start_page | 323 |
| container_title | |
| container_volume | |
| creator | Tardieu, Olivier Edwards, Stephen A. |
| description | Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel ⋆ and use its output to remove dead code. We prove the correctness of our techniques. |
| doi_str_mv | 10.1007/11562948_25 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17199200</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17199200</sourcerecordid><originalsourceid>FETCH-LOGICAL-j285t-1a21ea3a7b2243bc61040cf255ed137daaeaa7ddc04a5f3640a44e32f5aa88f93</originalsourceid><addsrcrecordid>eNpNUD1PwzAUNF8SpXTiD2RhYAj4-SOOB4YqlA-pEhKC2XpJbHBJk8jOQP89rsrAW264u6e7I-QK6C1Qqu4AZMG0KA2TR-SCS0E56EKrYzKDAiDnXOgTstCq3HNMM6rLUzKjnLJcK8HPySLGDU3HoUjmGblfjmMYfvwWJ5u9WWy-sPadn3aZG0L2YLHNqqG12arzW9_j5Ic-8322ipMNtrskZw67aBd_OCcfj6v36jlfvz69VMt1vmGlnHJABhY5qpoxweumACpo45iUtgWuWkSLqNq2oQKl4ykZCmE5cxKxLJ3mc3J9-DtibLBzAfvGRzOGlDvsDCjQqStNupuDLiaq_7TB1MPwHQ1Qs9_P_NuP_wI3cFxJ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Approximate Reachability for Dead Code Elimination in Esterel</title><source>Springer Books</source><creator>Tardieu, Olivier ; Edwards, Stephen A.</creator><contributor>Tsay, Yih-Kuen ; Peled, Doron A.</contributor><creatorcontrib>Tardieu, Olivier ; Edwards, Stephen A. ; Tsay, Yih-Kuen ; Peled, Doron A.</creatorcontrib><description>Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel ⋆ and use its output to remove dead code. We prove the correctness of our techniques.</description><edition>1ère éd</edition><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540292098</identifier><identifier>ISBN: 3540292098</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319697</identifier><identifier>EISBN: 9783540319696</identifier><identifier>DOI: 10.1007/11562948_25</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Abstract Semantic ; Applied sciences ; Computer science; control theory; systems ; Electronic Note ; Exact sciences and technology ; Interface Signal ; Logical Semantic ; Reachability Analysis ; Software ; Software engineering</subject><ispartof>Automated Technology for Verification and Analysis, 2005, p.323-337</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11562948_25$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11562948_25$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4048,4049,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17199200$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Tsay, Yih-Kuen</contributor><contributor>Peled, Doron A.</contributor><creatorcontrib>Tardieu, Olivier</creatorcontrib><creatorcontrib>Edwards, Stephen A.</creatorcontrib><title>Approximate Reachability for Dead Code Elimination in Esterel</title><title>Automated Technology for Verification and Analysis</title><description>Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel ⋆ and use its output to remove dead code. We prove the correctness of our techniques.</description><subject>Abstract Semantic</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Electronic Note</subject><subject>Exact sciences and technology</subject><subject>Interface Signal</subject><subject>Logical Semantic</subject><subject>Reachability Analysis</subject><subject>Software</subject><subject>Software engineering</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540292098</isbn><isbn>3540292098</isbn><isbn>3540319697</isbn><isbn>9783540319696</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNUD1PwzAUNF8SpXTiD2RhYAj4-SOOB4YqlA-pEhKC2XpJbHBJk8jOQP89rsrAW264u6e7I-QK6C1Qqu4AZMG0KA2TR-SCS0E56EKrYzKDAiDnXOgTstCq3HNMM6rLUzKjnLJcK8HPySLGDU3HoUjmGblfjmMYfvwWJ5u9WWy-sPadn3aZG0L2YLHNqqG12arzW9_j5Ic-8322ipMNtrskZw67aBd_OCcfj6v36jlfvz69VMt1vmGlnHJABhY5qpoxweumACpo45iUtgWuWkSLqNq2oQKl4ykZCmE5cxKxLJ3mc3J9-DtibLBzAfvGRzOGlDvsDCjQqStNupuDLiaq_7TB1MPwHQ1Qs9_P_NuP_wI3cFxJ</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Tardieu, Olivier</creator><creator>Edwards, Stephen A.</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Approximate Reachability for Dead Code Elimination in Esterel</title><author>Tardieu, Olivier ; Edwards, Stephen A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j285t-1a21ea3a7b2243bc61040cf255ed137daaeaa7ddc04a5f3640a44e32f5aa88f93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Abstract Semantic</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Electronic Note</topic><topic>Exact sciences and technology</topic><topic>Interface Signal</topic><topic>Logical Semantic</topic><topic>Reachability Analysis</topic><topic>Software</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tardieu, Olivier</creatorcontrib><creatorcontrib>Edwards, Stephen A.</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tardieu, Olivier</au><au>Edwards, Stephen A.</au><au>Tsay, Yih-Kuen</au><au>Peled, Doron A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Approximate Reachability for Dead Code Elimination in Esterel</atitle><btitle>Automated Technology for Verification and Analysis</btitle><date>2005</date><risdate>2005</risdate><spage>323</spage><epage>337</epage><pages>323-337</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540292098</isbn><isbn>3540292098</isbn><eisbn>3540319697</eisbn><eisbn>9783540319696</eisbn><abstract>Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel ⋆ extends Esterel with a non-instantaneous jump instruction (compatible with concurrency, preemption, etc.) so as to enable powerful source-to-source program transformations, amenable to formal verification. In this work, we propose an approximate reachability algorithm for Esterel ⋆ and use its output to remove dead code. We prove the correctness of our techniques.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11562948_25</doi><tpages>15</tpages><edition>1ère éd</edition></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Automated Technology for Verification and Analysis, 2005, p.323-337 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17199200 |
| source | Springer Books |
| subjects | Abstract Semantic Applied sciences Computer science control theory systems Electronic Note Exact sciences and technology Interface Signal Logical Semantic Reachability Analysis Software Software engineering |
| title | Approximate Reachability for Dead Code Elimination in Esterel |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T03%3A23%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Approximate%20Reachability%20for%20Dead%20Code%20Elimination%20in%20Esterel&rft.btitle=Automated%20Technology%20for%20Verification%20and%20Analysis&rft.au=Tardieu,%20Olivier&rft.date=2005&rft.spage=323&rft.epage=337&rft.pages=323-337&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540292098&rft.isbn_list=3540292098&rft_id=info:doi/10.1007/11562948_25&rft_dat=%3Cpascalfrancis_sprin%3E17199200%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319697&rft.eisbn_list=9783540319696&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |