@inproceedings{88a59839567c4458a9b1f9fa510d58dc,

title = "A Typical Verification Challenge for the GRID",

abstract = "A typical verification challenge for the GRID community is presented. The concrete challenge is to implement a simple recursive algorithm for finding the strongly connected components in a graph. The graph is typically stored in the collective memory of a number of computers, so a distributed algorithm is necessary. The implementation should be efficient and scalable, and separate synchronization and implementation details from the purely algorithmic aspects. In the end, a framework is envisaged for distributed algorithms on very large graphs. This would be useful to explore various alternative algorithmic choices.",

keywords = "METIS-252106, EWI-14070, Distributed algorithms, IR-65101, Strongly connected components, breadth first search, FMT-MC: MODEL CHECKING",

author = "{van de Pol}, {Jan Cornelis}",

year = "2008",

language = "Undefined",

isbn = "1862-4405",

series = "Dagstuhl Seminar Proceedings",

publisher = "Dagstuhl",

number = "08332",

pages = "--",

editor = "Bal, {H. E.} and L. Brim and M. Leucker",

booktitle = "Dagstuhl Seminar Proceedings 08332 'Distributed Verification and Grid Computing '",

address = "Germany",

note = "null ; Conference date: 01-01-2008",

}