DocumentCode
750726
Title
ABAL-a language for boolean function representation and manipulation
Author
Chen, Iong ; Carroll, B.D.
Volume
20
Issue
1
fYear
1977
Firstpage
70
Lastpage
72
Abstract
A language ABAL (Auburn Boolean Algebra Language) is described in this paper that permits machine representation and manipulation of Boolean functions. Functions may be specified in algebraic form or as lists of minterms or maxterms. Types of operations available in the language include functional form changes, simplification rules, prime implicant or prime implicate generation, functional minimization, functional combinations using Boolean operators, and truth table generation. ABAL is written in Basic-Plus for execution on a DEC PDP 11/40 RSTS/E System.
Keywords
Boolean algebra; Boolean functions; Circuit testing; Equations; High level languages; Large scale integration; Logic circuits; Minimization; Pattern analysis; Test pattern generators;
fLanguage
English
Journal_Title
Education, IEEE Transactions on
Publisher
ieee
ISSN
0018-9359
Type
jour
DOI
10.1109/TE.1977.4321109
Filename
4321109
Link To Document