Abstract: A relay provides message filtering services to an e-mail network. The relay monitors incoming communication and intercepts e-mail messages. The relay applies a policy to received messages to determine whether a message should be delayed. The relay applies a policy to delayed messages by reference to a delayed processing event which triggers the delayed processing. The relay updates policy data in accordance by employing an update module. The relay then restricts the delivery of messages having attributes close to those of harmful data as provided by a policy database.

Abstract: A e-mail relay provides message filtering services to an e-mail network. The e-mail relay monitors incoming communication and intercepts messages. The e-mail relay extracts signature data from messages that include signature data. The e-mail relay restricts the delivery of message based on the presence and validity of signature data. The e-mail relay optionally classifies a sender in accordance with a level associated with validated signature data.

Abstract: A e-mail relay provides message filtering services to an e-mail network. The e-mail relay monitors incoming communication and intercepts e-mail messages. The e-mail relay compares attributes of the messages to data derived from SPAM messages, which is stored in a SPAM database. The e-mail relay restricts the delivery of message based on the comparison such as by restricting the delivery of messages having attributes close to those of SPAM messages from the SPAM database. The SPAM database is constructed by responding to user or administrator indications as to whether received messages are SPAM messages.

Abstract: Optimization techniques are implemented by means of a program analyzer used in connection with a program compiler to optimize usage of limited register resources in a computer processor. The first optimization technique, called interprocedural global variable promotion allows the global variables of a program to be accessed in common registers across a plurality of procedures. Moreover, a single common register can be used for different global variables in distinct regions of a program call graph. This is realized by identifying subgraphs, of the program call graph, called webs, where the variable is used. The second optimization technique, called spill code motion, involves the identification of regions of the call graph, called clusters, that facilitate the movement of spill instructions to procedures which are executed relatively less often. This decreases the overhead of register saves and restores which must be executed for procedure calls.

Abstract: Optimization techniques are implemented by means of a program analyzer used in connection with a program compiler to optimize usage of limited register resources in a computer processor. The first optimization technique, called interprocedural global variable promotion allows the global variables of a program to be accessed in common registers across a plurality of procedures. Moreover, a single common register can be used for different global variables in distinct regions of a program call graph. This is realized by identifying subgraphs, of the program call graph, called webs, where the variable is used. The second optimization technique, called spill code motion, involves the identification of regions of the call graph, called clusters, that facilitate the movement of spill instructions to procedures which are executed relatively less often. This decreases the overhead of register saves and restores which must be executed for procedure calls.