Universal data-driven computer proxy

• US 8,713,544 B1
• Filed: 11/25/2003
• Issued: 04/29/2014
• Est. Priority Date: 11/25/2003
• Status: Expired due to Fees

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: Symantec Corporation (NortonLifeLock Inc.)
• Inventors: McCorkendale, Bruce, Nachenberg, Carey, Sulton, Jeffrey
• Primary Examiner(s): Dam, Tuan Q.
• Assistant Examiner(s): Wei, Zheng
• Application Number:
  US10/722,949
• Time in Patent Office: 3,808 Days
• Field of Search: None
• US Class Current: 717/143
• CPC Class Codes: H04L 67/56 Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 69/03 Protocol definition or specification protocol conformance testing H04L1/244

Abstract

Methods, apparati, and computer-readable media for updating proxy executable code. An apparatus embodiment of the present invention comprises generic universal proxy executable code that can be instantiated multiple times, with each instance being driven by a different set of files comprising a protocol specification file and a proxy activity code file, to control protocol decomposition and proxy functions, respectively. In a method embodiment of the present invention, a protocol specification is created or updated; proxy activity code, separate from the protocol specification, is created or updated; and the proxy executable code is executed using the protocol specification and the proxy activity code.

Claims

1. A computer program product having a non-transitory computer-readable storage medium having executable computer program instructions embodied therein for implementing a generic reusable computer proxy, the computer program product comprising computer program instructions for:

identifying a protocol specification associated with a given protocol, the protocol specification including non-executable data facilitating decomposition of the protocol, the non-executable data comprising information identifying a plurality of points in the protocol specification at which to execute proxy activity code;

identifying proxy activity code comprising a plurality of elements configured to perform defined features of the protocol;

identifying a protocol-code association specifying, for the identified points in the protocol specification, corresponding ones of the elements of the proxy activity code to invoke; and

instantiating at runtime the generic reusable computer proxy that invokes the specified elements of the proxy activity code at the corresponding identified points during decomposition of the protocol.

2. The computer program product of claim 1 wherein the protocol specification consists solely of the non-executable data and does not contain any executable code.

3. The computer program product of claim 1 wherein the proxy activity code consists solely of non-executable data and does not contain any executable code.

4. The computer program product of claim 1 wherein the protocol specification and the proxy activity code are updated independently of each other and independently of execution of the proxy.

5. The computer program product of claim 1 wherein the proxy activity code is written in a scripting language.

6. The computer program product of claim 1 wherein the protocol specification is generated by a protocol specification compiler.

7. The computer program product of claim 6 wherein an input to the protocol specification compiler is a protocol specification in a grammatical form.

8. The computer program product of claim 7 wherein the grammatical form is a grammar from the group of grammars comprising Backus-Naur Form (BNF), Extended Backus-Naur Form (EBNF), Augmented Backus-Naur Form (ABNF), natural language, regular expression, and a grammar understood by a software parser tool Lcx, Yacc, Gold, or Spirit.

9. The computer program product of claim 1 wherein the generic reusable computer proxy invokes the specified elements of the proxy activity code at the appropriate points of the decomposition of the protocol to provide a secure treatment of the protocol.

10. The computer program product of claim 1, the computer program product further comprising computer program instructions for:

identifying second proxy activity code configured to perform defined features of the protocol, the second proxy activity code performing different activities than the first proxy activity code;

wherein the protocol-code association additionally specifies, for the identified points in the protocol specification, elements of the second proxy activity code to invoke.

11. The computer program product of claim 1, wherein the protocol specification is a data file that represents a grammar defining the protocol.

12. A computer-implemented method for implementing a generic reusable computer proxy, said method comprising the steps of:

identifying a protocol specification associated with a given protocol, the protocol specification including non-executable data facilitating decomposition of the protocol, the non-executable data comprising information identifying a plurality of points in the protocol specification at which to execute proxy executable code;

identifying proxy activity code comprising a plurality of elements configured to perform defined features of the protocol;

identifying a protocol-code association specifying, for the identified points in the protocol specification, corresponding ones of the elements of the proxy activity code to invoke; and

instantiating at runtime the generic reusable computer proxy that invokes the specified elements of the proxy activity code at the corresponding identified points during decomposition of the protocol.

13. The method of claim 12 wherein the protocol-code association consists solely of non-executable data and does not contain any executable code.

14. The method of claim 12 wherein the protocol specification and the proxy activity code are updated independently of each other and independently of execution of the proxy.

15. The method of claim 12 wherein the proxy activity code is written in a scripting language.

16. The method of claim 12 wherein the protocol specification is generated by a protocol specification compiler.

17. The method of claim 16 wherein an input to the protocol specification compiler is a protocol specification in a grammatical form.

18. The method of claim 17 wherein the grammatical form is a grammar from the group of grammars comprising Backus-Naur Form (BNF), Extended Backus-Naur Form (EBNF), Augmented Backus-Naur Form (ABNF), natural language, regular expression, and a grammar understood by a software parser tool.

19. The method of claim 12 wherein the computer proxy invokes the specified elements of the proxy activity code at the appropriate points of the decomposition of the protocol to provide a secure treatment of the protocol.

20. A computer system comprising:

a computer processor; and

a computer program product having a computer-readable storage medium having computer program instructions executable by the computer processor embodied therein for implementing a generic reusable computer proxy, the computer program product comprising computer program instructions for;

identifying a protocol specification associated with a given protocol, the protocol specification including non-executable data facilitating decomposition of the protocol, the non-executable data comprising information identifying a plurality of points in the protocol specification at which to execute proxy activity code;

identifying proxy activity code comprising a plurality of elements configured to perform defined features of the protocol;

identifying a protocol-code association specifying, for the identified points in the protocol specification, corresponding ones of the elements of the proxy activity code to invoke; and

instantiating at runtime the generic reusable computer proxy that invokes the specified elements of the proxy activity code at the corresponding identified points during decomposition of the protocol.

21. The computer system of claim 20 wherein the protocol specification consists solely of the non-executable data and does not contain any executable code.

22. The computer system of claim 20 wherein the proxy activity code consists solely of non-executable data and does not contain any executable code.

23. The computer system of claim 20 wherein the protocol specification and the proxy activity code are updated independently of each other and independently of execution of the proxy.

24. The computer system of claim 20 wherein the protocol specification is generated by a protocol specification compiler, and wherein an input to the protocol specification compiler is a protocol specification in a grammatical form.

25. The computer system of claim 24 wherein the grammatical form is a grammar from the group of grammars comprising Backus-Naur Form (BNF), Extended Backus-Naur Form (EBNF), Augmented Backus-Naur Form (ABNF), natural language, regular expression, and a grammar understood by a software parser tool.

26. The computer system of claim 20, wherein the generic reusable computer proxy invokes the specified elements of the proxy activity code at the appropriate points of the decomposition of the protocol to provide a secure treatment of the protocol.