메뉴 건너뛰기




Volumn , Issue , 2012, Pages 683-693

Using dynamic analysis to discover polynomial and array invariants

Author keywords

array invariants; dynamic analysis; invariant generation; nonlinear invariants; program analysis

Indexed keywords

AES ENCRYPTION; ARRAY INVARIANTS; ARRAY VARIABLES; CURRENT DYNAMICS; DYNAMIC INVARIANT DETECTION; DYNAMIC INVARIANTS; DYNAMIC PATTERNS; EQUATION SOLVING; INVARIANT GENERATION; LINEAR RELATION; MATHEMATICAL ALGORITHMS; MULTIPLE DIMENSIONS; NONLINEAR INVARIANTS; NONLINEAR POLYNOMIALS; PROGRAM ANALYSIS; PROGRAM VARIABLES; REFACTORINGS;

EID: 84864217843     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2012.6227149     Document Type: Conference Paper
Times cited : (80)

References (34)
  • 2
    • 0016881880 scopus 로고
    • Affine relationships among variables of a program
    • M. Karr, "Affine relationships among variables of a program," Acta Informitica, vol. 6, pp. 133-151, 1976.
    • (1976) Acta Informitica , vol.6 , pp. 133-151
    • Karr, M.1
  • 4
    • 0016025566 scopus 로고
    • The synthesis of loop predicates
    • B. Wegbreit, "The synthesis of loop predicates," Communication ACM, vol. 17, no. 2, pp. 102-113, 1974.
    • (1974) Communication ACM , vol.17 , Issue.2 , pp. 102-113
    • Wegbreit, B.1
  • 6
    • 0016941016 scopus 로고
    • Logical analysis of programs
    • S. Katz and Z. Manna, "Logical analysis of programs," Communication ACM, vol. 19, no. 4, pp. 188-206, 1976.
    • (1976) Communication ACM , vol.19 , Issue.4 , pp. 188-206
    • Katz, S.1    Manna, Z.2
  • 16
    • 0014973676 scopus 로고
    • Proof of a program: Find
    • January
    • C. A. R. Hoare, "Proof of a program: Find," Communication ACM, vol. 14, pp. 39-45, January 1971.
    • (1971) Communication ACM , vol.14 , pp. 39-45
    • Hoare, C.A.R.1
  • 21
    • 33744926650 scopus 로고    scopus 로고
    • Qepcad b: A system for computing with semi-algebraic sets via cylindrical algebraic decomposition
    • C. W. Brown, "Qepcad b: a system for computing with semi-algebraic sets via cylindrical algebraic decomposition," SIGSAM Bull., vol. 38, no. 1, pp. 23-24, 2004.
    • (2004) SIGSAM Bull , vol.38 , Issue.1 , pp. 23-24
    • Brown, C.W.1
  • 23
    • 34047097816 scopus 로고    scopus 로고
    • Generating all polynomial invariants in simple loops
    • E. Rodríguez-Carbonell and D. Kapur, "Generating all polynomial invariants in simple loops," Journal of Symbolic Computation, vol. 42, no. 4, pp. 443-476, 2007.
    • (2007) Journal of Symbolic Computation , vol.42 , Issue.4 , pp. 443-476
    • Rodríguez-Carbonell, E.1    Kapur, D.2
  • 28
    • 0029180939 scopus 로고
    • Precise interprocedural dataflow analysis via graph reachability
    • San Francisco, California
    • T. Reps, S. Horwitz, and M. Sagiv, "Precise interprocedural dataflow analysis via graph reachability," in Principles of Programming Languages, San Francisco, California, 1995, pp. 49-61.
    • (1995) Principles of Programming Languages , pp. 49-61
    • Reps, T.1    Horwitz, S.2    Sagiv, M.3


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