Proving correctness of Timed Concurrent Constraint Programs

Details Proving correctness of Timed Concurrent Constraint Programs Proving correctness of Timed Concurrent Constraint Programs

2002-08-28

arxiv.org/abs/cs/0208042v1

Computer Science

Logic in Computer Science

Scientific paper

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs. These modalities provide an assumption/commitment style of specification which allows a sound and complete compositional axiomatization of the reactive behavior of timed concurrent constraint programs.

Affiliated with

Also associated with

No associations

Rating

Proving correctness of Timed Concurrent Constraint Programs 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 Proving correctness of Timed Concurrent Constraint Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proving correctness of Timed Concurrent Constraint Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-283562