Patents by Inventor Kevin Pilch-Bisson
Kevin Pilch-Bisson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20200183667Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: ApplicationFiled: February 17, 2020Publication date: June 11, 2020Inventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
-
Patent number: 10564944Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: GrantFiled: January 7, 2010Date of Patent: February 18, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
-
Patent number: 9298427Abstract: 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: GrantFiled: January 6, 2010Date of Patent: March 29, 2016Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC.Inventors: Karen Liu, Kevin Pilch-Bisson
-
Patent number: 9182980Abstract: An automated programming tool can receive program source code and can expand portions of the program source code to make to make identifiers explicit, insert sets of parenthesis and so on. Expansions can be kept track of so that reductions after refactoring can be confined to altered portions of the program source code.Type: GrantFiled: December 11, 2012Date of Patent: November 10, 2015Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC.Inventors: Dustin R. Campbell, Kevin Pilch-Bisson, Cyrus Najmabadi, David J. Poeschl, Vladimir Reshetnikov
-
Patent number: 8875089Abstract: A workspace model generates a component of a solution from an immutable object representing the solution at a given point in time. A component may be requested by an extension to an integrated development environment for the extension's use. The workspace model determines a sequence of operations needed to construct the requested component at the time the component is requested using the state of the solution represented through the immutable object. The immutable object allows the extension to access the requested component while the integrated development environment is used to alter the solution.Type: GrantFiled: December 5, 2011Date of Patent: October 28, 2014Assignee: Microsoft CorporationInventors: Matt Warren, Cyrus Najmabadi, Heejae Chang, Jason Malinowski, Kevin Pilch-Bisson, Dustin Campbell
-
Publication number: 20140165035Abstract: An automated programming tool can receive program source code and can expand portions of the program source code to make to make identifiers explicit, insert sets of parenthesis and so on. Expansions can be kept track of so that reductions after refactoring can be confined to altered portions of the program source code.Type: ApplicationFiled: December 11, 2012Publication date: June 12, 2014Applicant: Microsoft CorporationInventors: Dustin R. Campbell, Kevin Pilch-Bisson, Cyrus Najmabadi, David J. Poeschl, Vladimir Reshetnikov
-
Publication number: 20130145343Abstract: A workspace model generates a component of a solution from an immutable object representing the solution at a given point in time. A component may be requested by an extension to an integrated development environment for the extension's use. The workspace model determines a sequence of operations needed to construct the requested component at the time the component is requested using the state of the solution represented through the immutable object. The immutable object allows the extension to access the requested component while the integrated development environment is used to alter the solution.Type: ApplicationFiled: December 5, 2011Publication date: June 6, 2013Applicant: Microsoft CorporationInventors: MATT WARREN, Cyrus Najmabadi, Heejae Chang, Jason Malinowski, Kevin Pilch-Bisson, Dustin Campbell
-
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
-
Publication number: 20110167088Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: ApplicationFiled: January 7, 2010Publication date: July 7, 2011Applicant: Microsoft CorporationInventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
-
Publication number: 20100235730Abstract: A consume-first mode for an editor is automatically entered if one or more predefined heuristic conditions are met. Some examples of heuristic conditions include conditions indicating that a user will be entering computer program source code during test-driven development, user action to undo autocompletion, and expected entry of a dynamically typed item identifier. In addition to heuristic consume-first mode, some editors recognize an explicit command to enter or exit the consume-first mode. A list of completion suggestions may be displayed in the consume-first mode, but autocompletion is turned off. An identifier may also be preemptively included on a suggested completions list for use before a user has entered that identifier using the editor.Type: ApplicationFiled: March 13, 2009Publication date: September 16, 2010Applicant: MICROSOFT CORPORATIONInventors: Dustin Campbell, Karen Liu, Kevin Pilch-Bisson, Thomas Peter Meschter