Regularity and quantification: a new approach to verify distributed protocols. Goel, A. & Sakallah, K. A. Innovations in Systems and Software Engineering, 19(4):359-377, December, 2023. ![Regularity and quantification: a new approach to verify distributed protocols [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 13 downloads Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative constructive approach that does not prescribe, a priori, a specific quantifier prefix. Instead, the required prefix is automatically inferred without any enumerative search by carefully analyzing the spatial and temporal regularity of the protocol. The key insight underlying this approach is that structural regularity and quantification are closely related concepts that express protocol invariance under different re-arrangements of its components and its unbounded evolution over time. We extended the finite-domain IC3/PDR algorithm to use these regularities and boost clause learning to automatically derive the required quantified inductive invariant by exploiting the connection between structural regularities and quantification. We also describe a procedure to automatically find a minimal finite size, the cutoff, that yields a quantified invariant proving safety for any size. Our approach is implemented in IC3PO, a new verifier for distributed protocols that significantly outperforms the state of the art, scales orders of magnitude faster, and robustly derives compact inductive invariants fully automatically.
@article{goel2023regularity,
author = {Goel, Aman and Sakallah, Karem A.},
title = {{Regularity and quantification: a new approach to verify distributed protocols}},
journal = {Innovations in Systems and Software Engineering},
volume = {19},
number = {4},
pages = {359-377},
month = {December},
abstract = {Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative constructive approach that does not prescribe, a priori, a specific quantifier prefix. Instead, the required prefix is automatically inferred without any enumerative search by carefully analyzing the spatial and temporal regularity of the protocol. The key insight underlying this approach is that structural regularity and quantification are closely related concepts that express protocol invariance under different re-arrangements of its components and its unbounded evolution over time. We extended the finite-domain IC3/PDR algorithm to use these regularities and boost clause learning to automatically derive the required quantified inductive invariant by exploiting the connection between structural regularities and quantification. We also describe a procedure to automatically find a minimal finite size, the cutoff, that yields a quantified invariant proving safety for any size. Our approach is implemented in IC3PO, a new verifier for distributed protocols that significantly outperforms the state of the art, scales orders of magnitude faster, and robustly derives compact inductive invariants fully automatically.},
year = {2023},
doi = {10.1007/s11334-022-00460-8},
url = {https://doi.org/10.1007/s11334-022-00460-8}
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 2021
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Downloads: 13
{"_id":"eAKBwtan2Q4EN36pc","bibbaseid":"goel-sakallah-regularityandquantificationanewapproachtoverifydistributedprotocols-2023","author_short":["Goel, A.","Sakallah, K. A."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Goel"],"firstnames":["Aman"],"suffixes":[]},{"propositions":[],"lastnames":["Sakallah"],"firstnames":["Karem","A."],"suffixes":[]}],"title":"Regularity and quantification: a new approach to verify distributed protocols","journal":"Innovations in Systems and Software Engineering","volume":"19","number":"4","pages":"359-377","month":"December","abstract":"Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative constructive approach that does not prescribe, a priori, a specific quantifier prefix. Instead, the required prefix is automatically inferred without any enumerative search by carefully analyzing the spatial and temporal regularity of the protocol. The key insight underlying this approach is that structural regularity and quantification are closely related concepts that express protocol invariance under different re-arrangements of its components and its unbounded evolution over time. We extended the finite-domain IC3/PDR algorithm to use these regularities and boost clause learning to automatically derive the required quantified inductive invariant by exploiting the connection between structural regularities and quantification. We also describe a procedure to automatically find a minimal finite size, the cutoff, that yields a quantified invariant proving safety for any size. Our approach is implemented in IC3PO, a new verifier for distributed protocols that significantly outperforms the state of the art, scales orders of magnitude faster, and robustly derives compact inductive invariants fully automatically.","year":"2023","doi":"10.1007/s11334-022-00460-8","url":"https://doi.org/10.1007/s11334-022-00460-8","bibtex":"@article{goel2023regularity,\n author = {Goel, Aman and Sakallah, Karem A.},\n title = {{Regularity and quantification: a new approach to verify distributed protocols}},\n journal = {Innovations in Systems and Software Engineering},\n volume = {19},\n number = {4},\n pages = {359-377},\n month = {December},\n abstract = {Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible instance sizes of the protocol. Existing methods for solving this problem can be described as search procedures for an invariant whose quantification prefix fits a particular template. We propose an alternative constructive approach that does not prescribe, a priori, a specific quantifier prefix. Instead, the required prefix is automatically inferred without any enumerative search by carefully analyzing the spatial and temporal regularity of the protocol. The key insight underlying this approach is that structural regularity and quantification are closely related concepts that express protocol invariance under different re-arrangements of its components and its unbounded evolution over time. We extended the finite-domain IC3/PDR algorithm to use these regularities and boost clause learning to automatically derive the required quantified inductive invariant by exploiting the connection between structural regularities and quantification. We also describe a procedure to automatically find a minimal finite size, the cutoff, that yields a quantified invariant proving safety for any size. Our approach is implemented in IC3PO, a new verifier for distributed protocols that significantly outperforms the state of the art, scales orders of magnitude faster, and robustly derives compact inductive invariants fully automatically.},\n year = {2023},\n doi = {10.1007/s11334-022-00460-8},\n url = {https://doi.org/10.1007/s11334-022-00460-8}\n}\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% 2021\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n","author_short":["Goel, A.","Sakallah, K. A."],"key":"goel2023regularity-1","id":"goel2023regularity-1","bibbaseid":"goel-sakallah-regularityandquantificationanewapproachtoverifydistributedprotocols-2023","role":"author","urls":{"Paper":"https://doi.org/10.1007/s11334-022-00460-8"},"metadata":{"authorlinks":{}},"downloads":13},"bibtype":"article","biburl":"http://web.eecs.umich.edu/~karem/publications/Sakallah-Publications.bib","dataSources":["dAWPbXiJP4ihEN4GZ"],"keywords":[],"search_terms":["regularity","quantification","new","approach","verify","distributed","protocols","goel","sakallah"],"title":"Regularity and quantification: a new approach to verify distributed protocols","year":2023,"downloads":13}