Summary
We propose a method for the specification and the automated verification of temporal properties of protocols which regulate the activities of multiagent systems. The set of states of those systems may be infinite so that, in general, the verification of a property of a multiagent system cannot be performed by an exhaustive inspection. We specify a given multiagent system by means of a constraint logic program P with locally stratified negation, and we specify a given temporal property to be verified by means of an atomic formula A. In order to verify that the given temporal property holds, we transform the program P into an equivalent program T such that the fact A ← belongs to T. Our transformation method consists of a set of rules and an automatic strategy that guides the application of the rules. Our method is sound for verifying properties of protocols that are expressible in the CTL logic [5]. Although our method is incomplete for proving properties of infinite state systems, it is able to verify important properties of several protocols which are used in practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. R. Apt and R.N. Bol. Logic programming and negation: A survey. J. Logic Programming, 19,20:9–71, 1994.
R.M. Burstall and J. Darlington. A transformation system for developing recursive pro-grams. JACM, 24(1):44–67, January 1977.
L. Cardelli and A.D. Gordon. Mobile ambients. Theoretical Computer Science, 240(l):177–213,2000.
W. Chen and D.S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1), 1996.
E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
G. Delzanno. Automatic verification of parametrized cache coherence protocol. In Proc. CAV 2000, LNCS 1855, 55–68. Springer, 2000.
G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland (ed.) Proc. TACAS ′99, LNCS 1579, 223–239. Springer, 1999.
S. Etalle and M. Gabbrielli. Transformations of CLP modules. Theoretical Computer Science, 166:101–146, 1996.
F. Fioravanti, A. Pettorossi, and M. Proietti. Verifying CTL properties of infinite state systems by specializing constraint logic programs. R. 544, IASI-CNR, Roma, Italy, 2001.
L. Fribourg and H. Olsén. Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In Proc. CONCUR’ 97, LNCS 1243, 96–107. Springer-Verlag, 1997.
L. Lamport. A new solution of Dijkstra’s concurrent programming problem. CACM, 17(8):453–455, 1974.
M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialization. In Proc. LOPSTR’ 99, LNCS 1817, 63–82. Springer, 1999.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987.
MAP group. The MAP transformation system. Available from: http://www.iasi.rm.cnr.it/~proietti/system.html,1995–2004.
K. Marriott and P. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Part I and II. Information and Computation, 100(1): 1–77, 1992.
U. Nilsson and J. Lübcke. Constraint logic programming for local and symbolic model-checking. In Proc. CL 2000, LNAI 1861, 384–398. Springer, 2000.
Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, and D.S. Warren. Efficient model checking using tabled resolution. In Proc. CAV’ 97, LNCS 1254, 143–154. Springer, 1997.
A. Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan, and S.A. Smolka. Verification of parameterized systems using logic program transformations. In Proc. TACAS 2000, LNCS 1785, 172–187. Springer, 2000.
H. Seki. Unfold/fold transformation of stratified programs. Theoretical Computer Science, 86:107–139, 1991.
H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In S.-Å. Tärnlund (ed.) Proc. 2nd Int. Conf. Logic Programming, 127–138, Uppsala, Sweden, 1984.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fioravanti, F., Pettorossi, A., Proietti, M. (2005). Automatic Proofs of Protocols via Program Transformation. In: Monitoring, Security, and Rescue Techniques in Multiagent Systems. Advances in Soft Computing, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32370-8_7
Download citation
DOI: https://doi.org/10.1007/3-540-32370-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23245-2
Online ISBN: 978-3-540-32370-9
eBook Packages: EngineeringEngineering (R0)