Gm Global Technolgoy Operations, Inc.

Manoj G Dixit

Ramesh Sethu

Swarup Kumar Mohalik

Pallab Dasgupta

Rajeev Ariyattu Chandrasekharan

Arun Chakrapani Rao

Devesh B Chokshi

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.

Systems and methods for generating high-quality formal executable software feature requirements

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. Optimization techniques are provided to generate models which require less memory and time for analysis and make the method scalable to large, industrial case studies.

Timing analysis using formal methods

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.

Growing community of inventors

Bengaluru, India

Manoj G Dixit