A verification algorithm for Declarative Concurrent Programming

Details A verification algorithm for Declarative Concurrent Programming A verification algorithm for Declarative Concurrent Programming

2006-06-22

arxiv.org/abs/cs/0606095v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

A verification method for distributed systems based on decoupling forward and backward behaviour is proposed. This method uses an event structure based algorithm that, given a CCS process, constructs its causal compression relative to a choice of observable actions. Verifying the original process equipped with distributed backtracking on non-observable actions, is equivalent to verifying its relative compression which in general is much smaller. We call this method Declarative Concurrent Programming (DCP). DCP technique compares well with direct bisimulation based methods. Benchmarks for the classic dining philosophers problem show that causal compression is rather efficient both time- and space-wise. State of the art verification tools can successfully handle more than 15 agents, whereas they can handle no more than 5 following the traditional direct method; an altogether spectacular improvement, since in this example the specification size is exponential in the number of agents.

Affiliated with

Also associated with

No associations

Rating

A verification algorithm for Declarative Concurrent Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A verification algorithm for Declarative Concurrent Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A verification algorithm for Declarative Concurrent Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208415