Symbolic functional evaluation

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

Volumn 1690, Issue , 1999, Pages 341-358

  Day, Nancy A ^a   Joyce, Jeffrey J ^b  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^b Intrepid Critical Software Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER CIRCUITS; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

AUTOMATED ANALYSIS; BETA-REDUCTION; FUNCTIONAL EVALUATION; FUNCTIONAL PROGRAMS; HIGHER ORDER LOGIC; NOVICE USER; THEOREM PROVERS; UNINTERPRETED FUNCTIONS;

THEOREM PROVING;

EID: 84957796376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48256-3_23     Document Type: Conference Paper

References (41)

1. M. D. Aagaard, M. E. Leeser, and P. J. Windley. Towards a super duper hardware tactic. In J. J. Joyce and C.-J. H. Seger, editors, HOL User's Group Workshop. Springer-Verlag, August 1993.
2. J. H. Andrews. Executing formal specifications by translating to higher order logic programming. In TPHOLs, volume 1275 of LNCS, pages 17-32. Springer Verlag, 1997.
3. J. H. Andrews, N. A. Day, and J. J. Joyce. Using a formal description tech- nique to model aspects of a global air tra_c telecommunications network. In FORTE/PSTV'97, 1997.
4. J. M. Atlee and J. Gannon. State-based model checking of event-driven system requirements. IEEE Trans. on Soft. Eng., 19(1):24-40, January 1993.
5. R. Bharadwaj and C. Heitmeyer. Verifying SCR requirements specifications using state space exploration. In Proceedings of the First ACM SIGPLAN Workshop on Automatic Analysis of Software, 1997.
6. R. Boulton et al. Experience with embedding hardware description languages in HOL. In Theorem Provers in Circuit Design, pages 129-156. North-Holland, 1992.
7. R. S. Boyer and J. S. Moore. Proving theorems about LISP functions. Jour. of the ACM, 72(1):129-144, January 1975.
8. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
9. J. R. Burch and D. L. Dill. Automatic verication of pipelined microprocessor control. In CAV, volume 818 of LNCS, pages 68-79. Springer-Verlag, 1994.
10. A. J. Camilleri. Simulation as an aid to verification using the HOL theorem prover. Technical Report 150, University of Cambridge Computer Laboratory, October 1988.
11. A. Cohn. The notion of proof in hardware verification. Journal of Automated Reasoning, 5(2):127-139, June 1989.
12. C. Consel and O. Danvy. Tutorial notes on partial evaluation. In POPL, pages 493-501. ACM Press, 1993.
13. N. Day and J. Joyce. The semantics of statecharts in HOL. In HOL User's Group Workshop, volume 78, pages 338-351. Springer-Verlag, 1993.
14. N. A. Day. A Framework for Multi-Notation, Model-Oriented Requirements Analysis. PhD thesis, Department of Computer Science, University of British Columbia, 1998.
15. N. A. Day, J. J. Joyce, and G. Pelletier. Formalization and analysis of the sepa- ration minima for aircraft in the North Atlantic Region. In Fourth NASA Lang- ley Formal Methods Workshop, pages 35-49. NASA Conference Publication 3356, September 1997.
16. N. A. Day, J. R. Lewis, and B. Cook. Symbolic simulation of microprocessor models using type classes in Haskell. To appear in CHARME'99 poster session.
17. M. Gordon and T. Melham, editors. Introduction to HOL. Cambridge University Press, 1993.
18. M. J. C. Gordon. Combining deductive theorem proving with symbolic state enu- meration. Transparencies from a presentation, summer 1998.
19. M. J. C. Gordon. Mechanizing programming logics in higher-order logic. In Current Trends in Hardware Verification and Automated Theorem Proving, pages 387-439. Springer-Verlag, 1988.
20. D. A. Greve. Symbolic simulation of the JEM1 microprocessor. In FMCAD, volume 1522 of LNCS, pages 321-333. Springer, 1998.
21. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computing, 8:231-274, 1987.
22. M. P. Heimdahl and N. G. Leveson. Completeness and consistency in hierarchical state-based requirements. IEEE Trans. on Soft. Eng., 22(6):363-377, June 1996.
23. C. L. Heitmeyer, R. D. Jefiords, and B. G. Labaw. Automated consistency checking of requirements specifications. ACM Transactions on Software Engineering and Methodology, 5(3):231-261, July 1996.
24. T. Johnsson. E_cient compilation of lazy evaluation. In Proceedings of the ACM Conference on Compiler Construction, pages 122-32, 1984.
25. R. B. Jones, D. L. Dill, and J. R. Burch. E_cient validity checking for processor Verification. In ICCAD, 1995.
26. J. Joyce. Multi-Level Verification of Microprocessor Based Systems. PhD thesis, Cambridge Comp. Lab, 1989. Technical Report 195.
27. J. Joyce, N. Day, and M. Donat. S: A machine readable specification notation based on higher order logic. In International Workshop on the HOL Theorem Proving System and its Applications, pages 285-299, 1994.
28. N. G. Leveson et al. Requirements specification for process-control systems. IEEE Transactions on Software Engineering, 20(9):684-707, September 1994.
29. J. Matthews, B. Cook, and J. Launchbury. Microprocessor specification in Hawk. In International Conference on Computer Languages, 1998.
30. M. Nesi. Value-passing CCS in HOL. In Higher Order Logic Theorem Proving and Its Applications, pages 352-365. LNCS 780, Springer-Verlag, 1993.
31. S. Owre, J. Rushby, and N. Shankar. Analyzing tabular and state-transition re- quirements specifications in PVS. Technical Report CSL-95-12, Computer Science Laboratory, SRI International, April 1996.
32. D. Y. Park, J. U. Skakkebk, M. P. Heimdahl, B. J. Czerny, and D. L. Dill. Checking properties of safety critical specifications using efficient decision procedures. In FMSP'98, 1998.
33. J. Peterson and K. Hammond, editors. Report on the Programming Language Haskell. Yale University, Department of Computer Science, RR-1106, 1997.
34. S. L. Peyton Jones. The Implementation of Functional Programming Languages. International Series in Computer Science. Prentice Hall, 1987.
35. P. S. Rajan. Executing HOL specifications: Towards an evaluation semantics for classical higher order logic. In Higher Order Logic Theorem Proving and its Applications, pages 527-535. North-Holland, 1993.
36. P. S. Rajan. Transformations on Data Flow Graphs. PhD thesis, University of British Columbia, 1995.
37. C.-J. H. Seger. Voss - a formal hardware Verification system: User's guide. Technical Report 93-45, Department of Computer Science, University of British Columbia, December 1993.
38. J. P. Van Tassel. A formalization of the VHDL simulation cycle. In Higher Order Logic Theorem Proving and its Applications, pages 359-374. North-Holland, 1993.
39. M. VanInwegan and E. Gunter. HOL-ML. In Higher Order Logic Theorem Proving and Its Applications, pages 61-74. LNCS 780, Springer-Verlag, 1993.
40. P. J. Windley. The Formal Verification of Generic Interpreters. PhD thesis, University of California, Davis, 1990.
41. P. Zave and M. Jackson. Conjunction as composition. ACM Transactions on Software Engineering and Methodology, 2(4):379-411, October 1993.