Skip to main content
Article thumbnail
Location of Repository

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

By M. Montali, P. Torroni, F. Chesani, P. Mello, M. Alberti and E. Lamma

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

Topics: Computational Logic, Abduction, Specification, Verification
Year: 2010
DOI identifier: 10.3233/FI-2010-310
OAI identifier: oai:iris.unife.it:11392/1378612
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/11392/13... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.