Representation and symbolic manipulation of linearly inductive Boolean functions

Aarti Gupta; Allan L. Fisher

Representation and symbolic manipulation of linearly inductive Boolean functions

Aarti Gupta, Allan L. Fisher

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider a class of practically useful Boolean functions, called Linearly Inductive Functions (LIFs), and present a canonical representation as well as algorithms for their automatic symbolic manipulation. LIFs can be used to capture structural induction in parameterized circuit descriptions, whereby our LIF representation provides a fixed-sized representation for all size instances of a circuit. Furthermore, since LIFs can naturally capture the temporal induction inherent in sequential system descriptions, our representation also provides a canonical form for sequential functions. This allows for a wide range of applications of symbolic LIF manipulation in the verification and synthesis of digital systems. We also present practical results from a preliminary implementation of a general purpose LIF package.

Original language	English (US)
Title of host publication	Proc 1993 IEEE ACM Int Conf Comput Aided Des
Editors	Anon
Publisher	Publ by IEEE
Pages	192-199
Number of pages	8
ISBN (Print)	0818644923
State	Published - 1993
Externally published	Yes
Event	Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design - Santa Clara, CA, USA Duration: Nov 7 1993 → Nov 11 1993

Publication series

Name	Proc 1993 IEEE ACM Int Conf Comput Aided Des

Other

Other	Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design
City	Santa Clara, CA, USA
Period	11/7/93 → 11/11/93

All Science Journal Classification (ASJC) codes

General Engineering

Cite this

@inproceedings{d7f4f007c7d641fba454c76b8d7d41f7,

title = "Representation and symbolic manipulation of linearly inductive Boolean functions",

abstract = "We consider a class of practically useful Boolean functions, called Linearly Inductive Functions (LIFs), and present a canonical representation as well as algorithms for their automatic symbolic manipulation. LIFs can be used to capture structural induction in parameterized circuit descriptions, whereby our LIF representation provides a fixed-sized representation for all size instances of a circuit. Furthermore, since LIFs can naturally capture the temporal induction inherent in sequential system descriptions, our representation also provides a canonical form for sequential functions. This allows for a wide range of applications of symbolic LIF manipulation in the verification and synthesis of digital systems. We also present practical results from a preliminary implementation of a general purpose LIF package.",

author = "Aarti Gupta and Fisher, {Allan L.}",

year = "1993",

language = "English (US)",

isbn = "0818644923",

series = "Proc 1993 IEEE ACM Int Conf Comput Aided Des",

publisher = "Publ by IEEE",

pages = "192--199",

editor = "Anon",

booktitle = "Proc 1993 IEEE ACM Int Conf Comput Aided Des",

note = "Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design ; Conference date: 07-11-1993 Through 11-11-1993",

}

TY - GEN

T1 - Representation and symbolic manipulation of linearly inductive Boolean functions

AU - Gupta, Aarti

AU - Fisher, Allan L.

PY - 1993

Y1 - 1993

N2 - We consider a class of practically useful Boolean functions, called Linearly Inductive Functions (LIFs), and present a canonical representation as well as algorithms for their automatic symbolic manipulation. LIFs can be used to capture structural induction in parameterized circuit descriptions, whereby our LIF representation provides a fixed-sized representation for all size instances of a circuit. Furthermore, since LIFs can naturally capture the temporal induction inherent in sequential system descriptions, our representation also provides a canonical form for sequential functions. This allows for a wide range of applications of symbolic LIF manipulation in the verification and synthesis of digital systems. We also present practical results from a preliminary implementation of a general purpose LIF package.

AB - We consider a class of practically useful Boolean functions, called Linearly Inductive Functions (LIFs), and present a canonical representation as well as algorithms for their automatic symbolic manipulation. LIFs can be used to capture structural induction in parameterized circuit descriptions, whereby our LIF representation provides a fixed-sized representation for all size instances of a circuit. Furthermore, since LIFs can naturally capture the temporal induction inherent in sequential system descriptions, our representation also provides a canonical form for sequential functions. This allows for a wide range of applications of symbolic LIF manipulation in the verification and synthesis of digital systems. We also present practical results from a preliminary implementation of a general purpose LIF package.

UR - http://www.scopus.com/inward/record.url?scp=0027878159&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027878159&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027878159

SN - 0818644923

T3 - Proc 1993 IEEE ACM Int Conf Comput Aided Des

SP - 192

EP - 199

BT - Proc 1993 IEEE ACM Int Conf Comput Aided Des

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design

Y2 - 7 November 1993 through 11 November 1993

ER -

Representation and symbolic manipulation of linearly inductive Boolean functions

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this