SCOPUS 정보 검색 플랫폼

Computer Journal

Volumn 45, Issue 1, 2002, Pages 37-45

A thread of HOL development

(2) Norrish, Michael a Slind, Konrad a

a UNIVERSITY OF CAMBRIDGE (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; DATA STRUCTURES; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS; SEMANTICS; THEOREM PROVING; USER INTERFACES;

DATATYPE; HARDWARE VERIFICATION; HIGHER-ORDER LOGIC; PROGRAMMING METALANGUAGE;

FORMAL LOGIC;

EID: 0036174502 PISSN: 00104620 EISSN: None Source Type: Journal
DOI: 10.1093/comjnl/45.1.37 Document Type: Article

Times cited : (11)

References (45)

1
- 0003180840
- A formulation of the simple theory of types
- (1940) J. Symbolic Logic , vol.5 , pp. 56-68
- Church, A.¹

2
- 1942545052
- From LCF to HOL: A short history
- In Plotkin, G., Stirling, C. and Tofte, M. (eds); MIT Press, Cambridge, MA
- (2000) Proof, Language and Interaction: Essays in Honour of Robin Milner (Foundations of Computing) , pp. 169-185
- Gordon, M.J.C.¹

3
- 0003630848
- Springer, New York
- (1979) Edinburgh LCF: A Mechanised Logic of Computation. Lecture Notes in Computer Science , vol.78
- Gordon, M.J.C.¹ Milner, R.² Wadsworth, C.P.³

4
- 0004178001
- Gordon, M. J. C. and Melham, T. (eds); Cambridge University Press, Cambridge, UK
- (1993) Introduction to HOL: A Theorem Proving Environment

5
- 0008311745
- An implementation of higher order logic
- Master's Thesis, University of Calgary Computer Science Department. Available as Technical Report 91-419-03
- (1991)
- Slind, K.¹

6
- 0008311995
- A report on ICL HOL
- In Archer, M., Joyce, J. J., Levitt, K. N. and Windley, P. J. (eds); IEEE Computer Society Press, Los Alamitos, CA
- (1991) Proc. 1991 Int. Workshop on the HOL Theorem Proving System and Its Applications , pp. 280-283
- Arthan, R.D.¹

7
- 4243618123
- One way regulator
- International Computers Limited (ICL)
- (1990)

8
- 0003724888
- Springer, New York
- (1994) Isabelle: A Generic Theorem Prover. Lecture Notes in Computer Science , vol.828
- Paulson, L.C.¹

9
- 0002670423
- Technical Report 4.2.1, Abstract Hardware Limited
- (1992) Reference Manual for the LAMBDA System
- Francis, M.¹ Finn, S.² Mayger, E.³ Hughes, R.⁴

10
- 84957700828
- HOL Light: A tutorial introduction
- In Srivas, M. and Camilleri, A. (eds); Springer, New York
- (1996) Proc. First Int. Conf. on Formal Methods in Computer-Aided Design (FMCAD'96). Lecture Notes in Computer Science , vol.1166 , pp. 265-269
- Harrison, J.¹

11
- 84957799469
- A machine-checked theory of floating point arithmetic
- In Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (eds); Springer, Berlin
- (1999) Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs '99. Lecture Notes in Computer Science , vol.1690 , pp. 113-130
- Harrison, J.¹

12
- 0003776693
- The machine-assisted proof of programming language properties
- PhD Thesis, University of Pennsylvania, December
- (1996)
- VanInwegen, M.¹

13
- 0008325309
- A formalization of the process algebra CCS in higher order logic
- Technical Report 278, Computer Laboratory, University of Cambridge, December
- (1992)
- Nesi, M.¹

14
- 0003613448
- C formalised in HOL
- PhD Thesis, Computer Laboratory, University of Cambridge
- (1998)
- Norrish, M.¹

15
- 85028747382
- A package for inductive relation definitions in HOL
- In Archer, M., Joyce, J. J., Levitt, K. N. and Windley, P. J. (eds); IEEE Computer Society Press, Los Alamitos, CA
- (1991) Proc. 1991 Int. Workshop on the HOL Theorem Proving System and Its Applications , pp. 350-357
- Melham, T.¹

16
- 84957890533
- Inductive definitions: Automation and application
- In Schubert, E. T., Windley, P. J. and Alves-Foss, J. (eds); Springer, New York
- (1995) Proc. 8th Int. Workshop on Higher Order Logic Theorem Proving and Its Applications. Lecture Notes in Computer Science , vol.971 , pp. 200-213
- Harrison, J.¹

17
- 84956853741
- A broader class of trees for recursive type definitions for HOL
- In Joyce, J. J. and Seger, C.-J. H. (eds); Springer, New York
- (1994) Higher Order Logic Theorem Proving and Its Applications: 6th International Workshop (HUG'93), Vancouver, BC, August 11-13. Lecture Notes in Computer Science , vol.780 , pp. 141-154
- Gunter, E.L.¹

18
- 84956866968
- Function definition in higher order logic
- Turku, Finland, August. Lecture Notes in Computer Science; Springer, Berlin
- (1996) Theorem Proving in Higher Order Logics , vol.1125 , pp. 381-398
- Slind, K.¹

19
- 4243532666
- Reasoning about terminating functional programs
- PhD Thesis, Institut für Informatik, Technische Universität München
- (1999)
- Slind, K.¹

20
- 84949677024
- Derivation and use of induction schemes in higher order logic
- Murrary Hill, NJ, August. Lecture Notes in Computer Science; Springer, New York
- (1997) Theorem Proving in Higher Order Logics , vol.1275 , pp. 275-290
- Slind, K.¹

21
- 84957666404
- Optimizing proof search in model elimination
- In McRobbie, M. A. and Slaney, J. K. (eds); Springer, New York
- (1996) 13th International Conference on Automated Deduction, New Brunswick, NJ. Lecture Notes in Computer Science , vol.1104 , pp. 313-327
- Harrison, J.¹

22
- 0008360873
- Efficiency in a fully-expansive theorem prover
- PhD Thesis, Computer Laboratory, University of Cambridge, May
- (1994)
- Boulton, R.J.¹

23
- 0009670130
- Solving problems by formula manipulation in logic and linear inequalities
- In Cooper, D. C. (ed); William Kaufmann, London
- (1971) Proc. 2nd Int. Joint Conf. Artificial Intelligence, London, UK, September , pp. 553-559
- Hodes, L.¹

24
- 84976719228
- On the SUP-INF method for proving Presburger formulas
- (1977) J. ACM , vol.24 , pp. 529-543
- Shostak, R.E.¹

25
- 0003669822
- Theorem proving with the real numbers
- CPHC/BCS Distinguished Dissertations. Springer, Berlin
- (1998)
- Harrison, J.¹

26
- 0003083237
- Theorem proving in arithmetic without multiplication
- (1972) Machine Intell. , vol.7 , pp. 91-99
- Cooper, D.C.¹

27
- 0008412757
- A comparison of decision procedures in Presburger arithmetic
- Research Paper 872, Division of Informatics, University of Edinburgh, October
- (1997)
- Janičić, P.¹ Green, I.² Bundy, A.³

28
- 84957617474
- Combining decision procedures in the HOL system
- In Schubert, E. T., Windley, P. J. and Alves-Foss, J. (eds); Springer, New York
- (1995) Proc. 8th Int. Workshop on Higher Order Logic Theorem Proving and Its Applications. Lecture Notes in Computer Science , vol.971 , pp. 75-89
- Boulton, R.J.¹

29
- 0020795684
- A higher order implementation of rewriting
- (1983) Sci. Comp. Programm. , vol.3 , pp. 119-149
- Paulson, L.¹

30
- 0026271590
- Unification of simply typed lambda-terms as logic programming
- In Furukawa, K. (ed.); MIT Press, Cambridge, MA
- (1991) Logic Programming, Proc. Eighth Int. Conf. , pp. 255-269
- Miller, D.¹

31
- 0002457511
- Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic
- (1988) Machine Intell. , vol.11 , pp. 83-124
- Boyer, R.S.¹ Moore, J.S.²

32
- 84949236948
- Programming and computing in HOL
- In Harrison, J. and Aagaard, M. (eds); Springer, Berlin
- (2000) Theorem Proving in Higher Order Logics: 13th Int. Conf., TPHOLs 2000. Lectures Notes in Computer Science , vol.1869 , pp. 17-37
- Barras, B.¹

33
- 84948970435
- Symbolic simulation: An ACL2 approach
- In Gopalakrishnan, G. and Windley, P. (eds); Springer, New York
- (1998) Proc. Second Int. Conf. Formal Methods in Computer-Aided Design (FMCAD'98), November. Lecture Notes in Computer Science , vol.1522 , pp. 334-350
- Moore, J.¹

34
- 0004072686
- Addison-Wesley, Reading, UK
- (1986) Compilers: Principles, Techniques and Tools
- Aho, A.V.¹ Sethi, R.² Ullman, J.D.³

35
- 0014732304
- An efficient context-free parsing algorithm
- (1970) Commun. ACM , vol.13 , pp. 94-102
- Earley, J.¹

36
- 0008360067
- Order-sorted polymorphism in Isabelle
- In Huet, G. and Plotkin, G. (eds); Cambridge University Press, Cambridge, UK
- (1993) Logical Environments , pp. 164-188
- Nipkow, T.¹

37
- 84957804395
- Lifted-FL: A pragmatic implementation of combined model-checking and theorem proving
- In Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (eds); Springer, Berlin
- (1999) Theorem Proving in Higher Order Logics, 12th Int. Conf., TPHOLs '99. Lecture Notes in Computer Science , vol.1690 , pp. 323-340
- Aagaard, M.D.¹ Jones, R.B.² Seger, C.-J.H.³

38
- 84944677742
- PVS: A prototype verification system
- In Kapur, D. (ed.); Springer, Berlin
- (1992) 11th Int. Conf. Automated Deduction. Lecture Notes in Artificial Intelligence , vol.607 , pp. 748-752
- Owre, R.¹ Rushby, J.² Shankar, N.³

39
- 84947910414
- An integration of model-checking with automated proof checking
- Springer, Berlin
- (1995) Conf. Computer-Aided Verification, CAV '95, Liege, Belgium, July. Lecture Notes in Computer Science , vol.939 , pp. 84-97
- Rajan, S.¹ Shankar, N.² Srivas, M.K.³

40
- 84863935630
- The PROSPER toolkit
- In Graf, S. and Schwartzbach, M. (eds); Springer, Berlin
- (2000) Proc. 6th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), Berlin, Germany, March/April. Lecture Notes in Computer Science , vol.1785 , pp. 78-92
- Dennis, L.A.¹ Collins, G.² Norrish, M.³ Boulton, R.⁴ Slind, K.⁵ Robinson, G.⁶ Gordon, M.J.C.⁷ Melham, T.⁸

41
- 84957798748
- Integrating Gandalf and HOL
- In Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (eds); Springer, Berlin
- (1999) Theorem Proving in Higher Order Logics, 12th Int. Conf., TPHOLs '99. Lecture Notes in Computer Science , vol.1690 , pp. 311-321
- Hurd, J.¹

42
- 0031108576
- Gandalf
- (1997) J. Automated Reasoning , vol.18 , pp. 199-204
- Tammet, T.¹

43
- 84957798863
- A HOL conversion for translating linear time temporal logic to ω-automata
- In Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C. and Théry, L. (eds); Springer, Berlin
- (1999) Theorem Proving in Higher Order Logics, 12th Int. Conf., TPHOLs '99. Lecture Notes in Computer Science , vol.1690 , pp. 255-272
- Schneider, K.¹ Hoffmann, D.W.²

44
- 0343396430
- A tutorial on Stålmarck's proof procedure for propositional logic
- (2000) Formal Methods Syst. Design: Int. J. , vol.16 , pp. 23-58
- Sheeran, M.¹ Stålmarck, G.²

45
- 0008400766
- Programming combinations of deduction and BDD-based symbolic calculation
- to appear
- LMS J. Computat. Math.
- Gordon, M.J.C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.