{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:58:02Z","timestamp":1759683482442,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"3-4","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2010,8]]},"abstract":"<jats:p>We discuss the static verification of declarative Business Processes. We identify four desiderata about verifiers, and propose a concrete framework which satisfies them. The framework is based on the ConDec graphical notation for modeling Business Processes, and on Abductive Logic Programming technology for verification of properties. Empirical evidence shows that our verification method seems to perform and scale better, in most cases, than other state of the art techniques (model checkers, in particular). A detailed study of our framework\u2019s theoretical properties proves that our approach is sound and complete when applied to ConDec models that do not contain loops, and it is guaranteed to terminate when applied to models that contain loops.<\/jats:p>","DOI":"10.3233\/fi-2010-310","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T04:14:26Z","timestamp":1575346466000},"page":"325-361","source":"Crossref","is-referenced-by-count":11,"title":["Abductive Logic Programming as an Effective Technology for the Static Verification of Declarative Business Processes"],"prefix":"10.1177","volume":"102","author":[{"given":"Marco","family":"Montali","sequence":"first","affiliation":[{"name":"DEIS, University of Bologna \u2013 V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it"}]},{"given":"Paolo","family":"Torroni","sequence":"additional","affiliation":[{"name":"DEIS, University of Bologna \u2013 V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it"}]},{"given":"Federico","family":"Chesani","sequence":"additional","affiliation":[{"name":"DEIS, University of Bologna \u2013 V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it"}]},{"given":"Paola","family":"Mello","sequence":"additional","affiliation":[{"name":"DEIS, University of Bologna \u2013 V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it"}]},{"given":"Marco","family":"Alberti","sequence":"additional","affiliation":[{"name":"CENTRIA, Universidade Nova de Lisboa \u2013 Quinta da Torre, 2829-516 Caparica, Portugal. m.alberti@fct.unl.pt"}]},{"given":"Evelina","family":"Lamma","sequence":"additional","affiliation":[{"name":"ENDIF, University of Ferrara \u2013 V. Saragat 1, 44100 Ferrara, Italy. evelina.lamma@unife.it"}]}],"member":"179","published-online":{"date-parts":[[2010,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-310","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:49:57Z","timestamp":1751366997000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2010-310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":0,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["10.3233\/FI-2010-310"],"URL":"https:\/\/doi.org\/10.3233\/fi-2010-310","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}