Within the last year
Within the past 3 years
1 - 8 of 8 articles
The rules of deduction which are usually used for many-sorted equational logic in computer science, for example in the study of abstract data types, are not sound. Correcting these rules by introducing explicit quantifiers yields a system which, although it is sound, is not complete; some new...
This paper presents a language construct for subprogram specification. This construct offers increased clarity with an insignificant overhead in compilation time.
Functional rather than structural approach to conversion of a two-exit loop into a while loop is presented. The functions computed by the corresponding exits are formally specified and their union is analyzed to reveal the cause of its loop nonrealizability. The latter is removed by either...
Language constructs for definition and use of abstract data types ease the design and maintenance of large programs. This paper describes the C class concept, an extension to the C language providing such constructs. A class is defined using standard C data types and functions, and it can itself...
The simplicity and intelligent design of the Pascal language has allowed us to develop an in-house compiler testing facility to validate the quality of Pascal compilers for use on production systems. Our facility includes several packages of compiler test programs, and also provides tools and...
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.
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
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.