Technical Report CS0697

Title: GORMEL - Grammar ORiented ModEL Checker
Authors: R. Marelly and O. Grumberg
PDF - RevisedCS0697.revised.pdf
Abstract: GORMEL is a tool for automatic verification of distributed algorithms based on a method proposed in [SG89]. The algorithm is viewed as an infinite family of finite state programs and is described by means of a {\em network grammar}. Given a grammar and a specification, we first check that the grammar is {\em inductive} and then check the specification on one of the small programs. If a grammar is not inductive, the system provides us with a counter example that indicates how the grammar should be converted to an inductive one. The system has been used to verify several algorithms presented in the literature. We examined topologies like trees, rings, buffers and combinations of the above.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1991
To the main CS technical reports page

Computer science department, Technion