Sciweavers

2525 search results - page 438 / 505
» A Framework for Semantic Gossiping
Sort
View
IWAN
1999
Springer
14 years 1 months ago
Policy Specification for Programmable Networks
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...
Morris Sloman, Emil Lupu
IDEAS
1998
IEEE
112views Database» more  IDEAS 1998»
14 years 1 months ago
Transitive Dependencies in Transaction Closures
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. ter...
Kerstin Schwarz, Can Türker, Gunter Saake
SAS
1999
Springer
14 years 1 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
POPL
1998
ACM
14 years 1 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
SIGSOFT
1998
ACM
14 years 1 months ago
Reasoning about Implicit Invocation
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
David Garlan, Somesh Jha, David Notkin