1027 search results - page 192 / 206 » Language Support for Connector Abstractions |
CIKM
1993
Springer
14 years 1 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
APWEB
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Information sharing on distributed collaboration usually occurs in broad, highly dynamic network-based environments, and formally accessing the resources in a secure mann...
SIGSOFT
2003
ACM
14 years 9 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
POPL
2005
ACM
14 years 9 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...