Article Free Access Share on Using router stamping to identify the source of IP packets Authors: Thomas W. Doeppner Brown University Brown UniversityView Profile , Philip N. Klein Brown University Brown UniversityView Profile , Andrew Koyfman Oracle Corporation Oracle CorporationView Profile Authors Info & Claims CCS '00: Proceedings of the 7th ACM conference on Computer and Communications SecurityNovember 2000 Pages 184–189https://doi.org/10.1145/352600.352627Published:01 November 2000Publication History 47citation993DownloadsMetricsTotal Citations47Total Downloads993Last 12 Months37Last 6 weeks11 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

In this paper we discuss our approach to a formal description of the UNIX operating system [Rit78a] [Rit78b] [Tho78], using Milner's Calculus of Communicating Systems (CCS) [Mil80].

We develop a theory for the correctness of asynchronous parallel programs. A program is considered correct if its behavior is in some sense similar to that of an abstract version of the program. We discuss various criteria for this similarity. We then concentrate on one of them and develop a technique for showing that a parallel program is correct with respect to this criterion.

We discuss a parallel program model that allows a very general synchronization mechanism with a scheduler to control the progress of processes “undergoing synchronization.” We how to “abstract” the program, i.e. remove the scheduler, resulting in a simpler program. We then show that, for a large class of schedulers, a process can become deadlocked in the original program iff it can become deadlocked in the abstracted program.