Verification of Switch-level designs with many-valued logic

Abstract

Abstract. This p a per i sa n a p proacht oa u tomatedv ericationo fc i r cuitsrepresenteda sswitchleveld esigns.S witchlevelm odels(SLM)a reaw ellestablished frameworkfor modelling l o wlevel p r operties o f c i r cuits. W e u s e m anyvalued propositional l o gic t or e p resenta suitable v ariant o fS L M. L o gical p r o perties o f circuits ( g atelevel) canbe expressedin a standard w ay i nt h e samelogic. A s a resultw ec a ne xpress s o undness o f s w itchleveldesigns w r tt og a televelspecications a sm anyvalueddeductionproblems. R ecent a d vances i n m anyvalued theoremprovingindicatethati ti sp o ssibletoha ndlerea llifeexamples.Wereport rstresultso b tainedwithanexperimentaltheoremprover.

Handbook of Philosophical Logic

“…Here is an example, taken from [Hayes, 1986;Hähnle and Kernig, 1993]: An MOS transistor has different signal strengths at source and drain terminals, due to a physical effect called degradation. Here is an example, taken from [Hayes, 1986;Hähnle and Kernig, 1993]: An MOS transistor has different signal strengths at source and drain terminals, due to a physical effect called degradation.…”

Multi-Valued Logics

“…The literature, which was already large, has grown considerably. Many-valued systems are now being applied in fields like circuit verification [42], analysis of communication with feedback [67], [68], logic programming [28], [20], [29], artificial intelligence [33], program verification [9], non-monotonic reasoning [94], [23], [91], natural language processing [8], [88].…”