Abstract: The present invention relates to a system for information flow security inference through program slicing. In operation, the system receives an information flow security policy for source code security, refines the information flow security policy, and analyzes the source code to provide refinements as constraints, such that if there is a source code violation of the constraints, the source code is identified for inspection and removal.

Abstract: Described is a system, method, and computer program product for preventing security flaws in untrusted computer source code by implementing information flow security in an existing programming language through use of an information flow security library. Confidentiality and integrity are encoded separately into the security information flow library. A security policy written in the host programming language is typechecked with a host programming language typechecker algorithm. Additionally, an untrusted module written in a restricted subset of the host programming language is typechecked with the host programming language typechecker algorithm. The untrusted modules cannot access confidential data in the host programming language. Typechecking of the untrusted modules enforces the security policy with the security information flow library.

Abstract: A neuromorphic compiler includes a placement module to provide analytic placement of neurons in a neural network description. The analytic placement is to produce placed neurons. The neuromorphic compiler further includes a smoothing module to perform diffusion-based smoothing of the placed neurons; a legalization module to adjust locations of the placed neurons to correspond to legal locations of neuromorphic neurons within a neural fabric; and a simulated annealing module to refine locations of the placed neurons within the neural fabric using simulated annealing following location adjustment by the legalization module. The neural fabric is to implement a synaptic time-multiplexed (STM) neuromorphic network.

Abstract: Described is a cyber security system for digital artifact genetic modeling and forensic analysis. The system identifies the provenance (origin) of a digital artifact by first receiving a plurality of digital artifacts, each digital artifact possessing features. Raw features are extracted from the digital artifacts. The raw features are classified into descriptive genotype-phonotype structures. Finally, lineage, heredity, and provenance of the digital artifacts are determined based on mapping of the genotype-phenotype structures.

Abstract: Embodiments of a system and method for asynchronous explanation and explanation-based constraint problem solving are generally described herein. In one or more embodiments, an apparatus includes an asynchronous constraint satisfaction problem solving module (ACSPSM), the ACSPSM can be executable by one or more processors. The ACSPSM can be configured to propagate at least one constraint to a plurality of variables by reducing a speculative propagation range of a first variable when a first value in the speculative propagation range of the first variable is in conflict with the constraint. The ACSPSM can be configured to update an explanation for the reduction in the speculative propagation range of the first variable, or backtrack when a choice of a second value for a second variable would result in the speculative propagation range of the first variable becoming empty. The ACSPSM can be multi-threaded.

Abstract: A method for access control of an application feature to resources on a mobile computing device. An application is prepared for installation on the mobile computing device via a processor. An application permission associated with the application is identified. The application permission relates to access of resources of the mobile computing device. Restrictions associated with the application permission are determined. A set of mandatory access control rules are defined for the application permission based on the restrictions. The set of mandatory access control rules and the application permission are combined in a loadable mandatory access control policy module. The loadable mandatory access control policy module is stored in a memory of the mobile computing device, the loadable mandatory access control policy module capable of being enforced by an operating system of the mobile computing device.

Abstract: Described is a system, method, and computer program product for ensuring that promises are kept in an anonymous system. A verifiable interaction is established between at least two users. Each user utilizes at least one pseudonym to protect their identity, which is verifiable by a third party. The pseudonyms are stored in an anonymous database controlled by the third party. The invention described herein ensures that at least one user in the verifiable interaction performs an action that is agreed upon between the users. If the user does not perform the action, then that user is prevented from establishing another verifiable interaction by the third party. In a desired aspect, the invention is utilized in an anonymous reputation system to ensure that actions that affect a user's reputation, including those that negatively impact the user's reputation, are performed as agreed upon.

Abstract: Described is a system for managing a multi-user revision control repository which provides multi-level access control. The present invention describes creating configuration files which describe a set of management states of management areas of a repository. The configuration files describe access control to a set of management areas, and the set of management states is stored in the repository to create a self-hosting management implementation. A new commit is processed to the repository by contacting a revision control repository server with a client software, communicating a user's new revision to the revision control repository server, verifying the user's authentication and authorization prior to collecting a new revision with the revision control repository server, and executing a custom script configured to run on the revision control repository server.

Abstract: A synaptic time-multiplexed (STM) neuromorphic network includes a neural fabric that includes nodes and switches to define inter-nodal connections between selected nodes of the neural fabric. The STM neuromorphic network further includes a neuromorphic controller to form subsets of a set of the inter-nodal connections representing a fully connected neural network. Each subset is formed during a different time slot of a plurality of time slots of a time multiplexing cycle of the STM neuromorphic network. In combination, the inter-nodal connection subsets implement the fully connected neural network. A method of synaptic time multiplexing a neuromorphic network includes providing the neural fabric and forming the subsets of the set of inter-nodal connections.

Abstract: Embodiments of a system and method for asynchronous explanation and explanation-based constraint problem solving are generally described herein. In one or more embodiments, an apparatus includes an asynchronous constraint satisfaction problem solving module (ACSPSM), the ACSPSM can be executable by one or more processors. The ACSPSM can be configured to propagate at least one constraint to a plurality of variables by reducing a speculative propagation range of a first variable when a first value in the speculative propagation range of the first variable is in conflict with the constraint. The ACSPSM can be configured to update an explanation for the reduction in the speculative propagation range of the first variable, or backtrack when a choice of a second value for a second variable would result in the speculative propagation range of the first variable becoming empty. The ACSPSM can be multi-threaded.

Abstract: A method for verifying the performance of a real-time system modeled as a timed automaton. An abstract model of the system is checked against an initial Linear Temporal Logic specification. If a path to an undesirable state is found, the counterexample is validated or invalidated using negative cycle detection. If a negative cycle is detected, optimization is undertaken to identify a minimal infeasible fragment in the negative cycle. The specification is then refined to eliminate usage of the minimal infeasible fragment, and the abstract model is then checked against the refined specification.

Abstract: A computer-implemented method includes communicating to a number of agents a first resource negotiation request that includes one or more first parameters each having a corresponding first range of acceptability. The method includes receiving first request responses from each of one or more capable agents each operable to fulfill at least one first parameter within the corresponding first range of acceptability. The method includes determining solution entities based on the first responses, each solution entity including one or more of the capable agents operable to fulfill the one or more parameters of the first request within the corresponding first ranges of acceptability, each capable agent operable to fulfill at least one first parameter within the corresponding first range of acceptability.

Abstract: A method for verifying the performance of a real-time system modeled as a timed automaton. An abstract model of the system is checked against an initial Linear Temporal Logic specification. If a path to an undesirable state is found, the counterexample is validated or invalidated using negative cycle detection. If a negative cycle is detected, optimization is undertaken to identify a minimal infeasible fragment in the negative cycle. The specification is then refined to eliminate usage of the minimal infeasible fragment, and the abstract model is then checked against the refined specification.

Abstract: A computer-implemented method includes communicating to a number of agents a first resource negotiation request that includes one or more first parameters each having a corresponding first range of acceptability. The method includes receiving first request responses from each of one or more capable agents each operable to fulfill at least one first parameter within the corresponding first range of acceptability. The method includes determining solution entities based on the first responses, each solution entity including one or more of the capable agents operable to fulfill the one or more parameters of the first request within the corresponding first ranges of acceptability, each capable agent operable to fulfill at least one first parameter within the corresponding first range of acceptability.