The following relates to application generation and test, and more particularly relates to systems and processes for generating a testing application from a graphical programming language.
Cloud computing-based customer environments are increasingly being used by companies and other organizations. These environments allow the owners to create and host customized environments hosting numerous virtual applications and offering a multitude of services.
Exemplary embodiments will hereinafter be described in conjunction with the following drawing figures, wherein like numerals denote like elements, and
According to various exemplary embodiments, systems and methods are provided to test customer environments for consistency and adherence to rules using a graphically programming language. Accordingly, as discussed in further detail below, a user can create and execute a test application testing any number of applications in a customer environment without having to write any code.
The graphical programming generation system 110 includes an application generator 111. The application generator 111 provides a graphical user interface (GUI) for generating the application. As discussed in further detail below, the application generator 111 and graphical user interface provide an environment for generating an application without having to write any code. The application generator 111 may be used for simple or complex applications depending upon which tools are available and used by a user.
The application generator 111 includes a processor 112 and a memory 113. The processor 112 may be a central processing unit (CPU), a graphics processing unit (GPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a microcontroller, or any other logic unit or any combination thereof. The memory 113 may be any combination of volatile and non-volatile memory. In one embodiment, for example, a portion of the memory 113 may be a cloud-based memory remote from the graphical programming generation system 110 and accessible via a data connection. The memory 113 may include non-transitory instructions for executing the application generator 111 as discussed in further detail below.
In one embodiment, for example, the graphical programming generation system 110 may be a server. In this embodiment, the application generator 111 may itself be a virtual application accessible on the graphical programming generation system 110 via the computing device 130. In another embodiment, the graphical programming generation system 110 may be a computing device such as a desktop computer, a laptop, a cellular phone, a tablet, or the like.
In one embodiment, for example, the graphical programming generation system 110 may include a user interface 114. The user interface 114 may include one or more of a display, a touch screen interface, a mouse, a trackpad, a trackball, a keyboard, voice recognition, or the like, or any combination thereof. The graphical programming generation system 110 may further include a communication system 115. The communication system 115 may utilize any wired or wireless communication systems to exchange data with other components of the graphical programming system 100.
As discussed above, the screen tool 230 allows a user to add one or more screen nodes to their application. Each screen node is a customizable display which allows the application to display information to the user or collect information from the user. In one embodiment, for example, a wizard may be displayed to the user after a node is added to the canvas 210, which walks to user through the process of creating the specific node. In another embodiment, tools, like the tools 220 illustrated in
Returning to
Returning to
The graphical programming test generation system 120 provides a graphical interface which can be used for creating a test and an environment for applying the test to all the virtual applications in the organization 140. The graphical programming test generation system 120 includes a graphical programming test generator 121 which may be used to create the test. The graphical programming test generator 121 include a processor 122 and a memory 123. The processor 122 may be a central processing unit (CPU), a graphics processing unit (GPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a microcontroller, or any other logic unit or any combination thereof. The memory 123 may be any combination of volatile and non-volatile memory. In one embodiment, for example, a portion of the memory 123 may be a cloud-based memory remote from the graphical programming test generation system 120 and accessible via a data connection. The memory 123 may include non-transitory instructions for executing the graphical programming test generator 121 as discussed in further detail below.
While the graphical programming test generation system 120 and the graphical programming generation system 110 are illustrated as separate elements, the respective systems may be a single computing device, such as a server, a personal computer, or the like. Additionally, even if the graphical programming test generation system 120 and the graphical programming generation system 110 are separate systems, they may share resources such as a cloud-based memory.
In one embodiment, for example, the graphical programming test generation system 120 may be a server. In this embodiment, the graphical programming test generator 121 may itself be a virtual application accessible on the graphical programming test generation system 120 via the computing device 130. In another embodiment, the graphical programming test generation system 120 may be a computing device such as a desktop computer, a laptop, a cellular phone, a tablet, or the like.
In one embodiment, for example, the graphical programming test generation system 120 may include a user interface 124. The user interface 124 may include one or more of a display, a touch screen interface, a mouse, a trackpad, a trackball, a keyboard, voice recognition, or the like, or any combination thereof. The graphical programming test generation system 120 may further include a communication system 125. The communication system 125 may utilize any wired or wireless communication systems and may be used to exchange data with any other components of the graphical programming system 100.
The test generated using the graphical programming test generation system 120 is an application or a virtual application, like those created using the graphical programming generation system 110. However, unlike the applications in the organization 140, also known as customer applications, the test applications are marked as tests using a test tool, as discussed in further detail below.
Each tool 530, when added to the canvas 520 adds a node to a test. The test tool 540, when added to the canvas 520, generates a test node which marks the application as a test and adds the test to the organization 140. The graphical programming test generator 121 may generate a wizard and/or other tools to customize the specific test node. For example, the customizable options may include, for example, a frequency that the test is performed. For example, a test may be set up to automatically be performed each time a new application is added to the organization 140 to ensure that the new application meets the requirements set forth in the test. Alternatively, a test could be set up to be performed only upon request by an administrator of the organization. The test may also be run each time a certain application is run. In this embodiment, the test (once completed and added to organization) may be selectable as a tool in the application generator 111 and added to a customer application via a drag and drop operation when the application is created using the graphical programming generation system 110. For example, a user when creating an application may cause an account to be created in the organization. The user can then add a “test account creation” test to the application to ensure the account was created according to the assertion in the “test account creation” test. For example, the test may be set up such that in order for an account to be created a zip code must be collected which is a global requirement throughout the organization 140. Accordingly, by creating a test and adding the test to an organization 140, the creation of an application is simplified as a user can merely add corresponding test(s) to the application rather than having to create decision nodes testing all of the organizations global rules.
Each test application in the organization 140 may test an assertion, an application setting, a database state, or any combination thereof. Each assertion is a rule which is applied to the organization 140. The assertion may test that a variable is true (e.g., that an account is active, a valid zip code was received, etc.), that a variable is false (e.g., a subscription is not expired), that a variable is equal to something (e.g., that a service level agreement is Gold level), that a variable does not equal something (e.g., that a billing state does not equal New York), or the like.
The wizard 800 further includes an interface 820 for naming the assertion node. By giving the assertion node a unique name, the assertion node can be linked to other nodes via the name in the same manner as the variables discussed above.
Once the test application is finished, the graphical programming test generation system 120 converts the nodes of the test application into executable code and adds the test application to the organization 140. In one embodiment, for example, the nodes may be stored as metadata in a database. When the test is run, each node is evaluated and the state of the test is stored in an in-memory journal the journal can be used to later check prior values in an assertion.
Once the test application is complete, as indicated by the author in any of a variety of ways, the processor 122 generates the application by converting the customized nodes into code and adds the test to a corresponding organization 140. (Step 1230). Once the test application is added to the organization 140, the test is available to be added to a customer application as discussed above using the unique name associated with the test application.
As discussed above, the test application may be automatically executed upon a trigger event. Accordingly, the processor 122 or another processor associated with the organization 140 may monitor the organization 140 for triggering events. (Step 1240). The triggering events can include, for example, a new customer application being added to the organization. In this manner, new customer applications added to the organization 140 automatically go through a quality check to ensure that the new customer application meets the standards and requirements of the organization as set though the created test applications. Any number of test applications could automatically be executed upon detection of a trigger. Upon detection of a trigger associated with one or more tests, the processor 122 or another processor associated with the organization executes the test and output any failures detected. (Step 1250). Failures list what test failed as well as the compared values (e.g.: Expected Gold but was Bronze. Additionally, a user defined message can be added. By utilizing continuous testing, the test failure should determine that the most recent change is valid or not. Accordingly, the processor monitoring the organization continuously evaluates the organization for consistency and adherence to the rules set forth in the test applications added to the organization, thereby maintaining the quality of a user's experience with the organization.
The term “exemplary” is used herein to represent one example, instance or illustration that may have any number of alternates. Any implementation described herein as “exemplary” should not necessarily be construed as preferred or advantageous over other implementations.
Although several exemplary embodiments have been presented in the foregoing description, it should be appreciated that a vast number of alternate but equivalent variations exist, and the examples presented herein are not intended to limit the scope, applicability, or configuration of the invention in any way. To the contrary, various changes may be made in the function and arrangement of the various features described herein without departing from the scope of the claims and their legal equivalents.
Number | Name | Date | Kind |
---|---|---|---|
5577188 | Zhu | Nov 1996 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5649104 | Carleton et al. | Jul 1997 | A |
5715450 | Ambrose et al. | Feb 1998 | A |
5761419 | Schwartz et al. | Jun 1998 | A |
5819038 | Carleton et al. | Oct 1998 | A |
5821937 | Tonelli et al. | Oct 1998 | A |
5831610 | Tonelli et al. | Nov 1998 | A |
5873096 | Lim et al. | Feb 1999 | A |
5918159 | Fomukong et al. | Jun 1999 | A |
5963953 | Cram et al. | Oct 1999 | A |
6092083 | Brodersen et al. | Jul 2000 | A |
6161149 | Achacoso et al. | Dec 2000 | A |
6169534 | Raffel et al. | Jan 2001 | B1 |
6178425 | Brodersen et al. | Jan 2001 | B1 |
6189011 | Lim et al. | Feb 2001 | B1 |
6216135 | Brodersen et al. | Apr 2001 | B1 |
6233617 | Rothwein et al. | May 2001 | B1 |
6266669 | Brodersen et al. | Jul 2001 | B1 |
6295530 | Ritchie et al. | Sep 2001 | B1 |
6324568 | Diec et al. | Nov 2001 | B1 |
6324693 | Brodersen et al. | Nov 2001 | B1 |
6336137 | Lee et al. | Jan 2002 | B1 |
D454139 | Feldcamp et al. | Mar 2002 | S |
6367077 | Brodersen et al. | Apr 2002 | B1 |
6393605 | Loomans | May 2002 | B1 |
6405220 | Brodersen et al. | Jun 2002 | B1 |
6434550 | Warner et al. | Aug 2002 | B1 |
6446089 | Brodersen et al. | Sep 2002 | B1 |
6535909 | Rust | Mar 2003 | B1 |
6549908 | Loomans | Apr 2003 | B1 |
6553563 | Ambrose et al. | Apr 2003 | B2 |
6560461 | Fomukong et al. | May 2003 | B1 |
6574635 | Stauber et al. | Jun 2003 | B2 |
6577726 | Huang et al. | Jun 2003 | B1 |
6601087 | Zhu et al. | Jul 2003 | B1 |
6604117 | Lim et al. | Aug 2003 | B2 |
6604128 | Diec | Aug 2003 | B2 |
6609150 | Lee et al. | Aug 2003 | B2 |
6621834 | Scherpbier et al. | Sep 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6665648 | Brodersen et al. | Dec 2003 | B2 |
6665655 | Warner et al. | Dec 2003 | B1 |
6681383 | Pastor | Jan 2004 | B1 |
6684438 | Brodersen et al. | Feb 2004 | B2 |
6711565 | Subramaniam et al. | Mar 2004 | B1 |
6724399 | Katchour et al. | Apr 2004 | B1 |
6728702 | Subramaniam et al. | Apr 2004 | B1 |
6728960 | Loomans et al. | Apr 2004 | B1 |
6732095 | Warshavsky et al. | May 2004 | B1 |
6732100 | Brodersen et al. | May 2004 | B1 |
6732111 | Brodersen et al. | May 2004 | B2 |
6754681 | Brodersen et al. | Jun 2004 | B2 |
6763351 | Subramaniam et al. | Jul 2004 | B1 |
6763501 | Zhu et al. | Jul 2004 | B1 |
6768904 | Kim | Jul 2004 | B2 |
6772229 | Achacoso et al. | Aug 2004 | B1 |
6782383 | Subramaniam et al. | Aug 2004 | B2 |
6804330 | Jones et al. | Oct 2004 | B1 |
6826565 | Ritchie et al. | Nov 2004 | B2 |
6826582 | Chatterjee et al. | Nov 2004 | B1 |
6826745 | Coker | Nov 2004 | B2 |
6829655 | Huang et al. | Dec 2004 | B1 |
6842748 | Warner et al. | Jan 2005 | B1 |
6850895 | Brodersen et al. | Feb 2005 | B2 |
6850949 | Warner et al. | Feb 2005 | B2 |
7062502 | Kesler | Jun 2006 | B1 |
7069231 | Cinarkaya et al. | Jun 2006 | B1 |
7181758 | Chan | Feb 2007 | B1 |
7289976 | Kihneman et al. | Oct 2007 | B2 |
7340411 | Cook | Mar 2008 | B2 |
7356482 | Frankland et al. | Apr 2008 | B2 |
7401094 | Kesler | Jul 2008 | B1 |
7412455 | Dillon | Aug 2008 | B2 |
7508789 | Chan | Mar 2009 | B2 |
7620655 | Larsson et al. | Nov 2009 | B2 |
7698160 | Beaven et al. | Apr 2010 | B2 |
7730478 | Weissman | Jun 2010 | B2 |
7779475 | Jakobson et al. | Aug 2010 | B2 |
8014943 | Jakobson | Sep 2011 | B2 |
8015495 | Achacoso et al. | Sep 2011 | B2 |
8032297 | Jakobson | Oct 2011 | B2 |
8082301 | Ahlgren et al. | Dec 2011 | B2 |
8095413 | Beaven | Jan 2012 | B1 |
8095594 | Beaven et al. | Jan 2012 | B2 |
8209308 | Rueben et al. | Jun 2012 | B2 |
8275836 | Beaven, et al. | Sep 2012 | B2 |
8457545 | Chan | Jun 2013 | B2 |
8484111 | Frankland et al. | Jul 2013 | B2 |
8490025 | Jakobson et al. | Jul 2013 | B2 |
8504945 | Jakobson et al. | Aug 2013 | B2 |
8510045 | Rueben et al. | Aug 2013 | B2 |
8510664 | Rueben et al. | Aug 2013 | B2 |
8566301 | Rueben et al. | Oct 2013 | B2 |
8646103 | Jakobson et al. | Feb 2014 | B2 |
8826084 | Gauf | Sep 2014 | B1 |
20010044791 | Richter et al. | Nov 2001 | A1 |
20020072951 | Lee et al. | Jun 2002 | A1 |
20020082892 | Raffel | Jun 2002 | A1 |
20020129352 | Brodersen et al. | Sep 2002 | A1 |
20020140731 | Subramanian et al. | Oct 2002 | A1 |
20020143997 | Huang et al. | Oct 2002 | A1 |
20020162090 | Parnell et al. | Oct 2002 | A1 |
20020165742 | Robbins | Nov 2002 | A1 |
20030004971 | Gong | Jan 2003 | A1 |
20030018705 | Chen et al. | Jan 2003 | A1 |
20030018830 | Chen et al. | Jan 2003 | A1 |
20030066031 | Laane et al. | Apr 2003 | A1 |
20030066032 | Ramachandran et al. | Apr 2003 | A1 |
20030069936 | Warner et al. | Apr 2003 | A1 |
20030070000 | Coker et al. | Apr 2003 | A1 |
20030070004 | Mukundan et al. | Apr 2003 | A1 |
20030070005 | Mukundan et al. | Apr 2003 | A1 |
20030074418 | Coker et al. | Apr 2003 | A1 |
20030120675 | Stauber et al. | Jun 2003 | A1 |
20030151633 | George et al. | Aug 2003 | A1 |
20030159136 | Huang et al. | Aug 2003 | A1 |
20030187921 | Diec et al. | Oct 2003 | A1 |
20030189600 | Gune et al. | Oct 2003 | A1 |
20030204427 | Gune et al. | Oct 2003 | A1 |
20030206192 | Chen et al. | Nov 2003 | A1 |
20030225730 | Warner et al. | Dec 2003 | A1 |
20040001092 | Rothwein et al. | Jan 2004 | A1 |
20040010489 | Rio et al. | Jan 2004 | A1 |
20040015981 | Coker et al. | Jan 2004 | A1 |
20040027388 | Berg et al. | Feb 2004 | A1 |
20040128001 | Levin et al. | Jul 2004 | A1 |
20040186860 | Lee et al. | Sep 2004 | A1 |
20040193510 | Catahan et al. | Sep 2004 | A1 |
20040199489 | Barnes-Leon et al. | Oct 2004 | A1 |
20040199536 | Barnes-Leon et al. | Oct 2004 | A1 |
20040199543 | Braud et al. | Oct 2004 | A1 |
20040249854 | Barnes-Leon et al. | Dec 2004 | A1 |
20040260534 | Pak et al. | Dec 2004 | A1 |
20040260659 | Chan et al. | Dec 2004 | A1 |
20040268299 | Lei et al. | Dec 2004 | A1 |
20050050555 | Exley et al. | Mar 2005 | A1 |
20050091098 | Brodersen et al. | Apr 2005 | A1 |
20060021019 | Hinton et al. | Jan 2006 | A1 |
20080249972 | Dillon | Oct 2008 | A1 |
20090063414 | White et al. | Mar 2009 | A1 |
20090100342 | Jakobson | Apr 2009 | A1 |
20090177744 | Marlow et al. | Jul 2009 | A1 |
20100169867 | Wegmann | Jul 2010 | A1 |
20110247051 | Bulumulla et al. | Oct 2011 | A1 |
20120042218 | Cinarkaya et al. | Feb 2012 | A1 |
20120218958 | Rangaiah | Aug 2012 | A1 |
20120233137 | Jakobson et al. | Sep 2012 | A1 |
20120304096 | Shikhman | Nov 2012 | A1 |
20130212497 | Zelenko et al. | Aug 2013 | A1 |
20130218948 | Jakobson | Aug 2013 | A1 |
20130218949 | Jakobson | Aug 2013 | A1 |
20130218966 | Jakobson | Aug 2013 | A1 |
20130247216 | Cinarkaya et al. | Sep 2013 | A1 |
20160140023 | Michelsen | May 2016 | A1 |
20180189033 | Narang | Jul 2018 | A1 |
20190087075 | Dhayanithi | Mar 2019 | A1 |
20200133825 | Eidson | Apr 2020 | A1 |
Number | Date | Country | |
---|---|---|---|
20200125483 A1 | Apr 2020 | US |