Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems
Saved in:
| Published in | Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3385412.3385979 |
Cover
| BookMark | eNotjztPwzAYRT3AUApzV_-BFD_zGFFVHlKlLjCi6HNtt5YcJ4odSPj1NJDp6F7pXuncoZvQBoPQhpItpUI-cl5KQdl2ZlVUK_S5H-GUMASNoev6dnQNJIMbky6tjti2Pb62Xy6c8RB6A979gHLepQm3FscpJBiz8-C00X_pYqKL80R508R7dGvBR_OwcI0-nvfvu9fscHx52z0dMmB5mTJ6klIK4IIbpYzkOZQFE7qkYChXHKpcE6aspoJZIkGTgpKKWMah1FYIwdeI_P8OoYPpG7yvu_5q0k81JfVsXi_m9WLOfwEcR1Ug |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3385412.3385979 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/3385412.3385979 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-1c5554a343ebbe536a8724d81ae13b3a96d02bfd142f05ad071090f23a8df4443 |
| IEDL.DBID | UNPAY |
| IngestDate | Sun Oct 26 04:12:27 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-1c5554a343ebbe536a8724d81ae13b3a96d02bfd142f05ad071090f23a8df4443 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3385412.3385979 |
| ParticipantIDs | unpaywall_primary_10_1145_3385412_3385979 |
| PublicationTitle | Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation |
| Score | 1.9218352 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems |
| URI | https://dl.acm.org/doi/pdf/10.1145/3385412.3385979 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5zO4gXFScqKjl48dDZ5kebHkU2huDYwcE8SHltEh3ObtgWN_960zROES-eQiCE8F4e-ZK873sIXSifaqbiyONSmwuKBPAEZNQToazjkkXSMuTuRuFwwm6nfNpC5IsLI-dmnlf7hV_H9FJqJ2jLr8xlirOA9Oo2juIt1Am5wd9t1JmMxtcPTrfnj5E7aLvKl7B-h_n8x-Ex2G0IfYXVHKxzRl56VZn2so9fioz_W9ce6n6T9fB4cwzto5bKD9BjfwVZiSGX2KqGr2YGmSrc1IsusEGq2D0m4MpsILDJXXWa7BovNC7WeQkr76maSSVt71kVswK76jNFF00G_fuboecqKXhAQlF6QcYNbADKqEpTxWkIIiJMigBUQFMKcSh9kmrjHqJ9DrLGHbGvCQUhNWOMHqJ2vsjVEcJEkijjAdV-FjHBSRz5tnxPZhzLhdbH6HJj7GTZKGYkDfuZJ85UiTPVyT_GnqJ2-VapMwMByvTc-fwTcWevgg |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5zO4gXFScqKjl48dDZ5kebHkU2huDYwcE8SHltEh3ObtgWN_960zROES-eQiCE8F4e-ZK873sIXSifaqbiyONSmwuKBPAEZNQToazjkkXSMuTuRuFwwm6nfNpC5IsLI-dmnlf7hV_H9FJqJ2jLr8xlirOA9Oo2juIt1Am5wd9t1JmMxtcPTrfnj5E7aLvKl7B-h_n8x-Ex2G0IfYXVHKxzRl56VZn2so9fioz_W9ce6n6T9fB4cwzto5bKD9BjfwVZiSGX2KqGr2YGmSrc1IsusEGq2D0m4MpsILDJXXWa7BovNC7WeQkr76maSSVt71kVswK76jNFF00G_fuboecqKXhAQlF6QcYNbADKqEpTxWkIIiJMigBUQFMKcSh9kmrjHqJ9DrLGHbGvCQUhNWOMHqJ2vsjVEcJEkijjAdV-FjHBSRz5tnxPZhzLhdbH6HJj7GTZKGYkDfuZJ85UiTPVyT_GnqJ2-VapMwMByvTc-fwTcWevgg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+41st+ACM+SIGPLAN+Conference+on+Programming+Language+Design+and+Implementation&rft.atitle=Exact+and+approximate+methods+for+proving+unrealizability+of+syntax-guided+synthesis+problems&rft_id=info:doi/10.1145%2F3385412.3385979&rft.externalDocID=10.1145%2F3385412.3385979 |