Scanning And Lexical Analysis Patents (Class 717/142)
-
Patent number: 8566808Abstract: A system may include an application programming interface (API) layer, a cache layer, and an object storage/access layer. The API layer may expose an interface to store a business object and an interface to retrieve the business object, and may transmit a request to store the business object and a request to retrieve the business object, and the cache layer may cache the business object and transmit the request to store the business object and the request to retrieve the business object. The object storage/access layer may receive the request to store the business object and, in response to the request to store the business object, to invoke a serialization method exposed by the business object to store the data associated with the object in a data structure.Type: GrantFiled: June 8, 2009Date of Patent: October 22, 2013Assignee: SAP AGInventor: Ivan Schreter
-
Patent number: 8561019Abstract: A system, method and software product retrieve a formatted data value from a data layer to a business logic layer by invoking a formatted variable abstraction procedure from the business logic layer, passing at least one parameter to the formatted variable abstraction procedure (the at least one parameter identifying a formatted system variable), and building a dynamic statement based upon the formatted system variable such that execution of the dynamic statement: accesses a formatted variable table based upon the formatted system variable to locate information relating to the formatted system variable; retrieves one or more data items based upon the information; formats the data items to form the formatted data value based upon the information; and returns the formatted data value to the business logic layer.Type: GrantFiled: August 11, 2006Date of Patent: October 15, 2013Assignee: Adaptive Intelligence LLCInventor: James G. Lyle
-
Patent number: 8555261Abstract: A system and method for parsing XML is provided. The method includes associating an input stream with a pull model parser, accepting requests to selectively parse out XML items from the input stream and retrieving metadata information associated with the parsed out XML items. The method further includes checking the pulled XML item to determine whether it conforms to XML syntax and/or semantic standards and validating the pulled XML item to determine whether it conforms to a selected DTD.Type: GrantFiled: June 28, 2001Date of Patent: October 8, 2013Assignee: Microsoft CorporationInventors: Anders Hejlsberg, Christopher J. Lovett, Matthew J. Warren, Chia-Hsun Chen, Mark W. Fussell, Neetu Rajpal
-
Patent number: 8549465Abstract: Embodiments of the present invention address deficiencies of the art in respect to defect classification for software development and provide a method, system and computer program product for automated defect classification in a software development tool. In an embodiment of the invention, a defect classification method can be provided. The method can include computing differences between versions of a line of source code, lexically analyzing the computed differences to produce a lexical construct, mapping the lexical construct to a classification, and assigning the defect classification to the line of source code.Type: GrantFiled: February 28, 2012Date of Patent: October 1, 2013Assignee: International Business Machines CorporationInventors: Corville O. Allen, Albert A. Chung, Binh C. Truong, Kam K. Yee
-
Patent number: 8539462Abstract: A method of allocating registers for a processor based on cycle information is disclosed. The processor comprises a first cluster and a second cluster. Each cluster comprises a first functional unit, a second functional unit, a first local register file connected to the first functional unit, a second local register file connected to the second register file, and a global register file having a ping-pong structure formed by a first register bank and a second register bank. After building a Component/Register Type Associated Data Dependency Graph (CRTA-DDG), a functional unit assignment, register file assignment, ping-pong register bank assignment, and cluster assignment are performed to take full advantage of the properties of a processor as well as cycle information.Type: GrantFiled: December 21, 2010Date of Patent: September 17, 2013Assignee: National Tsing Hua UniversityInventors: Chung Ju Wu, Yu Te Lin, Jenq Kuen Lee
-
Patent number: 8533693Abstract: An architecture that that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.Type: GrantFiled: November 29, 2010Date of Patent: September 10, 2013Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, David N. Schach, Avner Y. Aharoni, Peter F. Drayton, Brian C. Beckman, Amanda Silver, Paul A. Vick
-
Patent number: 8533673Abstract: To enable language-level integration of multiple programming languages into a single programming framework, one or more domain specific languages (DSLs) are specified as incremental extensions to a host programming language. An application created in this framework may include program code written in the host language as well as DSL inset code that is written in any of the DSLs. The extensions to the host language are described in DSL specifications, which define how the DSL inset code is processed. At runtime, DSL inset code in the source code is detected and passed to a DSL inset processor for execution according to an appropriate DSL specification, whereas source code in the host language is executed by a host language processor.Type: GrantFiled: March 20, 2008Date of Patent: September 10, 2013Assignee: SAP AGInventors: Matthias Gerhard Anlauff, Vishal Sikka, Rahim Yaseen
-
Patent number: 8533672Abstract: To enable language-level integration of multiple programming languages into a single programming framework, one or more domain specific languages (DSLs) are specified as incremental extensions to a host programming language. An application created in this framework may include program code written in the host language as well as DSL inset code that is written in any of the DSLs. The extensions to the host language are described in DSL specifications, which define how the DSL inset code is processed. At runtime, DSL inset code in the source code is detected and passed to a DSL inset processor for execution according to an appropriate DSL specification, whereas source code in the host language is executed by a host language processor.Type: GrantFiled: March 20, 2008Date of Patent: September 10, 2013Assignee: SAP AGInventors: Vishal Sikka, Matthias Gerhard Anlauff
-
Patent number: 8527962Abstract: A method for promotion of a child procedure in a software application for a heterogeneous architecture, wherein the heterogeneous architecture comprises a first architecture type and a second architecture type, comprises inserting a parameter representing a parallel frame pointer to a parent procedure of the child procedure into the child procedure; and modifying a reference in the child procedure to a stack variable of the parent procedure to include an indirect access to the parent procedure via the parallel frame pointer.Type: GrantFiled: March 10, 2009Date of Patent: September 3, 2013Assignee: International Business Machines CorporationInventors: Raul Silvera, Ettore Tiotto, Guansong Zhang
-
Patent number: 8522219Abstract: A recorder, comprising: a context analyzer configured to associate HTTP transactions of a web application with a web session, wherein the web application executes code on the client side; an extensible document parser configured to parse a document included in the HTTP transactions; a library of parser additions used by the context analyzer to generate a context-full replay instruction; and a script generator configured to record a script including the context-full replay instruction in order to recreate the HTTP transactions in order to simulate use of the web application by a user.Type: GrantFiled: December 17, 2010Date of Patent: August 27, 2013Assignee: Borland Software CorporationInventors: Gunter Schwarzbauer, Helmut Spiegl, Ernst Ambichl, Bernd Greifeneder
-
Patent number: 8516457Abstract: Disclosed are embodiments a computer-implemented method, a system and an associated program storage device that provide for automatic programming language grammar partitioning to solve the “code too large” problem. The embodiments partition a particular programming language grammar into logical subsets based on a set of partitioning heuristics and using a dependency graph that is preprocessed so as to be devoid of any cyclically connected grammar rule nodes. For each logical subset, textual code for a corresponding portion of a parsing program can be generated and then converted into machine-readable code for that corresponding portion of the parsing program. Thus, small amounts of textual code for portions of a parsing program are discretely converted into machine-readable code, thereby avoiding the “code too large” problem. The machine-readable code for all portions of the parsing program can then be merged and the parsing program can be executed in order to parse a corpus.Type: GrantFiled: June 28, 2011Date of Patent: August 20, 2013Assignee: International Business Machines CorporationInventors: Pankaj Dhoolia, Mangala G. Nanda, Krishna Nandivada Venkata, Diptikalyan Saha
-
Patent number: 8516458Abstract: A computer-programming tool for generating an implementation of a first data structure, the first data structure representing at least a portion of a computer-programming language. The implementation includes a second data structure and implementation rules which define the syntax rules of the first data structure to be enforced in relation to nodes of the second data structure during a subsequent processing operation which utilizes the implementation in order to establish compliance with the syntax rules represented by the first data structure. Links between nodes of the first data structure are representative of paths of inheritance of substitutability but not implementation and interface between those nodes.Type: GrantFiled: February 26, 2009Date of Patent: August 20, 2013Assignee: ITI Scotland LimitedInventors: Neil Stewart, Douglas Little
-
Patent number: 8504984Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products for selecting a first grammar rule in a programming language grammar. The grammar is used for determining a syntax validity of a programming code statement in a text editor and the first grammar rule includes a hard-to-type symbol that is syntactically correct for the programming code statement. A second grammar rule for the grammar is created. The created second grammar rule is substantially identical to the first grammar rule but the hard-to-type symbol is replaced with an easy-to-type symbol that is syntactically incorrect for the programming code statement. An action is associated with the grammar and is performed upon satisfying the second grammar rule. Performance of the second grammar rule causes the easy-to-type symbol in the programming code statement in the text editor to be replaced with the hard-to-type symbol.Type: GrantFiled: May 29, 2009Date of Patent: August 6, 2013Assignee: Google Inc.Inventor: Don Hsi-Yun Yang
-
Patent number: 8505000Abstract: There is described a method of compiling source code for a computer program into corresponding object code. The source code includes several declared variables. The method comprises, for each declared variable in the source code, including in the object code a declaration statement indicating an associated memory location for that variable and indicating the position in the object code of the next declaration statement. During compilation, the memory location for each declared variable can be retrieved from the object code by examining each declaration statement in turn, using the position information from each declaration statement to locate the next declaration statement. This is of particular advantage where the available volatile memory is limited, because there is no requirement for a look-up table of variables against memory locations.Type: GrantFiled: July 24, 2008Date of Patent: August 6, 2013Assignee: Ezurio LimitedInventor: Mahendra Tailor
-
Patent number: 8490056Abstract: A system and program product for automatic identification of subroutines from test scripts is disclosed. An instruction class may be coded as a subroutine vector in a vector space model. A test script action may be coded as a test script vector in a vector space model. The test script vector may be compared to the subroutine vector. The test script vector may be identified and labeled. The test script vector may be labeled as a new test script action if the result of comparing is below a threshold value. An identifier may be associated with a new test script action.Type: GrantFiled: April 28, 2010Date of Patent: July 16, 2013Assignee: International Business Machines CorporationInventors: Tessa A. Lau, Jalal U. Mahmud
-
Patent number: 8464231Abstract: A method and apparatus access a production among first and second groups of productions. The productions form rules for constructing hierarchical data of a structured electronic document. The first group is associated with a first group of events, each production being defined for an event type and contextual information including a name associated with an element in the hierarchical data. The second group is associated with a second group of events distinct from the first group of events, the events of the second group describing the hierarchical data of the structured electronic document. The device determines whether an event is of the first group including determining whether the event in question is defined by a name associated with an element in addition to an event type, and predicts a production from the second group that is associated with the event is determined to be of the first group.Type: GrantFiled: February 11, 2009Date of Patent: June 11, 2013Assignee: Canon Kabushiki KaishaInventor: Romain Bellessort
-
Patent number: 8443337Abstract: In one embodiment, the present invention includes a method for associating and storing a code fragment for each cell of a table for a protocol specification in a semantic mapping corresponding to the table, and automatically generating a formal model for the protocol specification using the table and the semantic mapping. Other embodiments are described and claimed.Type: GrantFiled: March 11, 2008Date of Patent: May 14, 2013Assignee: Intel CorporationInventors: Ching-Tsun Chou, Phanindra K. Mannava, Seungjoon Park
-
Patent number: 8434068Abstract: A system comprising: a server; a computer terminal coupled remotely to the server via a network and installed with a web browser; and an external test platform, connected externally to the computer terminal, the test platform comprising a programmable target device and interface circuitry operable to communicate between the computer terminal and the target device. The server hosts a development tool available for download to the web browser via the network. The development tool comprises: one or more applets to be run by the web browser, and one or more web pages for display by the web browser to provide a user-interface for the development tool including to provide access to the one or more applets. The one or more applets at least comprise code-analysis applet software programmed so as when run by the web browser to operate said interface circuitry to: load code to be tested from the computer terminal onto the target device for test operation.Type: GrantFiled: October 23, 2008Date of Patent: April 30, 2013Assignee: XMOS Ltd.Inventors: Michael Thomas Wrighton, Matthew David Fyles, Hendrik Lambertus Muller
-
Patent number: 8429627Abstract: System and method for analyzing a graphical program. A graphical program is displayed on a display. A semantic edit operation is performed on the graphical program in response to user input. The semantic edit operation is performed by a first process. Semantic analysis of the graphical program is performed by a second process in response to performing the semantic edit operation, where the second process is asynchronous with respect to the first process. Results from the semantic analysis of the graphical program are displayed in response to completion of the semantic analysis. If during the semantic analysis, another semantic edit operation is performed on the graphical program, the semantic analysis may be preemptively terminated and re-initiated. Displaying results from the semantic analysis of the graphical program may then include displaying results from the re-initiated semantic analysis of the graphical program in response to completion of the re-initiated semantic analysis.Type: GrantFiled: October 12, 2009Date of Patent: April 23, 2013Assignee: National Instruments CorporationInventors: David C. Jedlicka, Jeffrey L. Kodosky, Gregory C. Richardson, John D. Stanhope
-
Patent number: 8429626Abstract: Aspects of the present invention are directed at obtaining user feedback and causing a package of content updates to be created and distributed based on the received feedback. In accordance with one embodiment, a method is provided for creating a package that contains one or more content updates configured to change the content that is displayed by default when a program executes. More specifically, the method includes obtaining input that describes one or more content updates. In this regard, the input received may include the user-defined content that will be displayed when the program executes and the identity of the content displayed by default. Then, the method assembles selected content updates into a package that is suitable for transmission over a network connection. When the package is assembled, processing is provided that allows the content updates in the package to be implemented on a remote computing device.Type: GrantFiled: February 15, 2007Date of Patent: April 23, 2013Assignee: Microsoft CorporationInventors: Cameron B. Lerum, Catherine A. Wissink, Roxanne M. Seubert, Sushmita Subramanian, Vivek R. Rao, Yaron Hezroni
-
Patent number: 8423981Abstract: Compiling a graphical program including a textual program portion for execution on a real time target. The graphical program may be created on a display or stored in a memory medium. The graphical program may include a plurality of connected nodes which visually indicate functionality of the graphical program. The graphical program may include at least one node which corresponds to a textual language program portion. The textual language program portion may be written or specified in a dynamically typed programming language. The graphical program may be compiled for deployment on the real time target. Compiling the graphical program may include compiling the plurality of connected nodes and the textual language program portion for deterministic real time execution on the real time target.Type: GrantFiled: June 18, 2009Date of Patent: April 16, 2013Assignee: National Instruments CorporationInventors: Duncan G. Hudson, III, Rishi H. Gosalia
-
Patent number: 8402445Abstract: The present invention comprises: a converting step for converting a source program into a machine language program; an inserting step for inserting notifying instructions for notifying that the source program has been executed in the machine language program; and a program generating step for generating the executable program from the machine language program in which the notifying instructions are inserted. Further, in the inserting step, the notifying instructions are placed at the entry points of each basic block that constitutes the machine language program and the notifying instructions to which the same conditions as those of the conditional instruction groups are granted are placed at the entry points of conditional instruction groups provided in the machine language program. In the program generating step, identification information for identifying the notifying instructions is granted to each of the notifying instructions.Type: GrantFiled: December 7, 2010Date of Patent: March 19, 2013Assignee: Panasonic CorporationInventors: Yoko Makiyori, Taketo Heishi, Akira Takuma
-
Patent number: 8381201Abstract: In many messaging systems, message selection filtering involves a significant processing overhead. This includes the parsing and preparing of the message selection filters in readiness for evaluation, as well as the evaluation itself. In systems which involve parsing and prepare processing for expressions that include repeated patterns (such as in many JMS environments), a template-based shortcutting of the conventional processing improves performance. A stored parsing template is used to parse an input sequence such as a received data processing instruction. The parse is used to identify expressions of a first type that can then be implicitly optimized by using a stored evaluation template that is associated with expressions of that type.Type: GrantFiled: February 7, 2012Date of Patent: February 19, 2013Assignee: International Business Machines CorporationInventor: Stephen James Todd
-
Publication number: 20130014093Abstract: The present invention relates to a code inspection executing system for performing a code inspection of ABAP source codes, and particularly, to a code inspection executing system for performing a code inspection of ABAP source codes, which provides the reliable maintainability, performance, accuracy, stability, and security of an ABAP application by inspecting coding defects such as system failure and stoppage, data loss and transformation, excessive performance deterioration, erroneous behavior of functions and results thereof, complex code structures, and spelling errors.Type: ApplicationFiled: April 5, 2010Publication date: January 10, 2013Applicant: SOFT4SOFT CO., LTD.Inventor: Heon Ki Lee
-
Patent number: 8341597Abstract: The present invention relates to the field of computer programming. More specifically the invention relates to a method and a data processing system for editing the source code of a computer program. It is an object of the present invention to provide an easy source code editing technique, by which programming errors and type errors can reliably be avoided in cases where changes to the program are supposed not to change the semantics of the program. This object is achieved according to the invention by a method for editing source code, the method comprising the steps of: receiving a modification to the source code, said modification being made by a user, determining whether the modification would change the semantics of the source code, and handling the modification depending on the result of the determining step.Type: GrantFiled: January 16, 2008Date of Patent: December 25, 2012Assignee: International Business Machines CorporationInventors: Andreas Arning, Friedemann Schwenkreis
-
Patent number: 8336037Abstract: Client Native method Interface (CNI) minimizing eXtensible Mark-up Language (XML) parsing is provided using array pair data structures. An empty array pair is passed to an engine from client code via a CNI call. The engine parses the XML document and fills the array pair with fixed width elements. The filled array pair is passed back to client code. The client code iterates through the elements in the array pair and invokes the appropriate handlers or builds appropriate tree objects for Document Object Model parsing. Thus, one CNI call passes the empty array pair from client code to the engine, and the filled array pair is returned from the engine to client code. Individual sets of CNI calls for each element are avoided, minimizing the number of CNI calls. Further, since elements in the array pair are of fixed width, they can be processed more efficiently by the client code.Type: GrantFiled: May 16, 2007Date of Patent: December 18, 2012Inventor: Richard A. Ross
-
Patent number: 8321854Abstract: Described are techniques for obtaining grammar updates. A grammar service receives a notification regarding a grammar update applied to a target. The grammar update is an update to a command syntax used by said target. The grammar service sends an update request to said target to obtain said grammar update. The target sends to the grammar service an update response including said grammar update. Also described are techniques for processing a command line. One of a plurality of rule sets is selected. The command line is parsed at said client using said selected rule set. If parsing did not result in a syntax error, a command request is sent from said client to said target. In response, the client receives a command response including information regarding a version of syntax rules currently used on said target.Type: GrantFiled: December 18, 2007Date of Patent: November 27, 2012Assignee: EMC CorporationsInventors: Artem Zarafyants, Sergey Alexeev
-
Patent number: 8311806Abstract: An apparatus for processing a sequence of tokens to detect predetermined data, wherein each said token has a token type, and the predetermined data has a structure that comprises a predetermined sequence of token types, including at least one optional token type. The apparatus comprises a processor arranged to: provide a tree for detecting the predetermined data, the tree comprising a plurality of states, each said state being linked with at least one other state by a respective condition, the arrangement of linked states forming a plurality of paths; and compare the token types of the sequence of tokens to respective conditions in the tree to match the sequence of tokens to one or more paths in the tree, wherein the predetermined data can be detected without using an epsilon reduction to take account of said at least one optional token type.Type: GrantFiled: September 29, 2008Date of Patent: November 13, 2012Assignee: Apple Inc.Inventors: Olivier Bonnet, Frederic de Jaeger, Romain Goyet
-
Patent number: 8312440Abstract: A source code of a program is used to identify a first portion of the program that is predicted as being written by a first developer wherein a remaining portion of the program is written by a second developer. The program includes a plurality of program elements. Style information is extracted from each of the program elements. The style information is analyzed to identify a first set of program elements which have a first style corresponding to the first developer, wherein the first style differs from a second style corresponding to the second developer and used by a second set of program elements comprising remaining program elements of the plurality of program elements, and wherein the style information identifies a pattern indicative of how one or more non-syntactic characters have been inserted among syntactic program elements of the plurality of program elements.Type: GrantFiled: August 19, 2008Date of Patent: November 13, 2012Assignee: International Business Machines CorporationInventors: Futoshi Iwama, Taiga Nakamura
-
Patent number: 8307351Abstract: A system and method is provided for performing code provenance review in a software due diligence system. In particular, performing code provenance review may include sub-dividing source code under review and third-party source into logical fragments using a language-independent text fracturing algorithm. For example, the fracturing algorithm may include a set of heuristic rules that account for variations in coding style to create logical fragments that are as large as possible without being independently copyrightable. Unique fingerprints may then be generated for the logical fragments using a fingerprint algorithm that features arithmetic computation. As such, potentially related source code may be identified if sub-dividing the source code under review and the third-party source code produces one or more logical fragments that have identical fingerprints.Type: GrantFiled: March 18, 2009Date of Patent: November 6, 2012Assignee: Oracle International CorporationInventor: Juergen Weigert
-
Patent number: 8302080Abstract: A method and apparatus is disclosed herein for automated test input generation for web applications.Type: GrantFiled: October 10, 2008Date of Patent: October 30, 2012Assignee: NTT DoCoMo, Inc.Inventors: Gary Wassermann, Dachuan Yu, Ajay Chander, Dinakar Dhurjati, Hiroshi Inamura
-
Patent number: 8296744Abstract: Embodiments of tree-based directed graph programming structures for a declarative programming language are provided. In various embodiments, complex graph structured data, referred to as “DGraphs” herein in one non-limiting implementation, is authored using a compact, human friendly syntax without the use of explicit identifiers. In one non-limiting aspect, the syntax includes support for conformance relationships, also referred to as factored relationships. In another non-limiting aspect, the semistructured graph data is a tree-based representation and the syntax includes lexical resolution of references or lexical scoping, and/or non local initialization.Type: GrantFiled: October 3, 2008Date of Patent: October 23, 2012Assignee: Microsoft CorporationInventors: David E. Langworthy, John L. Hamby, Bradford H. Lovering, Donald F. Box
-
Patent number: 8276130Abstract: The present invention provides a method and a compiler of compiling a source program. According to an aspect of the present invention, there is provided a method of compiling a source program comprising: identifying a hint related to vector aligning when syntax analyzing said source program; and generating a simplified code based on said identified hint related to vector aligning when generating a code.Type: GrantFiled: August 1, 2008Date of Patent: September 25, 2012Assignee: International Business Machines CorporationInventors: Wenjun Wang, Zhou Wu, Xin Zhong, Zheng Wang
-
Patent number: 8255881Abstract: A method for calculating a composite risk is disclosed. The method may include receiving information associated with a plurality of risk factors. The information may include a timeline for each risk factor, and the timeline may include a plurality of discrete time points. The method may further include determining risk values indicative of risk levels of each risk factor associated with the plurality of discrete time points. The method may also include calculating the composite risk using the determined risk values and a relationship between the composite risk and the plurality of risk factors. The composite risk may include a plurality of composite risk values associated with the plurality of discrete time points.Type: GrantFiled: June 19, 2008Date of Patent: August 28, 2012Assignee: Caterpillar Inc.Inventors: Nathan Lee Wilson, Scott William Streitmatter, Frank Chapman Bellrose, Bruce Gehlbach Howell, Stanley Russell Kaniecki
-
Patent number: 8245204Abstract: Managing program function parameters using compiler directives is provided. A parameter management system can include a compiler coupled to a primary symbol-type dictionary and a supplemental symbol-type dictionary containing parameter data for specific function calls of corresponding generic type functions. Notably, directive processing logic can be configured both to populate the supplemental symbol-type dictionary based upon processor directives embedded in source code, and also to substitute specific function calls for generic function calls in the source code as specified in the supplemental symbol-type dictionary.Type: GrantFiled: December 31, 2007Date of Patent: August 14, 2012Assignee: International Business Machines CorporationInventors: Ying Chau Raymond Mak, Wang Dong Chen, Larry Alexander Lindsay
-
Patent number: 8201156Abstract: Associating a message identifier with a message is disclosed. The message is specified in a program code. It is determined whether the message specified in the program code matches an entry of a message catalog. A message identifier is associated with the message automatically based at least in part on the determination.Type: GrantFiled: June 8, 2007Date of Patent: June 12, 2012Assignee: EMC CorporationInventors: Tom Pohorsky, Bala Vijayakumar, Scott Lee, Srinivasan Ramachandran, Olga Zaigralina
-
Patent number: 8161467Abstract: A compiler includes a register allocator for allocating registers for instructions in a program to be compiled, and a code generator for generating object code based on the register allocation results performed by the register allocator. The register allocator allocates logical registers for instructions in the program to be compiled. The register allocation further allocates, to physical registers, the logical registers that are allocated to the instructions of the program, so that the physical registers that are live at a procedure call in the program to be compiled are allocated from the bottom of the register stack.Type: GrantFiled: October 31, 2007Date of Patent: April 17, 2012Assignee: International Business Machines CorporationInventors: Akira Koseki, Mikio Takeuchi, Hideaki Komatsu
-
Patent number: 8161466Abstract: Provided is a method of pre-processing a conditional region. By analyzing and designating code lines according to the present invention, when a conditional region included in a pre-processing region of an arbitrary file is compiled, the compiling can be efficiently performed, and when the arbitrary file is executed, an execution result can be derived in a short time.Type: GrantFiled: November 20, 2007Date of Patent: April 17, 2012Assignee: Samsung Electronics Co., LtdInventor: Soon-Yong Jeong
-
Patent number: 8161468Abstract: In many messaging systems, message selection filtering involves a significant processing overhead. This includes the parsing and preparing of the message selection filters in readiness for evaluation, as well as the evaluation itself. In systems which involve parsing and prepare processing for expressions that include repeated patterns (such as in many JMS environments), a template-based shortcutting of the conventional processing improves performance. A stored parsing template is used to parse an input sequence such as a received data processing instruction. The parse is used to identify expressions of a first type that can then be implicitly optimized by using a stored evaluation template that is associated with expressions of that type.Type: GrantFiled: February 13, 2008Date of Patent: April 17, 2012Assignee: International Business Machines CorporationInventor: Stephen James Todd
-
Patent number: 8156559Abstract: To achieve end-to-end security, traditional machine-to-machine security measures are insufficient if the integrity of the graphical user interface (GUI) is compromised. GUI logic flaws are a category of software vulnerabilities that result from logic flaws in GUI implementation. The invention described here is a technology for uncovering these flaws using a systematic reasoning approach. Major steps in the technology include: (1) mapping a visual invariant to a program invariant; (2) formally modeling the program logic, the user actions and the execution context, and systematically exploring the possibilities of violations of the program invariant; (3) finding real spoofing attacks based on the exploration.Type: GrantFiled: November 30, 2006Date of Patent: April 10, 2012Assignee: Microsoft CorporationInventors: Shuo Chen, Jose Meseguer, Ralf Sasse, Jiahe Helen Wang, Yi-Min Wang
-
Patent number: 8156474Abstract: A method, system, and computer program product are disclosed for automatic test generation for a compiler. In one approach, the method, system and computer program product represent a test case for the compiler in a structure with one or more elements of a programming language, associate at least one syntactic rule and semantic rule with the one or more elements in the structure, create a test with the structure compiling the test with the compiler, and display results of the test.Type: GrantFiled: December 28, 2007Date of Patent: April 10, 2012Assignee: Cadence Design Systems, Inc.Inventors: Marat Teplitsky, Meir Ovadia, Noa Gradovich
-
Patent number: 8099722Abstract: A system and method provide the ability to construct lexical analyzers on the fly in an efficient and pervasive manner. The system and method split the table describing the automata into two distinct tables and splits the lexical analyzer into two phases, one for each table. The two phases consist of a single transition algorithm and a range transition algorithm, both of which are table driven and permit the dynamic modification of those tables during operation. A third ‘entry point’ table may also be used to speed up the process of finding the first table element from state 0 for any given input character.Type: GrantFiled: July 11, 2007Date of Patent: January 17, 2012Inventor: John Fairweather
-
Patent number: 8099721Abstract: Declarations from an input source code or tokenized source code are serialized into a stream of tokens produced by following each branch of a preprocessor conditional directive statement that interrupts a declaration. Tokens are labeled with a parsing path indicator corresponding to a parsing path induced by branches of a preprocessor conditional directive. The declarations that are formed along the different parsing paths are serialized by fetching the tokens that belong to the first parsing path in a first pass, and passing the tokens on to a next phase of a compiler. The pointer that marks the next token is repositioned to return to the start of the declaration. The declaration may be serialized again through the second parsing path in a second pass. The operation may be repeated until each of the parsing paths induced by the presence of branches of the preprocessor conditional directives in the source code is exhausted.Type: GrantFiled: June 17, 2008Date of Patent: January 17, 2012Assignee: Microsoft CorporationInventor: Thierry Miceli
-
Patent number: 8087009Abstract: An Extensible Markup Language (XML) Application Server for storing, processing, communicating, and displaying dynamic semi-structured information. It comprises a declarative specification language, a transactional indexed XML data store, and an XML application server engine. An integrated architecture (a) provides for optimization, indexing, and backtracking search in a business logic layer, (b) provides for general-purpose programming idioms including recursive function definitions, iteration, and dynamic dispatch in data layer queries and updates, and (c) eliminates processing overhead and maintenance issues caused by transforming between relational, object-oriented, and semi-structured data paradigms.Type: GrantFiled: February 24, 2009Date of Patent: December 27, 2011Inventor: Judson Ames Cornish
-
Patent number: 8051411Abstract: A method for copy propagations of a processor including two clusters, each cluster comprising a first function unit and a second function unit, a first local register file and a second local register file being respectively accessible by the first and second function unit only, and a global register file having a ping-pong structure to access the first and second local register files, the method comprising the steps of: (a) listing possible copy propagation paths between two nodes of a data flow graph; (b) calculating a profit of machine cycles for each of the copy propagation paths according to constraints of the processor; and (c) performing a copy propagation through the copy propagation path if the profit thereof is greater than a threshold value.Type: GrantFiled: August 8, 2007Date of Patent: November 1, 2011Assignee: National Tsing Hua UniversityInventors: Jenq Kuen Lee, Chung Ju Wu, Sheng Yuan Chen
-
Patent number: 8010952Abstract: Syntax and semantic validation of network commands use a command database that has been learned automatically for validation of the syntax and the semantics of command line interface commands by interpreting the network commands as the network commands are entered to identify syntax errors or semantic errors before applying the same commands on a device of interest.Type: GrantFiled: June 8, 2005Date of Patent: August 30, 2011Assignee: Cisco Technology, Inc.Inventors: Krishnam Raju Datla, Srinivasa Beereddy, Praveen Vengalam, Chandrasekhar Guntakala, Prasanthi Somepalli
-
Publication number: 20110167415Abstract: A language processing apparatus comprises a first assembler file generating unit that allocates a variable included in a source program written in a single module to a register, generates an assembler code for each function, inserts a save-restore code for the register into an entry-exit point of a function that uses the register, and generates a first assembler program; and a second assembler file generating unit that, when the register used in the function is not used in a caller, migrates the save-restore code for the register written in the first assembler file to an entry-exit point of the caller, and generates a second assembler program.Type: ApplicationFiled: March 3, 2010Publication date: July 7, 2011Applicant: KABUSHIKI KAISHA TOSHIBAInventor: Seiji HAYASHIDA
-
Publication number: 20110167404Abstract: When writing code, data structures that include inferred symbols are created based on usage of undefined symbols. As the user continues writing code, code model can be updated to represent updated information based on a learning model. Data structures including inferred symbols can be used by software development tools to provide developer help for symbols that are not yet created or are not yet bound. Inferred symbols can be visually distinguishable making the appearance of the inferred symbol information differ from actual symbol information. The appearance of information based on inferred symbols can be included within tools by activating a particular mode in a programming environment. Conversion of the inferred symbol to a real symbol may trigger the automatic compiler-generation of additional source code by a background compiler. Inferred symbols may be converted to actual symbols by activation of an option to make an inferred symbol a real symbol.Type: ApplicationFiled: January 6, 2010Publication date: July 7, 2011Applicant: Microsoft CorporationInventors: Karen Liu, Kevin Pilch-Bisson
-
Patent number: 7971196Abstract: A method and implementing computer system are provided in which selected information is embedded within computer program structures without requiring separate bit strings. In an exemplary embodiment, the embedded selected information includes an identification of a licensed user together with a serial number of the associated licensed program. That information is converted into a binary representation, and a transfer function is used to embed the binary representation into the structure of the licensed program. In the example, when a licensed program is compiled, linked and downloaded over an interconnection network, the order or sequence of the modules of the licensed program is arranged in a manner to correspond to the embedded selected information. The embedded information can then be extracted from the program by analysis of the organization of the modules comprising the program.Type: GrantFiled: December 17, 2007Date of Patent: June 28, 2011Assignee: International Business Machines CorporationInventor: Viktors Berstis
-
Patent number: 7945904Abstract: An architecture that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.Type: GrantFiled: August 22, 2005Date of Patent: May 17, 2011Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, David N. Schach, Avner Y. Aharoni, Peter F. Drayton, Brian C. Beckman, Amanda Silver, Paul A. Vick