Verification from declarative specifications using logic programming

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, the declarative programming philosophy has had a visible impact on new emerging disciplines, such as heterogeneous multi-agent systems and flexible business processes. We address the problem of formal verification for systems specified using declarative languages, focusing in particular on the Business Process Management field. We propose a verification method based on the g-SCIFF abductive logic programming proof procedure and evaluate our method empirically, by comparing its performance with that of other verification frameworks. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Montali, M., Torroni, P., Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., & Mello, P. (2009). Verification from declarative specifications using logic programming. In CEUR Workshop Proceedings (Vol. 451, pp. 440–454). CEUR-WS. https://doi.org/10.1007/978-3-540-89982-2_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free