Abstract
DE is an occurrence-oriented description language that permits the hierarchical definition of finite-state machines in the style of a hardware description language. Using ACL2 we have formally defined the DE language. Recognizers for the language are defined. The semantics of the DE language is given by a simulator that, given the current inputs and current state for a module, will compute the module's current outputs and the next state. Our purpose in defining DE is to make the specification of a circuit description as clear as the finite-state languages often used by state-machine exploration algorithms.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Hunt, W.A. (2000). The DE Language. In: Kaufmann, M., Manolios, P., Moore, J.S. (eds) Computer-Aided Reasoning. Advances in Formal Methods, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3188-0_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3188-0_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4981-3
Online ISBN: 978-1-4757-3188-0
eBook Packages: Springer Book Archive