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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
