Spelling suggestions: "subject:"eomputer semantics"" "subject:"aomputer semantics""
1 |
Semantic constraints in first order theories : a definition and its applicabilityNoel, P. A. J. January 1988 (has links)
No description available.
|
2 |
Logic grammars and pronominal anaphoraCarvalho, A. M. B. R. January 1989 (has links)
No description available.
|
3 |
Collative semantics : A semantics for natural language processingFass, D. January 1988 (has links)
No description available.
|
4 |
Time, causality, and concurrencyMurphy, David V. J. January 1989 (has links)
No description available.
|
5 |
Type-driven natural language analysisPareschi, Remo January 1988 (has links)
No description available.
|
6 |
Deadlock and deadlock freedomDathi, Naiem January 1989 (has links)
We introduce a number of techniques for establishing the deadlock freedom of concurrent systems. Our methods are based on the local analysis (or at worst a directed global analysis) of networks. We identify the relationships between these techniques and the range of their application within a framework of deadlock freedom types that we have defined. We also show that the problem of proving total correctness may be translated to one of proving deadlock freedom, with the consequence that our techniques for proving deadlock freedom may be utilised to effect a total correctness proof.
|
Page generated in 0.4773 seconds