Constraint-based automatic verification of abstract models of multithreaded programs

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in Theory and Practice of Logic Programming

Scientific paper

We present a technique for the automated verification of abstract models of multithreaded programs providing fresh name generation, name mobility, and unbounded control. As high level specification language we adopt here an extension of communication finite-state machines with local variables ranging over an infinite name domain, called TDL programs. Communication machines have been proved very effective for representing communication protocols as well as for representing abstractions of multithreaded software. The verification method that we propose is based on the encoding of TDL programs into a low level language based on multiset rewriting and constraints that can be viewed as an extension of Petri Nets. By means of this encoding, the symbolic verification procedure developed for the low level language in our previous work can now be applied to TDL programs. Furthermore, the encoding allows us to isolate a decidable class of verification problems for TDL programs that still provide fresh name generation, name mobility, and unbounded control. Our syntactic restrictions are in fact defined on the internal structure of threads: In order to obtain a complete and terminating method, threads are only allowed to have at most one local variable (ranging over an infinite domain of names).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Constraint-based automatic verification of abstract models of multithreaded 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 Constraint-based automatic verification of abstract models of multithreaded programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint-based automatic verification of abstract models of multithreaded programs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-214234

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.