Within the last year
Within the past 3 years
1 - 7 of 7 articles
This paper describes a method for building data type specifications that can be proved to be complete and consistent. More, they are abstract and also executable.The method ist based on the type theory developed in 1.
We present three new implementations of semaphores for V7 UNIX. None require kernel modifications. The canonical UNIX semaphore method uses link O in a spin loop. The first new method replaces the canonical spin loop with a software trap mechanism, the second provides additional enhancements in...
It is suggested that facilities for the direct transfer of control upon return from a called subprogram/procedure, similar to (but preferably improving upon) the Alternate RETURN in FORTRAN-77, provide an important tool for the software designer.
A proposal is presented for the generalisation of certain control structures by permitting the (optional) execution of a block of code:(i) at each new cycle in a loop(ii) following termination of a loop(iii)following termination of the "normal" code of a subprogram/procedure.
The processes in a network are categorized according to their functionalities at a given stage in the computation. A simple criterion for total correctness of a set of communicating processes is also given along with a necessary and sufficient condition to prove the absence of deadlock.
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.