Abstract: A process for testing a program includes: receiving a variable comprising a plurality of input values; producing a plurality of equivalence classes for the input values; producing a representative value per equivalence class; producing, by a processor, a primary covering array comprising a plurality of primary vectors; producing a secondary covering array comprising a plurality of secondary vectors; providing the secondary vectors to the program; and producing a result vector comprising a plurality of result entries to test the program. A computer system for testing the program includes: a memory; and a processor, in communication with the memory, wherein the computer system is configured to perform the process for testing the program. A computer program product for testing the program includes: a non-transitory computer readable storage medium readable by a processor and storing program code for execution by the processor to perform the process.

Abstract: Computer source code maintenance represents a significant aspect of computer systems. Code that was developed for one platform, in one language, may require a significant investment in human effort to port such code to another platform or language. Converting source code to a language-agnostic source code allows a user to view the interaction of various portions of the source code in a unified view. Additionally, the language-agnostic source code may be automatically regenerated by a processor to a different platform or language. As a further benefit, documentation, standards-compliance, security, and/or other non-functional requirements may be provided to further enhance the utility of the original source code.

Abstract: A method, computer program product, and apparatus for buffering data sets are provided. The method includes preparing at least one buffer including a plurality of compression windows. The method also includes receiving a data set. The method further includes writing the received data set into a data region in a first compression window among the plurality of compression windows included in a first buffer among the at least one buffer. The method also includes updating statistics of a statistics region in the first compression window based on the received data set. The method further includes compressing the data set from the data region of the first compression window based on the statistics in the statistics region of the first compression window. The method also includes sending the compressed data set to the data region of the first compression window to replace the received data set.

Abstract: At least some aspects of the present disclosure feature systems and methods for obfuscating data. The method includes the steps of receiving or retrieve an input data stream including a sequence of n-grams, mapping at least some of the sequence of n-grams to corresponding tokens using an obfuscation table, and disposing the corresponding tokens to an output data stream.

Abstract: In a recurring revenue management system, a first unit of data and a second unit of data is received. Content is extracted from the first unit of data and the second unit of data based on one or more parameters of a predefined data object that is part of an asset data model. The extracted content is added to an instance of the predefined data object, and a reference tag with identification information for its associated content is associated with the content extracted from each of the first unit of data and the second unit of data. A duplicate data condition can be detected and resolved by applying a predefined approach to conflict resolution based on the identification information in the reference tags of the content of the first unit of data and the second unit of data. Related methods, systems, and computer program products are also described.

Abstract: Method and system for detecting an unknown undesirable event, such as (but not limited to) a cyber-threat, a cyber-intrusion, a financial fraud event or a monitored process malfunction of breakdown. An exemplary method embodiment comprises obtaining a dataset comprising a plurality n of multidimensional data points with a dimension m?2 wherein each data point is a vector of m features, processing the MDPs using measure-based diffusion maps to embed the MDPs into a lower dimension embedded space, and detecting in the embedded space an abnormal MDP without relying on a signature of a threat, the abnormal MDP being indicative of the unknown undesirable event.

Abstract: A method comprising: carrying out optimization of an item of software in a first intermediate representation; carrying out protection of the item of software in a second intermediate representation different to the first intermediate representation.

Abstract: Methods and systems to convert a scalar computer program loop having loop-carried dependences into a vector computer program loop are disclosed. One such method includes, at runtime, identifying, by executing an instruction with one or more processors, a first loop iteration that cannot be executed in parallel with a second loop iteration due to a set of conflicting scalar loop operations. The first loop iteration is executed after the second loop iteration. The method also includes sectioning, by executing an instruction with one or more processors, a vector loop into vector partitions including a first vector partition. The first vector partition executes consecutive loop iterations in parallel and the consecutive loop iterations start at the second loop iteration and end before the first loop iteration.

Abstract: A method and system generates sufficient sample data sets for efficiently and accurately testing a new calculation for preparing a portion of an electronic document for users of an electronic document preparation system. The method and system prepares the new calculation and gathers historical user data related to previously prepared electronic documents for a large number of historical users. The method and system generates a representative value for each historical user data, based on the sections of a previous version of electronic document preparation software which were executed for each historical user in preparing electronic documents for the historical users. The method and system groups the historical users based on the hash values which indicates the historical user's behavior in the software. The groups are then sampled by selecting a small number of historical users from each group.

Abstract: A method of generating a behavioral model of a computer system. A processor partitions a system log of process events into a plurality of strands sharing common characteristics. The processor selects attributes from the strands and generates first distinct n-grams that include attributes from successive events within a strand. The processor generates a first plurality of n-gram groups, each including a plurality of the first distinct n-grams in which a first one of the plurality of first distinct n-grams coexists in a strand also containing a second one of the plurality of first distinct n-grams. The processor generates a first plurality of n-gram group arrangements, each containing a plurality of n-gram groups, and each of the n-gram groups included, in combination, in at least one strand, and the behavioral model containing the first distinct n-grams, the first plurality of n-gram groups, and the first plurality of n-gram group arrangements.

Abstract: Systems and methods of searching for related data sets are provided. Multivariate data sets can be input as queries into a data set search engine. According to one embodiment, the input data set is automatically reduced to a set of best fit data models of minimum complexity that represent the data set. The data model is then compared to other data models to not only identify similarity between the models, but also to identify the particulars of why the data models are related. Similar data model results can be analyzed to determine the quality of each returned data model based on an information scores. These results can be displayed graphically as a topographical map of nodes and edge. Each node can represent a data model and each edge can reflect the similarity between the nodes.

Abstract: An apparatus, apparatus and computer-readable medium for generating an alternative implementation of a program on one or more engines, including receiving a job graph comprising a sequence of jobs corresponding to the program, translating each job into a set of candidate translations corresponding to that job based on one or more available engines, storing each set of candidate translations corresponding to each job in the job graph in a region of a job hypergraph, condensing the job hypergraph into an alternative job graph by iteratively replacing each pair of connected regions with a merged region comprising a merged candidate translation generated by combining a pair of candidate translations in that pair of connected regions, and generating the alternative implementation of the program based at least in part on the alternative job graph.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler determines and indicates, in the program code, that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: A query is parsed and positions of symbols of the query are determined. A parse tree including the positions of the symbols is generated based on the parsed query. The parse tree is sent to a DBMS optimizer. The parse tree is transformed into an optimizer tree. The optimizer tree includes the positions of the symbols of the query. Based on the optimizer tree, a query execution plan is generated for the execution of the query. The positions of the symbols of the query is copied from the optimizer tree into the query execution plan. The query execution plan is sent to a query execution engine. The query is executed in accordance with the query execution plan. When a runtime error is detected, an exception message associated with the runtime error is displayed. The error message includes an error code and the positions of the symbols of the query.

Abstract: A method for points-to program analysis includes extracting a kernel from a program, performing a fixed object sensitive points to analysis of the kernel to obtain fixed analysis results, and assigning, for a first candidate object in the kernel, a first context depth to the first candidate object. The candidate objects are identified using the fixed analysis results. The method further includes assigning, for a second candidate object, a second context depth to the second candidate object. The second context depth is different than the first context depth. The method further includes performing, to obtain selective analysis results, a selective object sensitive points to analysis using the first context depth for the first candidate object and the second context depth for the second candidate object, and performing an action based on the selective analysis results.

Abstract: A method for processing software layout can include exporting layout setting information from design elements of a software; formatting the layout setting information, and storing it in a layout characteristic file; and importing the layout setting information in the layout characteristic file into design elements of another software. Layout information of each language can be stored in a customizable layout characteristic file.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler determines and indicates, in the program code, that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module or comparisons against function pointers. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: A code testing system determines mistyped identifiers in computer language code. For identifiers of objects in the code, such as variables and functions, the instances of the identifiers are identified in the code and recorded in an occurrence table. Uses of an identifier may be identified as copies of one another based on a hash value of the instance and its location in a function. Hash values for an identifier that are not unique may not be recorded in the instance table. For identifiers that are associated with a single occurrence or a single group of copies, these identifiers are identified as candidates for correction. Suggested corrections are determined based on a comparison with other identifiers in the occurrence table to determine similar identifiers in the occurrence table. If so, the candidate identifier may be identified as likely mistyped and the similar identifier is suggested as a correction.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler determines and indicates, in the program code, that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: Systems and methods relate to creating applications using building blocks linked together with metadata. A user interface can enable a user to create an application. Creating the application can include defining a new building block configured to generate output data. The new building block can include one or more existing building blocks and the metadata associated with the existing building blocks. For example, a building block can include at least one input/output (I/O) feature configured to receive inputs and/or generate outputs. Further, the existing building block can correspond to a data structure including external I/O features. The new building block can be linked to an existing building block by mapping an external I/O feature of the existing building block to an open I/O feature of the new building block. The mapping can be stored in metadata associated with the new building block.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to determine and indicate in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to determine and indicate in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module or comparisons against function pointers. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: Examples of the present disclosure provide apparatuses and methods for target architecture determination. An example method comprises receiving an indication of a type of target architecture in a portion of source code and creating compiled code for the type of target architecture based on the indication.

Abstract: A method for partial redundancy elimination with a fixed number of temporaries includes determining local data values of program code that describe a temporary memory location, a set of registers, and a set of basic blocks. The method determines global data values of the program code based on the determined local data values of the program code. The method removes a first load of the temporary memory location in a first basic block in the program code. The method adds a second load on a first edge from a second basic block out of the set of basic blocks to a third basic block out of the set of basic blocks in the program code. The method performs a register move on a second edge from the third basic block to the second basic block in the program code.

Abstract: Embodiments of the present invention provide a method, system and computer program product for multi-flavored software execution from a singular code base. In an embodiment of the invention, a method for multi-flavored software execution from a singular code base is provided. The method includes receiving a request in an interpreter to interpret a version of source code of a computer program the interpreting transforming the source code into byte code executable by a virtual machine. The method thereafter includes responding to the request by performing in the interpreter source code interpretation only of selected portions of the source code being annotated by tags corresponding to the version.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to determine and indicate in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to determine and indicate in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to determine and indicate in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module, e.g. local-use-only. A linker or loader can read the indication the compiler made in the program code. The linker or loader use the local entry point associated with the target function if the target function is defined in the same module as the reference and is local-use-only.

Abstract: Various systems and methods provide an intuitive user interface that enables automatic specification of queries and constraints for analysis by ML component. Various implementations provide methodologies for automatically formulating machine learning (“ML”) and optimization queries. The automatic generation of ML and/or optimization queries can be configured to use examples to facilitate formulation of ML and optimization queries. One example method includes accepting input data specifying variables and data values associated with the variables. Within the input data any unspecified data records are identified, and a relationship between the variables specified in the input data and a variable associated with the at least one unspecified data record is automatically determined. The relationship can be automatically determined based on training data contained within the input data. Once a relationship is established a ML problem can be automatically generated.

Abstract: Apparatus, systems, and methods for a compiler are described. One such compiler converts source code into an automaton comprising states and transitions between the states, wherein the states in the automaton include a special purpose state that corresponds to a special purpose hardware element. The compiler converts the automaton into a netlist, and places and routes the netlist to provide machine code for configuring a target device.

Abstract: Method and system for detecting an unknown undesirable event, such as (but not limited to) a cyber-threat, a cyber-intrusion, a financial fraud event or a monitored process malfunction of breakdown. An exemplary method embodiment comprises obtaining a dataset comprising a plurality n of multidimensional data points with a dimension m?2 wherein each data point is a vector of m features, processing the MDPs using measure-based diffusion maps to embed the MDPs into a lower dimension embedded space, and detecting in the embedded space an abnormal MDP without relying on a signature of a threat, the abnormal MDP being indicative of the unknown undesirable event.

Abstract: The invention presents a self-optimizing deployment scheme and device for indoor small cell. Based on time division multiplexing access (TDMA) resource assignment, an adaptive neural fuzzy inference system (ANFIS) based self-optimizing deployment cascade control (SODCC) device is proposed for indoor small cell to enable easy installation, multi-user (MU) service reliability, optimum throughput, power saving, minimum interference and good cell coverage. The proposed SODCC device is designed with a cascade architecture, which mainly contains an ANFIS based initial power setting controller (IPSC) in the first unit, an ANFIS based channel quality index (CQI) decision controller (CQIDC) in the second unit and an ANFIS based self-optimizing power controller (SOPC) in the third unit. In addition, a protection mechanism of the self-optimizing power controller is included in the SODCC device to prevent the co-channel interference from the moving users of adjacent cells.

Abstract: A disclosed method processes a data feed including multiple streams. The method includes processing n frames of the multiple streams in parallel through n processing pipelines, n being an integer greater than or equal to 2. The n frames include a first frame belonging to a first stream and a second frame belonging to a second stream. The first stream is different than the second stream. The n processing pipelines are coupled to n-by-n value buffers per stream per recorded value for the stream, and at least one status buffer per stream. The n processing pipelines are each assigned a distinct row of read-authorized port access to the n-by-n value buffers and a distinct column of write-authorized port access to the n-by-n value buffers.

Abstract: A numerical controller for controlling a machine tool for machining a work on the basis of an NC program for execution including a variable includes NC program reading unit, NC program analyzing unit, and a variable value table sequentially holding a variable value assigned to a variable at time of execution of a predetermined unit of program read by the NC program reading unit, and the NC program analyzing unit includes a character string for variable-check creating unit for replacing a character string included in an instruction affected by the variable in the predetermined unit of program with a character string for variable-check on the basis of the predetermined unit of the program read by the NC program reading unit and the variable value obtained from the variable value table and an NC program for variable-check writing unit.

Abstract: An interrelated set of tools and methods are disclosed for recording the identity of software components responsible for creating files, recording the identity of software components that access software files, reasoning about the dependency relationships between software components, identifying and reporting undesirable dependencies between them, and reporting other useful information about a large-scale software architecture by instrumenting a software build process or test process.

Abstract: Methods and systems for efficient retrieval of neighboring measurement values in order to enable fast execution of rule-based error correction are disclosed. In one aspect, a method for data normalization using multi-key sorting is disclosed. In some embodiments, the method includes receiving, by a data organization engine, a set of uncorrected data including corresponding neighboring data. In various embodiments, the data organization engine organizes the uncorrected data by construction of a directed acyclic graph (DAG), where the DAG includes a plurality of nodes. In some embodiments, the data organization engine may traverse the plurality of nodes to retrieve the corresponding neighboring data. Upon retrieval of the neighboring data, a rule-based correction engine may correct the uncorrected data utilizing the retrieved corresponding neighboring data.

Abstract: A database system includes a parser that is capable of parsing database queries containing user-defined data type (UDT) methods. The database query is transformed by the parser into a statement according to a specified format. In performing the transformation, redundant instantiations of UDTs and invocations of methods are removed. In one implementation, the redundant instantiations and invocations are removed by grouping and combining clauses containing UDT methods.

Abstract: Methods and apparatuses for detecting an evaluation flaw in a SQL query, the SQL query configured to access data in a database table are disclosed. The method includes creating a parse tree from the SQL query and evaluating the parse tree to ascertain whether a condition of the SQL query results in a type or value that is independent of contents of the database table. For type evaluation, if, responsive to the evaluating, the condition is found, designating the SQL query at risk for having the tautology in the SQL query. For value evaluation, if, responsive to the evaluating, the condition is found, determining whether the condition is always true or whether the condition is always false; and if, responsive to the determining, the condition is found to be always true or always false, designating the SQL query at risk for having the evaluation flaw in the SQL query.

Abstract: Methods and apparatuses for detecting an evaluation flaw in a SQL query, the SQL query configured to access data in a database table are disclosed. The method includes creating a parse tree from the SQL query and evaluating the parse tree to ascertain whether a condition of the SQL query results in a type or value that is independent of contents of the database table. For type evaluation, if, responsive to the evaluating, the condition is found, designating the SQL query at risk for having the tautology in the SQL query. For value evaluation, if, responsive to the evaluating, the condition is found, determining whether the condition is always true or whether the condition is always false; and if, responsive to the determining, the condition is found to be always true or always false, designating the SQL query at risk for having the evaluation flaw in the SQL query.

Abstract: Method and system for detecting an unknown undesirable event, such as (but not limited to) a cyber-threat, a cyber-intrusion, a financial fraud event or a monitored process malfunction of breakdown. An exemplary method embodiments comprises obtaining a dataset comprising a plurality n of multidimensional data points with a dimension m?2 wherein each data point is a vector of m features, processing the MDPs using measure-based diffusion maps to embed the MDPs into a lower dimension embedded space, and detecting in the embedded space an abnormal MDP without relying on a signature of a threat, the abnormal MDP being indicative of the unknown undesirable event.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed herein. An example apparatus includes an instruction profiler to identify a predicated block within instructions to be executed by a hardware processor. The example apparatus includes a performance monitor to access a mis-prediction statistic based on an instruction address associated with the predicated block. The example apparatus includes a region former to, in response to determining that the mis-prediction statistic is above a mis-prediction threshold, include the predicated block in a predicated region for optimization.

Abstract: Certain example embodiments relate to techniques for executing business processes in a distributed computer system (e.g., cloud-based) environment. A representation of the business process is decomposed into executable components. The executable components each have assigned thereto process and sequence identifiers, and each is classified as having an executable component types. The executable component types including integration, task, and data flow types. The integration flow type represents activities to be performed in connection with external computer systems, the task flow type represents human-interactive activities, and the data flow type represents activities to be performed on data relevant to the business process.

Abstract: An approach to creating a canonical representation of a JavaScript API. Objects associated with the JavaScript API are instantiated, creating entry points for analysis. A list of discovered objects is created based on parsing a document object model associated with the JavaScript API. The objects are instrumented and statically analyzed, creating an infrastructure associated with the JavaScript API. The infrastructure is updated based on analyzing the objects while the interface is being used and the objects are executing. A canonical representation, based on the updated infrastructure, is generated for further operations.

Abstract: A method of generating an instrumented code from a program code executable on a programmable target is described. The method comprises analyzing the program code to detect a loop nest with regular memory access in the program code, providing a record of static memory address information associated with the loop nest, and instrumenting the program code to provide an instrumented code corresponding to the program code supplemented with an instrumentation instruction to output an information message comprising a dynamic memory address information field formatted to store a dynamic memory address information associated with the loop nest.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing data flow analysis using collapsed contexts. One of the methods includes obtaining data representing a plurality of software elements, wherein one or more software elements are initially designated as elements having the particular property; iteratively designating other software elements to which data of the one or more elements having the particular property flows, including: whenever the program includes multiple calls to a function, analyzing the function in a collapsed context to determine whether any argument flows to a return value of the function, and whenever any data in an argument that has the particular property according to the collapsed context flows to a return value of the function, adding each call to the function throughout the program having one argument having the particular property; and providing the set of software elements having the particular property.

Abstract: The image decoding method includes: determining a context for use in a current block to be processed, from among a plurality of contexts; and performing arithmetic decoding on a bit sequence corresponding to the current block, using the determined context, wherein in the determining: the context is determined under a condition that control parameters of neighboring blocks of the current block are used, when the signal type is a first type, the neighboring blocks being a left block and an upper block of the current block; and the context is determined under a condition that the control parameter of the upper block is not used, when the signal type is a second type, and the second type is one of “ref_idx_l0” and “ref_idx_l1”.

Abstract: Provided is a process, including: obtaining a graph to be visually represented in a graphical user interface of a client computing device; obtaining a set of text labels each corresponding to a respective collection of the nodes; determining a two dimensional or higher layout of the icons in the visual representation; segmenting the field of view into a plurality of segments; determining which icons are disposed within each of the segments of the field of view; determining positions of the text labels in the visual representation relative to one or more icons representing nodes in the respective collection of nodes based on the segment of the field of view in which the one or more icons representing nodes in the respective collection are disposed; and causing the visual representation to be displayed.

Abstract: Methods and systems to convert a scalar computer program loop having loop-carried dependences into a vector computer program loop are disclosed. One such method includes, replacing the scalar recurrence operation in the scalar computer program loop with a first vector summing operation and a first vector recurrence operation. The first vector summing operation is to generate a first running sum and the first vector recurrence operation is to generate a first vector. In some examples, the first vector recurrence operation is based on the scalar recurrence operation. Disclosed methods also include inserting: 1) a renaming operation to rename the first vector, 2) a second vector summing operation that is to generate a second running sum; and 3) a second vector recurrence operation to generate a second vector based on the renamed first vector.

Abstract: A split-screen display method and apparatus, and an electronic device thereof. A horizontal slide signal along a touchscreen or a vertical slide signal along the touchscreen entered by using the touchscreen is obtained; a current display area of the touchscreen is divided, according to the horizontal slide signal, into at least two display windows arranged up and down, or a current display area of the touchscreen is divided, according to the vertical slide signal, into at least two display windows arranged side by side, thereby implementing that multiple application programs are simultaneously displayed on a screen up and down or side by side, and a user does not need to frequently switch between programs, which facilitates user operations.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for automatically determining configuration properties of a compiler. One of the methods includes determining that an executable of the newly created process is a compiler called by the build system to compile source code of a source code file. In response to the determining, a plurality of configuration properties of the compiler called by the build system are determined, the configuration properties including first properties of a plurality of built-in functions of the compiler, second properties of a plurality of built-in types of the compiler, or both. A compiler emulator is configured to emulate the behavior of the compiler called by the build system using the determined configuration properties. Access to the source code is provided to the compiler emulator configured using the determined configuration properties.