Microsoft Technology Licensing, LLC

Lucent Technologies Inc.

At+t Corp.

Thomas J Ball

Peter Andrew Mataga

Kenneth G Rehor

Sriram K Rajamani

Stephen Edward Hodges

Frederick Douglis

Jonathan Paul De Halleux

Lalita Jategaonkar Jagadeesan

Michal J Moskal

Michael Abraham Benedikt

Curtis Duane Tuckey

Peter John Danielsen

James Alexander Devine

Gabriele D'amone

Carlos Miguel Puchol

Graham John Wills

Stephen Gregory Eick

Shuvendu K Lahiri

Vladimir A Levin

Todd David Millstein

David L Atkins

Rupak Majumdar

Konstantin Laufer

Eleonora O Bounimova

Michael C Fanning

Yih-Farn Robin Chen

Yuan Yu

Nachiappan Nagappan

Sean Sandys

Kenneth Charles Cox

Rebecca Elizabeth Grinter

Rahul Sudhir Kumar

Leonardo Mendonca De Moura

Eleftherios Koutsofios

Glenn R Bruns

Stacie Lynn Hibino

David Alejandro Mantilla

The description relates to prototyping systems, including hubs for electrically connecting devices. One example can include an electrically insulative substrate and at least two connector tabs defined by the substrate, each connector tab including a data contact, a power contact, and a ground contact positioned over the substrate. A data bus can be positioned relative to the substrate and electrically connect all of the data contacts, a power bus can be positioned relative to the substrate and electrically connect all of the power contacts, and a ground bus can be positioned relative to the substrate and electrically connect all of the ground contacts.

Electronic prototyping

The description relates to prototyping systems, including hubs for electrically connecting devices. One example can include an electrically insulative substrate and at least two connector tabs defined by the substrate. Each connector tab can include a data contact a power contact and a ground contact positioned on the substrate. A data bus can be positioned relative to the substrate and electrically connect all of the data contacts, a power bus can be positioned relative to the substrate and electrically connect all of the power contacts and a ground bus can be positioned relative to the substrate and electrically connect all of the ground contacts in accordance with a first prototyping format. The example can also include adapter contacts positioned on the substrate and configured to electrically connect to a data contact, a power contact, and a ground contact of another device that complies with a second different prototyping format.

Electronic prototyping interoperability

The description relates to electronic prototyping platforms. One example can include an electrically insulative substrate having generally opposing first and second major surfaces and that includes an orientation feature that is visible on both of the first and second major surfaces. The example can include a first mounting hole through the substrate that is bordered by a first electrical conductor associated with data transmission. The example can also include a second mounting hole through the substrate that is bordered by a second electrical conductor associated with electrical ground, and a third mounting hole through the substrate that is bordered by a third electrical conductor associated with electrical power. The example can also include an edge connector tab defined by the substrate and having three exposed electrically conductive contacts that are coupled to the data electrical conductor, the ground electrical conductor, and the power electrical conductor and insulated from one another.

Modular electronic prototyping platforms

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.

Prioritizing quality improvements to source code

A system is described for processing predicates in the course of analyzing a program, based on a general-purpose theory of pointers. The system converts location expressions in the predicates into logical formulae that are interpretable by a theorem prover module, producing converted predicates. This conversion associates the location expressions with location objects. More specifically, the conversion represents variables as explicitly-specified location objects, and location terms (such as a field-type access terms and dereference-type terms) as constructor-specified location objects. The theory of pointers is also expressed by a set of axioms which constrain the operation of the theorem prover module.

Processing predicates including pointer information

An analysis engine is described for performing static analysis using CEGAR loop functionality, using a combination of forward and backward validation-phase trace analyses. The analysis engine includes a number of features. For example: (1) the analysis engine can operate on blocks of program statements of different adjustable sizes; (2) the analysis engine can identify a subtrace of the trace and perform analysis on that subtrace (rather than the full trace); (3) the analysis engine can form a pyramid of state conditions and extract predicates based on the pyramid and/or from auxiliary source(s); (4) the analysis engine can generate predicates using an increasingly-aggressive series of available discovery techniques; (5) the analysis engine can selectively concretize procedure calls associated with the trace on an as-needed basis and perform other refinements; and (6) the analysis engine can add additional verification targets in the course of its analysis, etc.

Program analysis through predicate abstraction and refinement

A library or application is selected comprising one or more functions or methods. An interesting subset of the functions or methods is created. A plurality of multi-threaded test cases are generated from the subset of interesting functions or methods, with each test case comprising a unique pair or triple of functions or methods from the subset. The resulting set of test cases may then be filtered of thread safe test cases using static analysis techniques. The filtered set of test cases is then used as an input to a specialized application that executes each of the multi-threaded test cases to detect atomicity violations and race conditions. The results of the execution of each of the test cases by the specialized application are then aggregated and presented to a user or administrator in a report, for example.

Automatic and systematic detection of race conditions and atomicity violations

Methods are discussed that enhance program analysis. One aspect of the invention includes a method for checking a model of a program. The method includes a control-flow graph having vertices from the model, applying a transfer function to each vertex to form a set of path edges, and analyzing the set of path edges of a vertex. The set of path edges includes valuations that are implicitly represented so as to inhibit an undesired explosion in the valuations that would hinder the act of analyzing.

Method for enhancing program analysis

Described is a method that enables the automatic generation of a boolean program that is a predicate abstraction of a program written using a general programming language. The method is capable of abstracting code statements within the program that include procedure calls, assignments, goto statements, conditionals, and pointers. In accordance with the invention, predicates of interest are identified for each code statement in the program. For each particular code statement, the process generates predicate statements that describe an effect that the statement has on the predicates of interest. If the effect of a particular code statement is indeterminable, non-deterministic predicate statements are included in the boolean program to model the indeterminable nature of the code statement. In addition, if a particular code statement includes a procedure call, the arguments and return value of the procedure call are translated to associated predicates in the calling context.

System and method for generating a predicate abstraction of a program

Predicate abstraction techniques and tools. Using symbolic decision procedures, predicate abstractions for computer programs are generated based on a set of predicates representing observations of expected behavior of the program. The set of predicates may be generated by an automatic program analysis tool or may be provided a user based on the user's observations. The predicate abstraction process may employ binary decision diagrams. Two or more symbolic decision procedures (e.g., for different kinds of program logic) can be combined to form a combined symbolic decision procedure to be used for predicate abstraction. A data structure can be used to track derived predicates during predicate abstraction.

Predicate abstraction via symbolic decision procedures

Techniques and tools for achieving improved test coverage in a finite program state space are described, such as a technique for selecting a set of predicates, calculating a set of possible predicate values, calculating a subset of the set of possible predicate values, and generating a test for the computer program based at least in part on the subset. The subset comprises an approximation (e.g., an under-approximation) of reachable states in the program. A superset of the set of possible predicate values also can be calculated; the superset comprises an over-approximation of the reachable states in the program. In another aspect, a Boolean abstraction of a program is generated, reachability analysis is performed based at least in part on the Boolean abstraction, and symbolic execution is performed to generate test data. The reachability analysis can include computing lower and/or upper bounds of reachable observable states.

Predicate-based test coverage and generation

Methods for enhancing program analysis

A natural language-based interface data presentation system interfaces, for example, information visualization system interfaces, is realized by employing so-called open-ended natural language inquiries to the interface that translates them into database queries and a set of information to be provided to a user. More specifically, a natural language inquiry is translated to database queries by determining if any complete database queries can be formulated based on the natural language inquiry and, if so, specifying which complete database queries are to be made. In accordance with one aspect of the invention, knowledge of the information visualization presentation is advantageously employed in the interface to guide a user in response to the user's natural language inquiries. In accordance with another aspect of the invention, knowledge of the database and knowledge of the information visualization presentation are advantageously employed in the interface to guide a user in response to the user's natural language inquiries. In accordance with still another aspect of the invention, knowledge of the database, knowledge of the information visualization presentation and context information about the query dialogue are advantageously employed in the interface to guide a user in response to the user's natural language inquiries. In one or more first prescribed embodiments of the invention, the set of data presentation information can be in audio, visual, or both audio-visual form. In one or more other prescribed embodiments of the invention, the inquiry and data presentation information delivery process can be interactive between the user and the interface. In one or more still other prescribed embodiments of the invention, one or more modes of user-interface interaction can be utilized. These modes of interaction can include text, speech, point and click, or the like.

User interface for translating natural language inquiries into database queries and data presentations

Interactive services with multiple interfaces are realized by employing a modular approach to their implementation. Such an approach facilitates supporting natural language understanding interaction with users through use of interfaces that at least allow the user to provide information beyond what is currently being requested by the service, and/or different ordering of inputs, and/or incomplete information, and/or correction of information, and/or the return of control to prior points in the service. This is realized, in an embodiment of the invention, by employing an interactive service logic that uses &ldquo;reactive constraint graphs&rdquo;, i.e., a form of event-driven graph in which nodes contain constraints on events, in conjunction with a service monitor. The service monitor manages the communication between the service logic and the multiple user interfaces. As such it provides a communication mechanism in the form of a so-called &ldquo;look ahead&rdquo; in which the user can input information beyond what is currently required by the interactive service. Specifically, in each round of user interaction, reactive constraint graphs report to the service monitor the set of events that are currently enabled. These enabled events correspond to the information the interactive service is currently requesting (or ready to accept) from a user. The user interfaces collect information (perhaps beyond this set) from the user and send it to the service monitor. The service monitor then matches the received information against the information requested by the service logic, and sends the information one event at a time to the service logic, in a priority order specified by the service provider. After each event is sent to the service logic from the service monitor, the service logic reports its new set of enabled events back to the service monitor. In turn, the service monitor sends another event that matches the enabled events to the service logic. The service monitor then notifies the user interfaces to send a new collection, i.e., set, of information from the individual users only when no current information matches the enabled events. This approach advantageously allows a user to input information beyond what is currently needed by the interactive service.

Method and apparatus for providing interactive services with multiple interfaces

Growing community of inventors

Mercer Island, WA, United States of America

Thomas J Ball