메뉴 건너뛰기




Volumn , Issue , 2003, Pages 45-54

Formal verification at Intel

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; COMPUTER SOFTWARE; FUNCTIONS; THEOREM PROVING; APPLICATION PROGRAMS; BISMUTH; COMPUTER PROGRAMMING; COST FUNCTIONS; DIGITAL ARITHMETIC; HARDWARE; MATHEMATICAL MODELS; OPEN SYSTEMS; SOFTWARE TESTING; TESTING; VERIFICATION;

EID: 0041967527     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (23)

References (49)
  • 1
    • 84957804395 scopus 로고    scopus 로고
    • Lifted-FL: A pragmatic implementation of combined model checking and theorem proving
    • Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, of Nice, France, Springer-Verlag
    • M. D. Aagaard, R. B. Jones, and C.-J. H. Seger. Lifted-FL: A pragmatic implementation of combined model checking and theorem proving. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, volume 1690 of Lecture Notes in Computer Science, pages 323-340, Nice, France, 1999. Springer-Verlag.
    • (1999) Lecture Notes in Computer Science , vol.1690 , pp. 323-340
    • Aagaard, M.D.1    Jones, R.B.2    Seger, C.-J.H.3
  • 2
    • 84863944806 scopus 로고    scopus 로고
    • Symbolic reachability analysis based on SAT-solvers
    • S. Graf and M. Schwartzbach, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), of Springer-Verlag
    • P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT-solvers. In S. Graf and M. Schwartzbach, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1785
    • Abdulla, P.A.1    Bjesse, P.2    Eén, N.3
  • 4
    • 84944319371 scopus 로고    scopus 로고
    • Symbolic model checking without BDDs
    • Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, Springer-Verlag
    • A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer-Verlag, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1579 , pp. 193-207
    • Biere, A.1    Cimatti, A.2    Clarke, E.M.3    Zhu, Y.4
  • 5
    • 0027734290 scopus 로고
    • Boyer-Moore automation for the HOL system
    • L. J. M. Claesen and M. J. C. Gordon, editors, Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications, IMEC, Leuven, Belgium, North-Holland
    • R. Boulton. Boyer-Moore automation for the HOL system. In L. J. M. Claesen and M. J. C. Gordon, editors, Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications, volume A-20 of IFIP Transactions A: Computer Science and Technology, pages 133-142, IMEC, Leuven, Belgium, 1992. North-Holland.
    • (1992) IFIP Transactions A: Computer Science and Technology , vol.A-20 , pp. 133-142
    • Boulton, R.1
  • 6
    • 0008360873 scopus 로고
    • Efficiency in a fully-expansive theorem prover
    • University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, Author's PhD thesis
    • R. J. Boulton. Efficiency in a fully-expansive theorem prover. Technical Report 337, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1993. Author's PhD thesis.
    • (1993) Technical Report , vol.337
    • Boulton, R.J.1
  • 7
    • 0022219498 scopus 로고
    • Symbolic verification of MOS circuits
    • H. Fuchs, editor, Computer Science Press
    • R. E. Bryant. Symbolic verification of MOS circuits. In H. Fuchs, editor, Proceedings of the 1985 Chapel Hill Conference on VLSI, pages 419-438. Computer Science Press, 1985.
    • (1985) Proceedings of the 1985 Chapel Hill Conference on VLSI , pp. 419-438
    • Bryant, R.E.1
  • 8
    • 84958772916 scopus 로고
    • Automatic verification of pipelined microprocessor control
    • D. L. Dill, editor, Computer Aided Verification, 6th International Conference, CAV '94, Stanford CA, USA, Springer-Verlag
    • J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In D. L. Dill, editor, Computer Aided Verification, 6th International Conference, CAV '94, volume 818 of Lecture Notes in Computer Science, pages 68-80, Stanford CA, USA, 1994. Springer-Verlag.
    • (1994) Lecture Notes in Computer Science , vol.818 , pp. 68-80
    • Burch, J.R.1    Dill, D.L.2
  • 10
    • 85037030721 scopus 로고
    • Design and synthesis of synchronization skeletons using branching-time temporal logic
    • D. Kozen, editor, Logics of Programs, York-town Heights, Springer-Verlag
    • E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71, York-town Heights, 1981. Springer-Verlag.
    • (1981) Lecture Notes in Computer Science , vol.131 , pp. 52-71
    • Clarke, E.M.1    Emerson, E.A.2
  • 11
    • 0011644151 scopus 로고    scopus 로고
    • Proving the IEEE correctness of iterative floating-point square root, divide and remainder algorithms
    • 1998-Q2:1-11
    • M. Cornea-Hasegan. Proving the IEEE correctness of iterative floating-point square root, divide and remainder algorithms. Intel Technology Journal, 1998-Q2:1-11, 1998. Available on the Web as http://developer.intel.com/technology/itj/q21998/articles/art.3.htm.
    • (1998) Intel Technology Journal
    • Cornea-Hasegan, M.1
  • 13
    • 0018466858 scopus 로고
    • Social processes and proofs of theorems and programs
    • R. DeMillo, R. Lipton, and A. Perils. Social processes and proofs of theorems and programs. Communications of the ACM, 22:271-280, 1979.
    • (1979) Communications of the ACM , vol.22 , pp. 271-280
    • Demillo, R.1    Lipton, R.2    Perils, A.3
  • 15
    • 0024085326 scopus 로고
    • Program verification: The very idea
    • J. H. Fetzer. Program verification: The very idea. Communications of the ACM, 31:1048-1063, 1988.
    • (1988) Communications of the ACM , vol.31 , pp. 1048-1063
    • Fetzer, J.H.1
  • 19
    • 84957700828 scopus 로고    scopus 로고
    • HOL light: A tutorial introduction
    • M. Srivas and A. Camilleri, editors, Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD'96), Springer-Verlag
    • J. Harrison. HOL Light: A tutorial introduction. In M. Srivas and A. Camilleri, editors, Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD'96), volume 1166 of Lecture Notes in Computer Science, pages 265-269. Springer-Verlag, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1166 , pp. 265-269
    • Harrison, J.1
  • 20
    • 84956853157 scopus 로고    scopus 로고
    • A Mizar mode for HOL
    • J. v. Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, Turku, Finland, Springer-Verlag
    • J. Harrison. A Mizar mode for HOL. In J. v. Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, volume 1125 of Lecture Notes in Computer Science, pages 203-220, Turku, Finland, 1996. Springer-Verlag.
    • (1996) Lecture Notes in Computer Science , vol.1125 , pp. 203-220
    • Harrison, J.1
  • 21
    • 84958964101 scopus 로고    scopus 로고
    • Proof style
    • E. Giménez and C. Paulin-Mohring, editors, Types for Proofs and Programs: International Workshop TYPES'96, Aussois. France, Springer-Verlag
    • J. Harrison. Proof style. In E. Giménez and C. Paulin-Mohring, editors, Types for Proofs and Programs: International Workshop TYPES'96, volume 1512 of Lecture Notes in Computer Science, pages 154-172, Aussois. France, 1996. Springer-Verlag.
    • (1996) Lecture Notes in Computer Science , vol.1512 , pp. 154-172
    • Harrison, J.1
  • 23
    • 0011049941 scopus 로고    scopus 로고
    • Complex quantifier elimination in HOL
    • R. J. Boulton and P. B. Jackson, editors, Division of Informatics, University of Edinburgh, Published as Informatics Report Series
    • J. Harrison. Complex quantifier elimination in HOL. In R. J. Boulton and P. B. Jackson, editors, TPHOLs 2001: Supplemental Proceedings, pages 159-174. Division of Informatics, University of Edinburgh, 2001. Published as Informatics Report Series EDI-INF-RR-0046. Available on the Web at http://www.informatics.ed.ac.uk/publications/report/0046.html.
    • (2001) TPHOLs 2001: Supplemental Proceedings , vol.EDI-INF-RR-0046 , pp. 159-174
    • Harrison, J.1
  • 24
    • 0043136377 scopus 로고    scopus 로고
    • Isolating critical cases for reciprocals using integer factorization
    • IEEE Computer Society Press, To appear
    • J. Harrison. Isolating critical cases for reciprocals using integer factorization. In Proceedings of the 16th IEEE Symposium on Computer Arithmetic. IEEE Computer Society Press, 2003. To appear.
    • (2003) Proceedings of the 16th IEEE Symposium on Computer Arithmetic
    • Harrison, J.1
  • 25
    • 0032296538 scopus 로고    scopus 로고
    • A sceptic's approach to combining HOL and Maple
    • J. Harrison and L. Théry. A sceptic's approach to combining HOL and Maple. Journal of Automated Reasoning, 21:279-294, 1998.
    • (1998) Journal of Automated Reasoning , vol.21 , pp. 279-294
    • Harrison, J.1    Théry, L.2
  • 26
    • 0003589321 scopus 로고
    • IEEE. ANSI/IEEE Standard 754-1985, The Institute of Electrical and Electronic Engineers, Inc., 345 East 47th Street, New York, NY 10017, USA
    • IEEE. Standard for binary floating point arithmetic. ANSI/IEEE Standard 754-1985, The Institute of Electrical and Electronic Engineers, Inc., 345 East 47th Street, New York, NY 10017, USA, 1985.
    • (1985) Standard for Binary Floating Point Arithmetic
  • 27
    • 84949236734 scopus 로고    scopus 로고
    • Divider circuit verification with model checking and theorem proving
    • M. Aagaard and J. Harrison, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, Springer-Verlag
    • R. Kaivola and M. D. Aagaard. Divider circuit verification with model checking and theorem proving. In M. Aagaard and J. Harrison, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 338-355. Springer-Verlag, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1869 , pp. 338-355
    • Kaivola, R.1    Aagaard, M.D.2
  • 31
    • 84961336999 scopus 로고
    • Integrating a first-order automatic prover in the HOL environment
    • M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, University of California at Davis, Davis CA, USA, IEEE Computer Society Press
    • R. Kumar, T. Kropf, and K. Schneider. Integrating a first-order automatic prover in the HOL environment. In M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, Proceedings of the 1991 International Workshop on the HOL theorem proving system and its Applications, pages 170-176, University of California at Davis, Davis CA, USA, 1991. IEEE Computer Society Press.
    • (1991) Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and Its Applications , pp. 170-176
    • Kumar, R.1    Kropf, T.2    Schneider, K.3
  • 33
    • 0025228329 scopus 로고
    • Computation of elementary functions on the IBM RISC System/6000 processor
    • P. W. Markstein. Computation of elementary functions on the IBM RISC System/6000 processor. IBM Journal of Research and Development, 34:111-119, 1990.
    • (1990) IBM Journal of Research and Development , vol.34 , pp. 111-119
    • Markstein, P.W.1
  • 34
    • 0000291586 scopus 로고    scopus 로고
    • Formally verifying IEEE compliance of floating-point hardware
    • 1999-Q1:1-14
    • J. O'Leary, X. Zhao, R. Gerth, and C.-J. H. Seger. Formally verifying IEEE compliance of floating-point hardware. Intel Technology Journal, 1999-Q1:1-14, 1999. Available on the Web as http://developer.intel.com/technology/itj/q11999/articles/art.5.htm.
    • (1999) Intel Technology Journal
    • O'Leary, J.1    Zhao, X.2    Gerth, R.3    Seger, C.-J.H.4
  • 37
    • 0011521703 scopus 로고
    • Every prime has a succinct certificate
    • V. Pratt. Every prime has a succinct certificate. SIAM Journal of Computing, 4:214-220, 1975.
    • (1975) SIAM Journal of Computing , vol.4 , pp. 214-220
    • Pratt, V.1
  • 38
    • 84957646690 scopus 로고
    • Anatomy of the Pentium bug
    • P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, Proceedings of the 5th International Joint Conference on the theory and practice of software development (TAPSOFT'95), Aarhus, Denmark, Springer-Verlag
    • V. R. Pratt. Anatomy of the Pentium bug. In P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, Proceedings of the 5th International Joint Conference on the theory and practice of software development (TAPSOFT'95), volume 915 of Lecture Notes in Computer Science, pages 97-107, Aarhus, Denmark, 1995. Springer-Verlag.
    • (1995) Lecture Notes in Computer Science , vol.915 , pp. 97-107
    • Pratt, V.R.1
  • 39
    • 0001439560 scopus 로고
    • Specification and verification of concurrent programs in CESAR
    • Proceedings of the 5th International Symposium on Programming, Springer-Verlag
    • J. P. Queille and J. Sifakis. Specification and verification of concurrent programs in CESAR. In Proceedings of the 5th International Symposium on Programming, volume 137 of Lecture Notes in Computer Science, pages 195-220. Springer-Verlag, 1982.
    • (1982) Lecture Notes in Computer Science , vol.137 , pp. 195-220
    • Queille, J.P.1    Sifakis, J.2
  • 40
    • 84947910414 scopus 로고
    • An integration of model-checking with automated proof-checking
    • P. Wolper, editor, Computer-Aided Verification: CAV '95, Liege, Belgium, Springer-Verlag
    • S. Rajan, N. Shankar, and M. K. Srivas. An integration of model-checking with automated proof-checking. In P. Wolper, editor, Computer-Aided Verification: CAV '95, volume 939 of Lecture Notes in Computer Science, pages 84-97, Liege, Belgium, 1995. Springer-Verlag.
    • (1995) Lecture Notes in Computer Science , vol.939 , pp. 84-97
    • Rajan, S.1    Shankar, N.2    Srivas, M.K.3
  • 43
    • 0001510331 scopus 로고
    • Formal verification by symbolic evaluation of partially-ordered trajectories
    • C.-J. H. Seger and R. E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6:147-189, 1995.
    • (1995) Formal Methods in System Design , vol.6 , pp. 147-189
    • Seger, C.-J.H.1    Bryant, R.E.2
  • 44
    • 84948975180 scopus 로고    scopus 로고
    • A tutorial on Stålmarck's proof procedure for prepositional logic
    • G. Gopalakrishnan and P. J. Windley, editors, Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design (FMCAD'98), Springer-Verlag
    • M. Sheeran and G. Stålmarck. A tutorial on Stålmarck's proof procedure for prepositional logic. In G. Gopalakrishnan and P. J. Windley, editors, Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design (FMCAD'98), volume 1522 of Lecture Notes in Computer Science, pages 82-99. Springer-Verlag, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1522 , pp. 82-99
    • Sheeran, M.1    Stålmarck, G.2
  • 45
    • 0001381792 scopus 로고
    • Modeling and verifying systems and software in propositional logic
    • B. K. Daniels, editor, Gatwick, UK, Pergamon Press
    • G. Stålmarck and M. Säflund. Modeling and verifying systems and software in propositional logic. In B. K. Daniels, editor, Safety of Computer Control Systems, 1990 (SAFE-COMP '90), pages 31-36, Gatwick, UK, 1990. Pergamon Press.
    • (1990) Safety of Computer Control Systems 1990 (SAFE-COMP '90) , pp. 31-36
    • Stålmarck, G.1    Säflund, M.2
  • 47
    • 84861449103 scopus 로고    scopus 로고
    • Superscalar processor verification using efficient reduction of hte logic of equality with uninterpreted functions to prepositional logic
    • L. Pierre and T. Kropf, editors, Correct Hardware Design and Verification Methods, 10th IFIP WG 10.5 Advanced Research Working Conference, CHARME '99, Bad Herrenalb, Germany, Springer-Verlag
    • M. N. Velev and R. E. Bryant. Superscalar processor verification using efficient reduction of hte logic of equality with uninterpreted functions to prepositional logic. In L. Pierre and T. Kropf, editors, Correct Hardware Design and Verification Methods, 10th IFIP WG 10.5 Advanced Research Working Conference, CHARME '99, volume 1703 of Lecture Notes in Computer Science, pages 37-53, Bad Herrenalb, Germany, 1999. Springer-Verlag.
    • (1999) Lecture Notes in Computer Science , vol.1703 , pp. 37-53
    • Velev, M.N.1    Bryant, R.E.2


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