Search

Sean David Sandys

from Brooklyn, NY
Age ~51
Get Report
Also known as:
Sean D Sandys, Sean David Sandys As, David S Sandys, Sean D Sandy
Phone and address:
1095 Union St, Brooklyn, NY 11225
(718) 771-7776
Related to:
Violet E Sandy, 82
Connected to:
Patrick R Sandys, 42Laura K Sandzik, 67William J Sandzik, 82Alassane Sane, 58Angela Sane, 70Aniket U Sane, 45Anita S Sane, 61Betty R Sane, 83Cheikh M Sane, 55Crystal Sane, 36

Sean Sandys Phones & Addresses

  • 1095 Union St, Brooklyn, NY 11225 (718) 771-7776 (718) 735-7370
  • 5122 Mayflower St, Seattle, WA 98118
  • Bend, OR
  • Millbrae, CA
  • Williamstown, MA
  • 1095 Union St, Brooklyn, NY 11225 (718) 771-7776

Work

Company: Tyemill Sep 1, 2008 Position: Partner

Education

Degree: Doctorates, Doctor of Philosophy School / High School: University of Washington 1994 to 2002 Specialities: Computer Science

Skills

Software Development • Agile Methodologies • Java • Git • Jquery • Distributed Systems • Ruby on Rails • Javascript • Magento • Linux • Css • Web Development • Software Design • C++ • Cascading Style Sheets • Python • Scalability • Software Engineering

Industries

Computer Software

Resumes

Resumes

Sean Sandys Photo 1

Partner

View page
Location:
1520 15Th Ave east, Seattle, WA 98122
Industry:
Computer Software
Work:
Tyemill
Partner
Batiq.com Apr 2007 - May 2008
Software Engineer
Microsoft Apr 2003 - Apr 2007
Program Manager
Safeware Engineering Corporation 1997 - 1998
Member of Technical Staff
Ibm 1994 - 1994
Research Intern
Education:
University of Washington 1994 - 2002
Doctorates, Doctor of Philosophy, Computer Science Williams College 1990 - 1994
Bachelors, Bachelor of Arts, Computer Science Stuyvesant H.s 1986 - 1990
Stuyvesant High School
Skills:
Software Development
Agile Methodologies
Java
Git
Jquery
Distributed Systems
Ruby on Rails
Javascript
Magento
Linux
Css
Web Development
Software Design
C++
Cascading Style Sheets
Python
Scalability
Software Engineering

Publications

Us Patents

Using Code Analysis For Requirements Management

View page
US Patent:
8312415, Nov 13, 2012
Filed:
Apr 17, 2007
Appl. No.:
11/787884
Inventors:
Gabriel Marius - Kirkland WA, US
Sean Sandys - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
US Classification:
717101, 717100, 717102
Abstract:
Various technologies and techniques are disclosed that allow project requirements to be associated with underlying code elements. A particular software project is analyzed to generate a list of code elements contained in the particular software project. Input is received from a user of a requirements management application to associate one or more project requirements to one or more of the code elements. The project requirements and an association with the one or more code elements are stored in a data store for later retrieval. These associations are used to determine when changes that potentially affect the project requirement are made to the underlying code elements. A software development application is operable to interact with the data store and provide a notice to a user of the software development application that a change to a particular code element of the software project will impact one or more project requirements.

Context Based Code Analysis

View page
US Patent:
8595703, Nov 26, 2013
Filed:
Jan 30, 2006
Appl. No.:
11/343691
Inventors:
Jeffrey van Gogh - Redmond WA, US
Michael C. Fanning - Redmond WA, US
Sean D. Sandys - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
G06F 11/00
US Classification:
717126, 717124, 717101, 714 381
Abstract:
Embodiments provided a formalized set of intermediate analysis contexts that are relevant for analysis checks of target code. Such intermediate analysis context may include, but are not limited to, the development phase of targeted code, the type or state of the targeted code, a source manipulating the targeted code, a purpose for the targeted code, or other development or runtime requirements. Accordingly, embodiments dynamically identify a current analysis context under which targeted code is being developed and can then execute rules based on knowledge of what contexts the rule(s) may apply. More specifically, analysis rules can describe (e. g. , via metadata) those context conditions under which a rule can run. Based on such description and the current context, those rules that have been configured to apply to such context conditions can be executed.

Prioritizing Quality Improvements To Source Code

View page
US Patent:
8627287, Jan 7, 2014
Filed:
Nov 29, 2007
Appl. No.:
11/947606
Inventors:
Michael C Fanning - Redmond WA, US
Nachiappan Nagappan - Redmond WA, US
Thomas J Ball - Mercer Island WA, US
Sean Sandys - Millbrae CA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
G06F 9/45
US Classification:
717124, 717126, 717141
Abstract:
An exemplary method includes receiving source code having a plurality of code segments, providing a desired level of quality for the source code, analyzing the source code to assign a complexity measure to each of the plurality of code segments and assigning a level of code coverage to each of the plurality of code segments based at least in part on the desired level of quality and the complexity measures. An exemplary system prioritizes quality improvements to source code based, in part, on a quality assessment. Such a system can improve code quality by assigning higher test coverage levels to modules with higher complexity.

In Source Code Suppression Of Binary Analysis

View page
US Patent:
20070226690, Sep 27, 2007
Filed:
Feb 8, 2006
Appl. No.:
11/349577
Inventors:
Sean Sandys - Seattle WA, US
Jeffrey van Gogh - Redmond WA, US
Michael Fanning - Redmond WA, US
Nicholas Guerrera - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 9/44
US Classification:
717124000
Abstract:
Upon accessing binary that was generated by a compiler using corresponding source code, a potential reportable problem in the binary is identified. The binary includes a compiler transformed indication that the potential reportable problem is to be suppressed at least under some circumstances. The transformed indication is generated by the compiler using a corresponding untransformed indication in the corresponding source code. The transformed indication is then used to decide that the potential reportable problem should not be reported. Thus, artifacts within the source code itself may ultimately direct what problems are not to be reported on when the corresponding binary is analyzed after the compile phase.

Context Based Code Analysis

View page
US Patent:
20140082595, Mar 20, 2014
Filed:
Nov 19, 2013
Appl. No.:
14/083911
Inventors:
Michael C. Fanning - Redmond WA, US
Sean D. Sandys - Seattle WA, US
International Classification:
G06F 11/36
US Classification:
717126
Abstract:
Embodiments provided a formalized set of intermediate analysis contexts that are relevant for analysis checks of target code. Such intermediate analysis context may include, but are not limited to, the development phase of targeted code, the type or state of the targeted code, a source manipulating the targeted code, a purpose for the targeted code, or other development or runtime requirements. Accordingly, embodiments dynamically identify a current analysis context under which targeted code is being developed and can then execute rules based on knowledge of what contexts the rule(s) may apply. More specifically, analysis rules can describe (e.g., via metadata) those context conditions under which a rule can run. Based on such description and the current context, those rules that have been configured to apply to such context conditions can be executed.

Matching Multidimensional Projections Of Functional Space

View page
US Patent:
20190370231, Dec 5, 2019
Filed:
Aug 15, 2019
Appl. No.:
16/541303
Inventors:
- New York NY, US
Elizabeth Bowling - New York NY, US
Barry Fox - New York NY, US
Daniel Goldman - New York NY, US
Zachary Hall - Seattle WA, US
Jordan Johnson - Seattle WA, US
Elizabeth Prior - New York NY, US
Sean Sandys - Seattle WA, US
Dylan Wengert - Seattle WA, US
Assignee:
Locus LP - New York NY
International Classification:
G06F 16/21
G06Q 30/02
G06F 16/29
G06F 16/248
G06F 16/28
G06F 16/23
G06F 16/2458
G06F 16/901
G06F 16/9535
G06Q 40/06
Abstract:
The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Hyperdimensional Vector Representations For Algorithmic Functional Grouping Of Complex Systems

View page
US Patent:
20190370308, Dec 5, 2019
Filed:
Aug 15, 2019
Appl. No.:
16/542252
Inventors:
- New York NY, US
Daniel Goldman - New York NY, US
Sean Sandys - Seattle WA, US
Assignee:
Locus LP - New York NY
International Classification:
G06F 17/14
G06Q 40/06
G06F 16/21
G06F 16/22
G06F 16/28
G06F 16/2457
Abstract:
A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Representation Of Functional Systems In N-Dimensional Space

View page
US Patent:
20170242825, Aug 24, 2017
Filed:
May 8, 2017
Appl. No.:
15/589922
Inventors:
- Hamilton, BM
James Breitmeyer - New York NY, US
Vin Harng Chew - London, GB
Daniel Goldman - New York NY, US
Sean Sandys - Seattle WA, US
Christopher Silkworth - Brooklyn NY, US
Assignee:
Locus LP - Hamilton
International Classification:
G06F 17/14
G06F 17/30
Abstract:
Computerized techniques can be used for algorithmically determining the composition of elements in a functional system represented in n-dimensional space using a logical data model. Functional attributes can be assigned to an element corresponding to a data entity in a logical data model that comprises at least two fields ordered by a set of interrelationships among at least two elements in the underlying functional system, the interrelationships corresponding to functional properties of a process converting a set of input elements to a set of output elements
Control profile
Sean David Sandys from Brooklyn, NY, age ~51 Get Report