메뉴 건너뛰기




Volumn 7, Issue 2, 2001, Pages 124-140

A practical extension mechanism for decision procedures: The case study of universal presburger arithmetic

Author keywords

Affinization; Augmentation; Decision Procedures; Formal Verification; Lemma Speculation; Universal Arithmetic over Integers; Universal Presburger Arithmetic over Integers

Indexed keywords


EID: 0038010830     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (7)

References (24)
  • 3
    • 84867472116 scopus 로고    scopus 로고
    • Generic Derivation of Congruence Closure Algorithms
    • [ARR00] LORIA-INRIA-Lorraine & DIST-Università di Genova, In preparation
    • [ARR00] A. Armando, S. Ranise, and M. Rusinowitch. Generic Derivation of Congruence Closure Algorithms. Technical report, LORIA-INRIA-Lorraine & DIST-Università di Genova, 2000. In preparation.
    • (2000) Technical Report
    • Armando, A.1    Ranise, S.2    Rusinowitch, M.3
  • 4
    • 0003770507 scopus 로고
    • A Unified Approach to Theory Reasoning
    • [BFP92] Inst. für Informatik (Koblenz)
    • [BFP92] P. Baumgartner, U. Furbach, and U. Petermann. A Unified Approach to Theory Reasoning. Technical report, Inst. für Informatik (Koblenz), 1992.
    • (1992) Technical Report
    • Baumgartner, P.1    Furbach, U.2    Petermann, U.3
  • 7
    • 0002457511 scopus 로고
    • Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic
    • [BM88]
    • [BM88] R.S. Boyer and J S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. Machine Intelligence, 11:83-124, 1988.
    • (1988) Machine Intelligence , vol.11 , pp. 83-124
    • Boyer, R.S.1    Moore, J.S.2
  • 11
    • 0003669822 scopus 로고    scopus 로고
    • [Har96] PhD thesis, Computer Laboratory, University of Cambridge
    • [Har96] J. R. Harrison. Theorem Proving with the Real Numbers. PhD thesis, Computer Laboratory, University of Cambridge, 1996.
    • (1996) Theorem Proving with the Real Numbers
    • Harrison, J.R.1
  • 12
    • 0031124371 scopus 로고    scopus 로고
    • Industrial Strength Theorem Prover for a Logic Based on Common Lisp
    • [KM97]
    • [KM97] M. Kaufmann and J S. Moore. Industrial Strength Theorem Prover for a Logic Based on Common Lisp. IEEE Trans, on Software Engineering, 23(4):203-213, 1997.
    • (1997) IEEE Trans, on Software Engineering , vol.23 , Issue.4 , pp. 203-213
    • Kaufmann, M.1    Moore, J.S.2
  • 15
    • 0010925024 scopus 로고
    • Simplifying Polynomial Constraints over Integers to Make Dependence Analysis More Precise
    • [MP94] Dept. of Computer Science, University of Maryland
    • [MP94] V. Maslov and W. Pugh. Simplifying Polynomial Constraints Over Integers to Make Dependence Analysis More Precise. Technical Report CS-TR-3109.1, Dept. of Computer Science, University of Maryland, 1994.
    • (1994) Technical Report CS-TR-3109.1
    • Maslov, V.1    Pugh, W.2
  • 17
    • 0003579895 scopus 로고
    • STEP: The Stanford Temporal Prover
    • [M+94] Stanford University, June
    • [M+94] Z. Manna and the STeP Group. STEP: The Stanford Temporal Prover. Technical Report CS-TR-94-1518, Stanford University, June 1994.
    • (1994) Technical Report CS-TR-94-1518
    • Manna, Z.1
  • 18
    • 0004173988 scopus 로고
    • Techniques for Program Verification
    • [Nel81] Xerox Palo Alto Research Center, June
    • [Nel81] G. Nelson. Techniques for Program Verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center, June 1981.
    • (1981) Technical Report CSL-81-10
    • Nelson, G.1
  • 19
    • 0011100045 scopus 로고
    • Simplification by Cooperating Decision Procedures
    • [NO78] Stanford Computer Science Department, April
    • [NO78] G. Nelson and D.C. Oppen. Simplification by Cooperating Decision Procedures. Technical Report STAN-CS-78-652, Stanford Computer Science Department, April 1978.
    • (1978) Technical Report STAN-CS-78-652
    • Nelson, G.1    Oppen, D.C.2
  • 20
    • 0022953552 scopus 로고
    • Proving termination of normalization functions for conditional expressions
    • [Pau86]
    • [Pau86] L. C Paulson. Proving termination of normalization functions for conditional expressions. J. of Automated Reasoning, pages 63-74, 1986.
    • (1986) J. of Automated Reasoning , pp. 63-74
    • Paulson, L.C.1
  • 22
    • 0021125949 scopus 로고
    • Deciding Combination of Theories
    • [Sho84]
    • [Sho84] R.E. Shostak. Deciding Combination of Theories. J. of the ACM, 31(1):1-12, 1984.
    • (1984) J. of the ACM , vol.31 , Issue.1 , pp. 1-12
    • Shostak, R.E.1
  • 23
    • 0018918879 scopus 로고
    • Verification Decidability of Presburger Array Programs
    • [SJ80] January
    • [SJ80] N. Suzuki and D. Jefferson. Verification Decidability of Presburger Array Programs. J. of the ACM, 27(1):191-205, January 1980.
    • (1980) J. of the ACM , vol.27 , Issue.1 , pp. 191-205
    • Suzuki, N.1    Jefferson, D.2


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