International Business Machines Corporation

Yoad Lustig

Ohad Shacham

Rachel Tzoref

Daniel Geist

Mark Ginzburg

Ishai Rabinovitz

Ishai Rabinovotz

Systems and methods that use a solver to find bugs in a target model of a computing system having one or more finite computation paths are provided. The bugs on computation paths of less than a predetermined length are detected by translating the target model to include a state variable AF for one or more states of the target model, wherein AF(S) represents value of the state variable AF at state S; and solving the translated version of the target model that satisfies predetermined constrains.

Satisfiability (SAT) based bounded model checkers

A method uses a SAT solver operating to cycle k to find bugs in a model having finite computation paths therein, wherein said bugs are on computation paths of less than length k. Another method includes adding an additional state variable to a model to be checked, where a governing state machine of the additional variable has a 'sink' state. The method includes having a translation using the additional variable whenever a state indicates a bad state and performing satisfiability solving with the model and the translation.

Growing community of inventors

Jerusalem, Israel

Yoad Lustig