Work

A language for boolean function representation and manipulation

Year: 1976
Type: conference-paper
Abstract: Boolean algebra is used extensively in the analysis and design of digital logic circuits, in the generation of test patterns for logic circuits, and in numerous other practical applications. Hand calculations involving Boolean equations become impractical when the equations involve a large number of variables or when the number of equations is large. Computerized processing of Boolean equations can significantly extend the range of problems that can be solved using Boolean algebra.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.
Institution: Auburn University
Language: English
Open Access status: bronze
OpenAlex ID: W2094768107
FWCI:
Cites: 5
Cited by:
Related to: 10