Patents by Inventor Gary Levin
Gary Levin 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).
-
Patent number: 9736183Abstract: A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving.Type: GrantFiled: July 28, 2014Date of Patent: August 15, 2017Assignee: VENCORE LABS, INC.Inventors: Sanjai Narain, Gary Levin
-
Publication number: 20140337917Abstract: A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving.Type: ApplicationFiled: July 28, 2014Publication date: November 13, 2014Applicant: TT GOVERNMENT SOLUTIONS, INC.Inventors: Sanjai Narain, Gary Levin
-
Patent number: 8826366Abstract: A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving.Type: GrantFiled: July 15, 2010Date of Patent: September 2, 2014Assignee: TT Government Solutions, Inc.Inventors: Sanjai Narain, Gary Levin
-
Patent number: 8805770Abstract: A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values.Type: GrantFiled: May 20, 2011Date of Patent: August 12, 2014Assignee: TT Government Solutions, Inc.Inventors: Sanjai Narain, Gary Levin
-
Patent number: 8724508Abstract: A solution to the problem of automated policy generation for mobile ad hoc networks includes an optimization-based, utility-driven approach aimed at generating optimal policies with respect to the given network objectives. The combination of optimization heuristics and network simulation is used to solve the problem. Specifically, the problem of automated generation of network management policies based on available network plans and related information is solved by converting the policy generation into the following optimization problem: given network information and objectives as input, generate optimal policies as output. The optimization process is guided by a utility function based on performance evaluation criteria reflecting the network objectives.Type: GrantFiled: August 26, 2011Date of Patent: May 13, 2014Assignee: TTI Inventions C LLCInventors: Cho-Yu Jason Chiang, Gary Levin, Yitzchak Gottlieb, Ritu Chadha, Shih-wei Li
-
Patent number: 8554796Abstract: A method is provided for analyzing the semantic content of network configuration files, comprising the steps of accessing configuration files associated with corresponding network components, the files containing commands that define the configuration of those components; transforming the commands into a structural database based, at least in part, on a non-grammatical analysis of the commands, wherein the structure of the commands is represented as the structural database; and constructing a semantic database of the configuration files by querying the structural database.Type: GrantFiled: July 16, 2010Date of Patent: October 8, 2013Assignee: TT Government Solutions, Inc.Inventors: Sanjai Narain, Gary Levin
-
Patent number: 8315966Abstract: A system and method provides a solution to the problem of applying end-to-end requirements of connectivity, security, reliability and performance to configure a network and ultimately assign network components to the network. All requirements are modeled as constraints and a constraint solver does the resolution. Not every constraint to be solved is solved by the model-finder. Instead, we “factor away” subsets of a constraint that can be efficiently solved via a special-purpose constraint solver, such as an SQL/Prolog engine, linear programming system, or even an algorithm, leaving behind a constraint that truly requires the power of model-finding, and that is often efficiently solvable by existing model-finders. Such constraints are compiled into quantifier-free constraints that are Boolean combinations of constraints of two forms x=y and x=c where x, y are variables and c is a constant. Such constraints can be efficiently solved by modern SAT-based model-finders.Type: GrantFiled: November 10, 2008Date of Patent: November 20, 2012Assignee: Telcordia Technologies, Inc.Inventors: Sanjai Narain, Gary Levin, Vikram Kaul, Rajesh Talpade
-
Publication number: 20120250575Abstract: A solution to the problem of automated policy generation for mobile ad hoc networks includes an optimization-based, utility-driven approach aimed at generating optimal policies with respect to the given network objectives. The combination of optimization heuristics and network simulation is used to solve the problem. Specifically, the problem of automated generation of network management policies based on available network plans and related information is solved by converting the policy generation into the following optimization problem: given network information and objectives as input, generate optimal policies as output. The optimization process is guided by a utility function based on performance evaluation criteria reflecting the network objectives.Type: ApplicationFiled: August 26, 2011Publication date: October 4, 2012Inventors: Cho-Yu Jason Chiang, Gary Levin, Yitzchak Gottlieb, Ritu Chadha, Shih-wei Li
-
Publication number: 20120130939Abstract: A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values.Type: ApplicationFiled: May 20, 2011Publication date: May 24, 2012Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Sanjai Narain, Gary Levin
-
Publication number: 20120017260Abstract: A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving.Type: ApplicationFiled: July 15, 2010Publication date: January 19, 2012Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Sanjai Narain, Gary Levin
-
Publication number: 20120016909Abstract: A method is provided for analyzing the semantic content of network configuration files, comprising the steps of accessing configuration files associated with corresponding network components, the files containing commands that define the configuration of those components; transforming the commands into a structural database based, at least in part, on a non-grammatical analysis of the commands, wherein the structure of the commands is represented as the structural database; and constructing a semantic database of the configuration files by querying the structural database.Type: ApplicationFiled: July 16, 2010Publication date: January 19, 2012Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Sanjai Narain, Gary Levin
-
Patent number: 8023423Abstract: A solution to the problem of automated policy generation for mobile ad hoc networks includes an optimization-based, utility-driven approach aimed at generating optimal policies with respect to the given network objectives. The combination of optimization heuristics and network simulation is used to solve the problem. Specifically, the problem of automated generation of network management policies based on available network plans and related information is solved by converting the policy generation into the following optimization problem: given network information and objectives as input, generate optimal policies as output. The optimization process is guided by a utility function based on performance evaluation criteria reflecting the network objectives.Type: GrantFiled: July 6, 2007Date of Patent: September 20, 2011Assignee: Telcordia Licensing Company, LLCInventors: Cho-Yu Jason Chiang, Gary Levin, Yitzchak Gottlieb, Ritu Chadha, Shih-wei Li
-
Publication number: 20090265296Abstract: A system and method provides a solution to the problem of applying end-to-end requirements of connectivity, security, reliability and performance to configure a network and ultimately assign network components to the network. All requirements are modeled as constraints and a constraint solver does the resolution Not every constraint to be solved is solved by the model-finder. Instead, we “factor away” subsets of a constraint that can be efficiently solved via a special-purpose constraint solver, such as an SQL/Prolog engine, linear programming system, or even an algorithm, leaving behind a constraint that truly requires the power of model-finding, and that is often efficiently solvable by existing model-finders. Such constraints are compiled into quantifier-free constraints that are Boolean combinations of constraints of two forms x=y and x=c where x, y are variables and c is a constant. Such constraints can be efficiently solved by modern SAT-based model-finders.Type: ApplicationFiled: November 10, 2008Publication date: October 22, 2009Applicant: TELCORDIA TECHNOLOGIES, INC.Inventors: Sanjai Narain, Gary Levin, Vikram Kaul, Rajesh Talpade
-
Publication number: 20080195360Abstract: A solution to the problem of automated policy generation for mobile ad hoc networks includes an optimization-based, utility-driven approach aimed at generating optimal policies with respect to the given network objectives. The combination of optimization heuristics and network simulation is used to solve the problem. Specifically, the problem of automated generation of network management policies based on available network plans and related information is solved by converting the policy generation into the following optimization problem: given network information and objectives as input, generate optimal policies as output. The optimization process is guided by a utility function based on performance evaluation criteria reflecting the network objectives.Type: ApplicationFiled: July 6, 2007Publication date: August 14, 2008Inventors: Cho-Yu Jason Chiang, Gary Levin, Yitzchak Gottlieb, Ritu Chadha, Shih-wei Li