Single-threaded objects in ACL2

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2257, Issue , 2002, Pages 9-27

  Boyer, Robert S ^a   Strother Moore, J ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; FORMAL METHODS; LISP (PROGRAMMING LANGUAGE); SEMANTICS; THEOREM PROVING; VERIFICATION;

COPY ON WRITE; FORMAL SEMANTICS; HARDWARE AND SOFTWARE; MECHANICAL THEOREMS; MODELING AND VERIFICATIONS; PROTOTYPE DESIGNS; SINGLE-THREADED; THEOREM PROVERS;

MODELING LANGUAGES;

EID: 84947269205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45587-6_3     Document Type: Conference Paper

References (18)

1. E. Barendsen and S. Smetsers. Uniqueness typing for functional languages with graph rewriting semantics. In Mathematical Structures in Computer Science 6, pages 579–612. 1996.
2. R. S. Boyer and J S. Moore. A Computational Logic. Academic Press, New York, 1979.
3. R. S. Boyer and J S. Moore. A Computational Logic Handbook, Second Edition. Academic Press, New York, 1997.
4. J.-Y. Girard. Linear logic. In Theoretical Computer Science, volume 50, pages 1–102. 1987
5. D. Greve, M. Wilding, and D. Hardin. High-speed, analyzable simulators. In Kaufmann et al. [9], pages 113–136.
6. David A. Greve. Symbolic simulation of the JEM1 microprocessor. In G. Gopalakrishnan and P. Windley, editors, Formal Methods in Computer-Aided Design – FMCAD, LNCS 1522. Springer-Verlag, 1998.
7. David Hardin, Matthew Wilding, and David Greve. Transforming the theorem prover into a digital design tool: From concept car to off-road vehicle. In Alan J. Hu and Moshe Y. Vardi, editors, Computer-Aided Verification – CAV ’98, volume 1427 of Lecture Notes in Computer Science. Springer-Verlag, 1998. See URL http://pobox.com/users/hokie/docs/concept.ps.
8. P. Hudak. Continuation-based mutable abstract data types, or how to have your state and munge it too. Technical Report YaleU/DCS/RR-914, Department of Computer Science, Yale University, July 1992
9. M. Kaufmann, P. Manolios, and J S. Moore, editors. Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Press, 2000.
10. M. Kaufmann, P. Manolios, and J. S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Press, 2000.
11. Matt Kaufmann and J. Moore. A precise description of the acl2 logic. In http://www.cs.utexas.edu/users/moore/publications/km97a.ps.Z. Department of Computer Sciences, University of Texas at Austin, 1997.
12. J. S. Moore. Rewriting for symbolic execution of state machine models. In Computer-Aided Verification – CAV’01, volume 2102 of Lecture Notes in Computer Science. Springer-Verlag, 2001. See URL http://www.cs.utexas.edu/users/moore/publications/nu-rewriter.
13. G. Plotkin. Call-by-name, call-by-value, and the λ-calculus. In Theoretical Computer Science, volume 1, pages 125–159. 1975.
14. D. Schmidt. Detecting global variables in denotational specifications. ACM Trans. Prog. Lang, 7:299–310, 1985.
15. G. L. Steele Jr. Common Lisp The Language, Second Edition. Digital Press, 30 North Avenue, Burlington, MA 01803, 1990.
16. W. Stoye. Message-based functional operating systems. 6(3):291–311, 1986.
17. P. Wadler. Monads for functional programming. In Advanced Functional Programming. Springer Verlag, LNCS 925, 1995.
18. P. Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240–263, September 1997.