Titlebook: Computer Aided Verification; Fourth International Gregor Bochmann,David Karl Probst Conference proceedings 1993 Springer-Verlag Berlin Heid

electrolyte

Higher-level specification and verification with BDDs, system under verification in terms of Boolean formulas. This modeling can be difficult and error-prone, especially when dealing with constructs like arithmetic, sequential control flow, and complex data structures. We present new techniques for automatically translating these constructs into BDDs.

Narrative

態(tài)學(xué)

Towards a verification technique for large synchronous circuits,nd input constraints as . over the state and input variables is used to make our symbolic simulation based verification approach efficient. The constraints which are encoded through parametric Boolean expressions can involve the Boolean connectives (·, +, ?), the relational operators (<, ≤, >, ≥, ≠,

緯度

珍奇

Timing verification by successive approximation,ion of .-automata .., where each automaton .. is constrained by the bounds on delays. The property . is given as an .-automaton as well, and the verification problem is posed as a language inclusion question .. In constructing the composition . of the constrained automata .., one needs to rule out t