Abstract: A computer-implemented method for evaluating a machine-executable software code specification includes using the computer to generate a system dependence graph corresponding to the software code specification. The system dependence graph includes elements including nodes and edges. The computer evaluates the system dependence graph including selecting a variable modified in the software code specification, providing a control operation node of the system dependence graph corresponding to a control statement in the software code specification with a preferred calibration state, traversing to selected elements of the system dependence graph wherein the selected elements are associated with the selected variable and the preferred calibration state of the control operation node, evaluating only the selected elements of the system dependence graph, and identifying ones of the selected elements whereat a state of the selected variable is modified.

Abstract: A computer-implemented method for evaluating a machine-executable software code specification includes using the computer to generate a system dependence graph corresponding to the software code specification. The system dependence graph includes elements including nodes and edges, wherein the computer evaluates the system dependence graph. The evaluation of the system dependence graph includes selecting a variable modified in the software code specification, traversing to selected elements of the system dependence graph, the selected elements associated with the selected variable, evaluating only the selected elements of the system dependence graph, and identifying ones of the selected elements whereat a state of the selected variable is modified.

Abstract: Systems and methods for generating formal software requirements using an informal requirements document having informal requirements and annotations associated with the informal requirements. The systems and methods extract syntax from the annotations and generate artifacts as a function of the syntax.

Abstract: A method and tools for providing precise timing analysis scalable to industrial case studies with large numbers of tasks and messages are provided, including the capability to model and analyze task and message response times; ECU usage; bus usage; end-to-end latency of task/message chains; and timing synchronization problems in task/message graphs. System tasks and messages are modeled in a formalism known as calendar automaton. Models are written in a modeling language such as Promela and instrumented with code specific to the analysis specification. Models and instrumentation are automatically generated from the system description and analysis specification. The system model is subjected to exhaustive state space exploration by a compatible model checker, such as SPIN. During exploration, the instrumented code produces results for different timing analyses.

Abstract: A system and method for automatic formal verification of an executable model includes an assertion monitor configured to verify a system against an assertion in a specification. The assertion monitor includes a parser configured to generate a propositional formula representing the assertion in the specification using Boolean propositions, a filter configured to generate a run of the system using truth assignments for the propositional symbols, and a trace verifier configured to verify the assertion using the run of the system using truth assignments for the propositional symbols and the propositional formula.

Abstract: A method allows for testing software under test (SUT) with respect to a partial design model (PDM) having a boundary which differs from a boundary of the SUT. The method includes recording input information including the SUT, the PDM, and coverage criteria defining a required number of the test cases. Variables in the SUT are identified that correspond to boundary signals for the PDM. Test cases are extracted meeting the coverage criteria. The method may include generating additional test cases at the PDM level and mapping the additional cases with corresponding constraint functions to the boundary of the SUT using a forward/backward propagation and/or heuristics guided technique. A system for testing the SUT includes a host machine and memory. The host machine executes process instructions from memory to identify variables in the SUT that correspond to boundary signals for the PDM, and extracts test cases meeting the coverage criteria.

Abstract: A method for providing writing requirements for a structured transition system employing state machines. The requirements employ a plurality of structuring mechanisms, namely, sub-state based structuring, abstraction based structuring and partial behavior structuring that uses event sequences. The sub-state based structuring has to do with the hierarchical requirements of the state machines, abstraction based structuring provides an abstraction of the state machines that reduces the number of states, and partial behavior structuring looks at certain states to predict how those states will affect other states.

Abstract: A system and method for providing control timing for a vehicle system at the design level. The method includes defining component timing specifications in a parametric form at a system level and at a sub-system level; mathematically representing the timing specifications in a system model; providing a constraint extraction algorithm that extracts timing constraints from the mathematical representations; using the constraint extraction algorithm to generate a plurality of linear equations that define the constraints; solving for real time constraint ranges from parameters in the linear equations; and selecting values from the real time constraint ranges to be used in the mathematical representations. In non-limiting embodiments, the constraint extraction algorithm can be a boundary discovery algorithm or a proof-tree.

Abstract: A method and tools for providing precise timing analysis scalable to industrial case studies with large numbers of tasks and messages are provided, including the capability to model and analyze task and message response times; ECU usage; bus usage; end-to-end latency of task/message chains; and timing synchronization problems in task/message graphs. System tasks and messages are modeled in a formalism known as calendar automaton. Models are written in a modeling language such as Promela and instrumented with code specific to the analysis specification. Models and instrumentation are automatically generated from the system description and analysis specification. The system model is subjected to exhaustive state space exploration by a compatible model checker, such as SPIN. During exploration, the instrumented code produces results for different timing analyses.

Abstract: A computer-implemented method for evaluating a machine-executable software code specification includes using the computer to generate a system dependence graph corresponding to the software code specification. The system dependence graph includes elements including nodes and edges, wherein the computer evaluates the system dependence graph. The evaluation of the system dependence graph includes selecting a variable modified in the software code specification, traversing to selected elements of the system dependence graph, the selected elements associated with the selected variable, evaluating only the selected elements of the system dependence graph, and identifying ones of the selected elements whereat a state of the selected variable is modified.

Abstract: A computer-implemented method for evaluating a machine-executable software code specification includes using the computer to generate a system dependence graph corresponding to the software code specification. The system dependence graph includes elements including nodes and edges. The computer evaluates the system dependence graph including selecting a variable modified in the software code specification, providing a control operation node of the system dependence graph corresponding to a control statement in the software code specification with a preferred calibration state, traversing to selected elements of the system dependence graph wherein the selected elements are associated with the selected variable and the preferred calibration state of the control operation node, evaluating only the selected elements of the system dependence graph, and identifying ones of the selected elements whereat a state of the selected variable is modified.

Abstract: A system and method for generating test cases includes a model inverter configured to generate an inverse of a model, a conversion module configured to convert a requirements specification into at least one output scenario and a model simulator configured to generate a test case that satisfies the requirements specification based on the inverse of the model and the at least one output scenario.

Abstract: A system and method for automatic formal verification of an executable model includes an assertion monitor configured to verify a system against an assertion in a specification. The assertion monitor includes a parser configured to generate a propositional formula representing the assertion in the specification using Boolean propositions, a filter configured to generate a run of the system using truth assignments for the propositional symbols, and a trace verifier configured to verify the assertion using the run of the system using truth assignments for the propositional symbols and the propositional formula.

Abstract: An automatic test-case generation system generates test-cases for validating a test specification for timing constraints, fault tolerances, distributed deadlocks, and synchronization at a system integration level of a distributed system. The automatic test-case generation system includes a model transformer for integrating functional model and platform specification. The functional model relates to an abstract model of at least one controller and the platform specification relates to details of platform components. A test specification transformer integrates platform specification, real-time requirements, and structural coverage criteria for generating an enhanced test specification for testing the distributed system. A requirements transformer integrates real-time requirements and functional requirements for the distributed system.

Abstract: A method for validating a design model includes generating a requirement in the form of an event sequence chart with quantitative constraints and generating a monitor from the event sequence chart, wherein the monitor is configured to validate the design model with respect to the requirement.

Abstract: A method for developing a specification includes receiving a plurality of requirements that define the functionality of the specification, wherein the plurality of requirements are expressed using a formal model. The method further includes analyzing the plurality of requirements using algorithms and determining if the plurality of requirements satisfies a predetermined set of criteria. The method further includes generating a summary of the formal analysis and refining the requirements by incorporating corrected analysis results.

Abstract: A method for providing writing requirements for a structured transition system employing state machines. The requirements employ a plurality of structuring mechanisms, namely, sub-state based structuring, abstraction based structuring and partial behavior structuring that uses event sequences. The sub-state based structuring has to do with the hierarchical requirements of the state machines, abstraction based structuring provides an abstraction of the state machines that reduces the number of states, and partial behavior structuring looks at certain states to predict how those states will affect other states.

Abstract: A system and method for providing control timing for a vehicle system at the design level. The method includes defining component timing specifications in a parametric form at a system level and at a sub-system level; mathematically representing the timing specifications in a system model; providing a constraint extraction algorithm that extracts timing constraints from the mathematical representations; using the constraint extraction algorithm to generate a plurality of linear equations that define the constraints; solving for real time constraint ranges from parameters in the linear equations; and selecting values from the real time constraint ranges to be used in the mathematical representations. In non-limiting embodiments, the constraint extraction algorithm can be a boundary discovery algorithm or a proof-tree.