Abstract: Techniques are disclosed for limiting execution of software programs. For example, a method comprises the following steps. A first set of program code is extracted from a second set of program code. The extracted first set of program code is parsed to generate a parsed structure. The parsed structure generated from the first set of program code is examined for one or more expressions predetermined to be unsafe for execution. The one or more expressions predetermined to be unsafe for execution that are contained in the first set of program code are detected. In one example, the first set of program code may be a script generated with the JavaScript™ scripting language and the second set of program code may be a business process.

Abstract: Techniques are disclosed for limiting execution of software programs. For example, a method comprises the following steps. A first set of program code is extracted from a second set of program code. The extracted first set of program code is parsed to generate a parsed structure. The parsed structure generated from the first set of program code is examined for one or more expressions predetermined to be unsafe for execution. The one or more expressions predetermined to be unsafe for execution that are contained in the first set of program code are detected. In one example, the first set of program code may be a script generated with the JavaScript™ scripting language and the second set of program code may be a business process.

Abstract: Techniques are disclosed for limiting execution of software programs. For example, a method comprises the following steps. A first set of program code is extracted from a second set of program code. The extracted first set of program code is parsed to generate a parsed structure. The parsed structure generated from the first set of program code is examined for one or more expressions predetermined to be unsafe for execution. The one or more expressions predetermined to be unsafe for execution that are contained in the first set of program code are detected. In one example, the first set of program code may be a script generated with the JavaScript™ scripting language and the second set of program code may be a business process.

Abstract: Techniques are disclosed for limiting execution of software programs. For example, a method comprises the following steps. A first set of program code is extracted from a second set of program code. The extracted first set of program code is parsed to generate a parsed structure. The parsed structure generated from the first set of program code is examined for one or more expressions predetermined to be unsafe for execution. The one or more expressions predetermined to be unsafe for execution that are contained in the first set of program code are detected. In one example, the first set of program code may be a script generated with the JavaScript™ scripting language and the second set of program code may be a business process.

Abstract: A method (and structure) for displaying mapping relationships defined by a plurality of instruction elements, each instruction element providing a relation between zero or more source elements and zero or more result elements, where each source element includes one of a plurality of source elements and each result element includes one of a plurality of result elements, including providing a user a representation including a portion of the mapping relationships and including one or more of the plurality of source elements, the plurality of instruction elements, and the plurality of result elements. The user is provided a method to select one of the elements in the representation. The selected element is highlighted in the representation and the highlighting can be propagated to any other elements related by the mapping that are displayed in the representation.

Abstract: A method (and structure) for enacting changes to a document containing a template-based program that transforms tree-structured data from a first tree-structured data into a second tree-structured data, including providing an interface to permit selection of a document containing the template-based program, constructing a model of the template-based program in the selected document by parsing elements of the template-based program into a corresponding logical construct having a match condition and at least one generator, where the match condition determines whether an element in the first tree-structure data is to be processed by one or more of the at least one generator, and displaying a representation of the model to the user.

Abstract: A method (and structure) for enacting changes to a document containing a template-based program that transforms tree-structured data from a first tree-structured data into a second tree-structured data, including providing an interface to permit selection of a document containing the template-based program, constructing a model of the template-based program in the selected document by parsing elements of the template-based program into a corresponding logical construct having a match condition and at least one generator, where the match condition determines whether an element in the first tree-structure data is to be processed by one or more of the at least one generator, and displaying a representation of the model to the user.

Abstract: A method (and structure) for displaying mapping relationships defined by a plurality of instruction elements, each instruction element providing a relation between zero or more source elements and zero or more result elements, where each source element includes one of a plurality of source elements and each result element includes one of a plurality of result elements, including providing a user a representation including a portion of the mapping relationships and including one or more of the plurality of source elements, the plurality of instruction elements, and the plurality of result elements. The user is provided a method to select one of the elements in the representation. The selected element is highlighted in the representation and the highlighting can be propagated to any other elements related by the mapping that are displayed in the representation.

Abstract: In an exemplary embodiment, a customer, an automobile dealership, a participating financial institution, and a credit bureau may be electronically connected in a system that preferably uses the internet in order to develop and process a legal document comprising a credit application. The system thereby eliminates a paper-based process of credit approval, providing an efficient interaction between businesses and their customer.