Cited By
View all- Féral NGiorgetti A(2023)A Gentle Introduction to Verification of Parameterized Reactive SystemsFormal Methods Teaching10.1007/978-3-031-27534-0_3(34-50)Online publication date: 23-Feb-2023
A uniform deductive approach for parameterized protocol safety
Abstract
We present a uniform verification method of safety properties for classes of parameterized protocols. Properties like mutual exclusion or cache coherence are automatically verified for any number of similar processes communicating by broadcast and rendezvous. The protocols are specified in a language of generalized substitutions on array data structures. Sets of states are expressed by first-order formulae with equality. Predecessors are computed by an iterative semi-algorithm. Reaching an initial state or the fixpoint is shown to be decidable and an original decision procedure is provided. As a running example, the MESI protocol illustrates this approach. Experimental results show its applicability to various properties and protocol classes.
References
[1]
K. Baukus, Y. Lakhnech, and K. Stahl. Verification of Parameterized Protocols. Journal of Universal Computer Science, 7(2):141--158, 2001.]]
[2]
J.-F. Couchot and A. Giorgetti. Analyse d'atteignabilité déductive. In Congrés Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'04, pages 269--283, 2004.]]
[3]
G. Delzanno and T. Bultan. Constraint-based verification of client-server protocols. In Proc. of the 7th Int. Conf. on Principles and Practice of Constraint Programming (CP'01), volume 2239 of LNCS, pages 286--301. Springer, 2001.]]
[4]
G. Delzanno, J. Esparza, and A. Podelski. Constraint-based analysis of broadcast protocols. In CSL, pages 50--66, 1999.]]
[5]
G. Delzanno and A. Podelski. Constraint-based deductive model checking. Int. Journal on Software Tools for Technology Transfer, 3(3):250--270, 2001.]]
[6]
P. Fontaine and E. P. Gribomont. Decidability of invariant validation for parameterized systems. In Proc. 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), volume 2619 of LNCS, pages 97--112. Springer, 2003.]]
[7]
S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Computer Aided Verification, 9th Int. Conf. (CAV'97), volume 1254 of LNCS, pages 72--83. Springer, 1997.]]
[8]
Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Computer Aided Verification, 9th Int. Conf. (CAV'97), volume 1254 of LNCS, pages 424--435. Springer, 1997.]]
[9]
T. Rybina and A. Voronkov. A logical reconstruction of reachability. In Perspectives of System Informatics, volume 2890 of LNCS, pages 222--237. Springer, 2003.]]
Recommendations
A Deductive Approach to Program Synthesis
Program synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task ...
Comments
Information & Contributors
Information
Published In
November 2005
482 pages
ISBN:1581139934
DOI:10.1145/1101908
- General Chair:
- David Redmiles,
- Program Chairs:
- Tom Ellman,
- Andrea Zisman
Copyright © 2005 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 November 2005
Check for updates
Author Tags
Qualifiers
- Article
Conference
ASE05: International Conference on Automated Software Engineering 2005
November 7 - 11, 2005
CA, Long Beach, USA
Acceptance Rates
Overall Acceptance Rate 82 of 337 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 122Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
Cited By
View all- Féral NGiorgetti A(2023)A Gentle Introduction to Verification of Parameterized Reactive SystemsFormal Methods Teaching10.1007/978-3-031-27534-0_3(34-50)Online publication date: 23-Feb-2023
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in