ABAL(ID:7892/aba001)

Teaching language for Boolean algebra 

for Auburn Boolean Algebra Language

Iong Chen and B. D. Carroll  Auburn University, Auburn, Alabama 1976

Teaching language to enable machine representation and manipulation of Boolean functions
Related languages
ABAL => BASIC-PLUS   Written using
References:
  • Carroll, B. D. "A Simulator for Undergraduate Logic Courses" view details
          in Computers in Education Symposium of IEEE Transactions, 7(5) May 1975 view details
  • Chen, Long and B. D. Carroll "A language for boolean function representation and manipulation" view details 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. DOI
          in [ACM] Proceedings of the 14th annual ACM Southeast Regional Conference 1976, Birmingham, Alabama view details
  • Chen, Iong "A language for Boolean function representation and manipulation" PhD Auburn university 1977 view details
          in [ACM] Proceedings of the 14th annual ACM Southeast Regional Conference 1976, Birmingham, Alabama view details