메뉴 건너뛰기




Volumn 4281 LNCS, Issue , 2006, Pages 35-49

Verification constraint problems with strengthening

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONSTRAINT THEORY; ITERATIVE METHODS; SECURITY SYSTEMS;

EID: 33845934488     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11921240_3     Document Type: Conference Paper
Times cited : (9)

References (23)
  • 1
    • 0033226029 scopus 로고    scopus 로고
    • Introduction to set constraint-based program analysis
    • AIKEN, A. Introduction to set constraint-based program analysis. Science of Computer Programming 35 (1999), 79-111.
    • (1999) Science of Computer Programming , vol.35 , pp. 79-111
    • AIKEN, A.1
  • 2
    • 0026881286 scopus 로고
    • Solving systems of set constraints
    • AIKEN, A., AND WIMMERS, E. Solving systems of set constraints. In LICS (1992), pp. 329-340.
    • (1992) LICS , pp. 329-340
    • AIKEN, A.1    WIMMERS, E.2
  • 3
    • 26444594461 scopus 로고    scopus 로고
    • th Intl. Conference on Computer Aided Verification (CAV) (July 2005), K. Etessami and S. K. Rajamani, Eds., 3576 of LNCS, Springer Verlag, pp. 491-504.
    • th Intl. Conference on Computer Aided Verification (CAV) (July 2005), K. Etessami and S. K. Rajamani, Eds., vol. 3576 of LNCS, Springer Verlag, pp. 491-504.
  • 5
    • 84941176337 scopus 로고    scopus 로고
    • Termination analysis of integer linear loops
    • BRADLEY, A. R., MANNA, Z., AND SIPMA, H. B. Termination analysis of integer linear loops. In CONCUR (2005).
    • (2005) CONCUR
    • BRADLEY, A.R.1    MANNA, Z.2    SIPMA, H.B.3
  • 6
    • 24144470050 scopus 로고    scopus 로고
    • BRADLEY, A. R., MANNA, Z., AND SIPMA, H. B. Termination of polynomial programs. In Proc. of Verification, Model Checking and Abstract Interpretation (VM-CAI) (Paris, Prance, January 2005), R. Cousot, Ed., 3385 of LNCS, Springer Verlag.
    • BRADLEY, A. R., MANNA, Z., AND SIPMA, H. B. Termination of polynomial programs. In Proc. of Verification, Model Checking and Abstract Interpretation (VM-CAI) (Paris, Prance, January 2005), R. Cousot, Ed., vol. 3385 of LNCS, Springer Verlag.
  • 7
    • 35248824647 scopus 로고    scopus 로고
    • Linear invariant generation using non-linear constraint solving
    • Computer Aided Verification July of, Springer-Verlag, pp
    • COLÓN, M., SANKARANARAYANAN, S., AND SIPMA, H. Linear invariant generation using non-linear constraint solving. In Computer Aided Verification (July 2003), vol. 2725 of LNCS, Springer-Verlag, pp. 420-433.
    • (2003) LNCS , vol.2725 , pp. 420-433
    • COLÓN, M.1    SANKARANARAYANAN, S.2    SIPMA, H.3
  • 8
    • 84903179505 scopus 로고    scopus 로고
    • Synthesis of linear ranking functions
    • 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS, April, T. Margaria and W. Yi, Eds, of, Springer Verlag, pp
    • COLÓN, M., AND SIPMA, H. Synthesis of linear ranking functions. In 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (April 2001), T. Margaria and W. Yi, Eds., vol. 2031 of LNCS, Springer Verlag, pp. 67-81.
    • (2001) LNCS , vol.2031 , pp. 67-81
    • COLÓN, M.1    SIPMA, H.2
  • 9
    • 84937566009 scopus 로고    scopus 로고
    • Practical methods for proving program termination
    • th Intl. Conference on Computer Aided Verification, of, Springer Verlag, pp
    • th Intl. Conference on Computer Aided Verification (2002), vol. 2404 of LNCS, Springer Verlag, pp. 442-454.
    • (2002) LNCS , vol.2404 , pp. 442-454
    • COLÓN, M.1    SIPMA, H.2
  • 10
    • 24144488686 scopus 로고    scopus 로고
    • Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming
    • th International Conference (VM-CAI) (2005), pp. 1-24.
    • (2005) th International Conference (VM-CAI) , pp. 1-24
    • COUSOT, P.1
  • 12
    • 0016666456 scopus 로고
    • A closer look at termination
    • KATZ, S. M., AND MANNA, Z. A closer look at termination. Acta Informatica 5, 4 (1975), 333-352.
    • (1975) Acta Informatica , vol.5 , Issue.4 , pp. 333-352
    • KATZ, S.M.1    MANNA, Z.2
  • 14
    • 0036992823 scopus 로고    scopus 로고
    • PAPACHRISTODOULOU, A., AND PRAJNA, S. On the construction of lyapunov functions using the sum of squares decomposition. In CDC (2002).
    • PAPACHRISTODOULOU, A., AND PRAJNA, S. On the construction of lyapunov functions using the sum of squares decomposition. In CDC (2002).
  • 15
    • 84944228451 scopus 로고    scopus 로고
    • A complete method for the synthesis of linear ranking functions
    • PODELSKI, A., AND RYBALCHENKO, A. A complete method for the synthesis of linear ranking functions. In VMCAI (2004), pp. 239-251.
    • (2004) VMCAI , pp. 239-251
    • PODELSKI, A.1    RYBALCHENKO, A.2
  • 16
    • 35048844766 scopus 로고    scopus 로고
    • Safety verification of hybrid systems using barrier certificates
    • HSCC, of, Springer
    • PRAJNA, S., AND JADBABAIE, A. Safety verification of hybrid systems using barrier certificates. In HSCC (2004), vol. 2993 of LNCS, Springer.
    • (2004) LNCS , vol.2993
    • PRAJNA, S.1    JADBABAIE, A.2
  • 17
    • 35248889542 scopus 로고    scopus 로고
    • SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Petri net analysis using invariant generation. In Verification: Theory and Practice (Taurmina, Italy, 2003), N. Derschowitz, Ed., 2772 of LNCS, Springer Verlag, pp. 682-701.
    • SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Petri net analysis using invariant generation. In Verification: Theory and Practice (Taurmina, Italy, 2003), N. Derschowitz, Ed., vol. 2772 of LNCS, Springer Verlag, pp. 682-701.
  • 18
    • 26444610249 scopus 로고    scopus 로고
    • Constraint-based linear relations analysis
    • th Static Analysis Symposium SAS'2004, of, Springer-Verlag, pp
    • th Static Analysis Symposium (SAS'2004) (2004), vol. 3148 of LNCS, Springer-Verlag, pp. 53-68.
    • (2004) LNCS , vol.3148 , pp. 53-68
    • SANKARANARAYANAN, S.1    SIPMA, H.B.2    MANNA, Z.3
  • 19
    • 24344439558 scopus 로고    scopus 로고
    • Constructing invariants for hybrid systems
    • Hybrid Systems: Computation and Control, 7th International Workshop, HSCC 2004, Philadelphia, PA, USA, March 25-27, 2004, Proceedings, of, Springer-Verlag, pp
    • SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Constructing invariants for hybrid systems. In Hybrid Systems: Computation and Control, 7th International Workshop, HSCC 2004, Philadelphia, PA, USA, March 25-27, 2004, Proceedings (2004), vol. 2993 of LNCS, Springer-Verlag, pp. 539-554.
    • (2004) LNCS , vol.2993 , pp. 539-554
    • SANKARANARAYANAN, S.1    SIPMA, H.B.2    MANNA, Z.3
  • 21
    • 24144461197 scopus 로고    scopus 로고
    • SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Scalable analysis of linear systems using mathematical programming. In Proc. of Verification, Model Checking and Abstract Interpretation (VMCAI) (Paris, France, January 2005), R. Cousot, Ed., 3385 of LNCS, Springer Verlag.
    • SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Scalable analysis of linear systems using mathematical programming. In Proc. of Verification, Model Checking and Abstract Interpretation (VMCAI) (Paris, France, January 2005), R. Cousot, Ed., vol. 3385 of LNCS, Springer Verlag.
  • 22
    • 33845928519 scopus 로고    scopus 로고
    • Fixed point iteration for computing the time elapse operator
    • SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Fixed point iteration for computing the time elapse operator. In HSCC (2006).
    • (2006) HSCC
    • SANKARANARAYANAN, S.1    SIPMA, H.B.2    MANNA, Z.3


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