Abductive Logic Programming as an Effective Technology for the Static Verification of Declarative Business Processes

  • Authors:

  • Marco Montali;Paolo Torroni;Federico Chesani;Paola Mello;Marco Alberti;Evelina Lamma

  • Affiliations:

  • (Correspd.) DEIS, University of Bologna - V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it;DEIS, University of Bologna - V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it;DEIS, University of Bologna - V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it;DEIS, University of Bologna - V.le Risorgimento 2, 40136 Bologna, Italy. {marco.montali,paolo.torroni,federico.chesani,paola.mello}@unibo.it;CENTRIA, Universidade Nova de Lisboa - Quinta da Torre, 2829-516 Caparica, Portugal. m.alberti@fct.unl.pt;ENDIF, University of Ferrara - V. Saragat 1, 44100 Ferrara, Italy. evelina.lamma@unife.it

  • Venue:
  • Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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’s 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.