{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:04:54Z","timestamp":1750478694192,"version":"3.41.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2004,8,12]],"date-time":"2004-08-12T00:00:00Z","timestamp":1092268800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p>The overall goal of this paper is to investigate the theoretical foundations of <jats:italic>algorithmic<\/jats:italic> verification techniques for <jats:italic>first order linear logic<\/jats:italic> specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with <jats:italic>universally quantified goal formulas<\/jats:italic>. Although LO was originally introduced as a theoretical foundation for extensions of <jats:italic>logic programming<\/jats:italic> languages, it can also be viewed as a very general language to specify a wide range of <jats:italic>infinite-state concurrent systems<\/jats:italic> (Andreoli, 1992; Cervesato, 1995). Our approach is based on the relation between <jats:italic>backward reachability<\/jats:italic> and <jats:italic>provability<\/jats:italic> highlighted in our previous work on <jats:italic>propositional<\/jats:italic> LO programs (Bozzano <jats:italic>et al<\/jats:italic>., 2002). Following this line of research, we define here a general framework for the <jats:italic>bottom-up<\/jats:italic>. evaluation of <jats:italic>first order<\/jats:italic> linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings Abdulla <jats:italic>et al<\/jats:italic>., 1996; Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.<\/jats:p>","DOI":"10.1017\/s1471068404002066","type":"journal-article","created":{"date-parts":[[2004,10,14]],"date-time":"2004-10-14T08:31:43Z","timestamp":1097742703000},"page":"573-619","source":"Crossref","is-referenced-by-count":3,"title":["Model checking linear logic specifications"],"prefix":"10.1017","volume":"4","author":[{"given":"MARCO","family":"BOZZANO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIORGIO","family":"DELZANNO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAURIZIO","family":"MARTELLI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2004,8,12]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068404002066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T17:17:07Z","timestamp":1750439827000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068404002066\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,12]]},"references-count":0,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S1471068404002066"],"URL":"https:\/\/doi.org\/10.1017\/s1471068404002066","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2004,8,12]]}}}