Abstract
An approach allowing one to simplify assertional reasoning on concurrent programs is presented. In the adopted assertional framework, to verify such properties as partial correctness, mutual exclusion, or deadlock freedom, the inductive assertions method is applied to a labelled transition systems representing a program, where concurrency is modelled by action interleavings. In order to tackle the problem of state explosion a notion of reduction of the transition system representing a verified program is introduced, where some transitions and configurations that arise from nonessential interleavings of actions are ignored. To isolate nonessential interleavings, the trace equivalence, in the sense of Mazurkiewicz, is exploited. Decidability of verifying whether a given labelled transition system is a reduction is investigated.
Part of the work presented here is included in author's PhD thesis. This research was supported in part by University of Gdańsk grant BW 5100-5-0091-2 and by CRIT IC 1010/II
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
I.J. Aalbersberg, H.J. Hoogeboom, Decision problems for regular trace languages, in: Proceedings ICALP 87, pp. 250–259, LNCS 267, 1987.
I.J. Aalbersberg, G. Rozenberg, Theory of traces, Theoretical Computer Science 60, pp. 1–82 (1988).
K.R. Apt, N. Francez, W.P. de Roever, A proof system for communicating sequential processes, ACM TOPLAS 2(3), pp. 359–384 (1980).
A. Bertoni, G. Mauri, N. Sabadini, Equivalence and membership problems for regular trace languages, in: LNCS 140, pp. 61–71, 1982.
E.W. Dijkstra, A correctness proof for communicating processes — A small exercise, in: Selected writings on Computing: A Personal Perspective. Springer-Verlag, 1982.
R. W. Floyd, Assigning meanings to programs, in: Mathematical Aspects of Computer Science. (J.T. Schwartz, Ed.), pp. 19–32, Proceedings Symposium in Applied Mathematics, vol. 19, American Math. Soc., Providence, 1967.
P. Godefroid, Using partial orders to improve automatic verification methods, in: Proc. Workshop on Computer Aided Verification, Rutgers, 1990.
P. Godefroid, P. Wolper, A partial approach to model checking in: Proceedings of the 6th LICS, pp. 406–415, 1991.
P. Godefroid, P. Wolper, Using partial orders for the efficient verification of deadlock freedom and safety properties, in: Proc. Workshop on Computer Aided Verification, 1991.
A. Mazurkiewicz, Trace semantics, in: Advances in Petri Nets 1986, Part II, pp. 279–324, LNCS 255, 1987.
P. Pączkowski, Proving termination of communicating programs, in: Proceedings CONCUR'90, pp. 416–426, LNCS 458, 1990.
P. Pączkowski, Annotated Transition Systems for Verifying Concurrent Programs, PhD Thesis, CST-78–91 University of Edinburgh, 1991.
P. Pączkowski, Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs, Preprint No. 90, Institute of Mathematics, University of Gdańsk, 1993.
A. Valmari, M. Clegg, Reduced labelled transition systems save verification effort, in: Proceedings of CONCUR'91, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paczkowski, P. (1993). Ignoring nonessential interleavings in assertional reasoning on concurrent programs. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_51
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive