Inductively Verifying Invariant Properties of Parameterized Systems

@article{Roychoudhury2004InductivelyVI,
  title={Inductively Verifying Invariant Properties of Parameterized Systems},
  author={Abhik Roychoudhury and I. V. Ramakrishnan},
  journal={Automated Software Engineering},
  year={2004},
  volume={11},
  pages={101-139}
}
Verification of distributed algorithms can be naturally cast as verifying parameterized systems, the parameter being the number of processes. In general, a parameterized concurrent system represents an infinite family (of finite state systems) parameterized by a recursively defined type such as chains, trees. It is therefore natural to verify parameterized systems by inducting over this type. However, construction of such proofs require combination of model checking with deductive capability… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS