{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:14Z","timestamp":1753889894695,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T00:00:00Z","timestamp":1467158400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The reachability analysis of weighted pushdown systems is a very powerful\ntechnique in verification and analysis of recursive programs. Each transition\nrule of a weighted pushdown system is associated with an element of a bounded\nsemiring representing the weight of the rule. However, we have realized that\nthe restriction of the boundedness is too strict and the formulation of\nweighted pushdown systems is not general enough for some applications. To\ngeneralize weighted pushdown systems, we first introduce the notion of stack\nsignatures that summarize the effect of a computation of a pushdown system and\nformulate pushdown systems as automata over the monoid of stack signatures. We\nthen generalize weighted pushdown systems by introducing semirings indexed by\nthe monoid and weaken the boundedness to local boundedness.<\/jats:p>","DOI":"10.2168\/lmcs-12(2:9)2016","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:47:33Z","timestamp":1479736053000},"source":"Crossref","is-referenced-by-count":2,"title":["Weighted Pushdown Systems with Indexed Weight Domains"],"prefix":"10.46298","volume":"Volume 12, Issue 2","author":[{"given":"Yasuhiko","family":"Minamide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2016,6,29]]},"reference":[{"key":"1012:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1641\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1641\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:08:42Z","timestamp":1681243722000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,29]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(2:9)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1603.07790","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1603.07790","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2016,6,29]]},"article-number":"1641"}}