Abstract
An approach for slicing concurrent object-oriented programs was presented to reduce the state space in the process of program verification.The dependencies between statements in the given program were defined,and the method of extracting the slicing criterion from linear temporal logic property was introduced.The satisfaction of the verified Linear Temporal Logic(LTL) property was guaranteed for programs both before and after slicing,and the number of states in the state transition graph decreased.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
