메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Scaling up the formal verification of Lustre programs with SMT-based techniques

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL LOGIC; INFORMATION THEORY; SURFACE MOUNT TECHNOLOGY;

EID: 58049163322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2008.ECP.19     Document Type: Conference Paper
Times cited : (74)

References (22)
  • 1
    • 33745779915 scopus 로고    scopus 로고
    • Bounded model checking of software using SMT solvers instead of SAT solvers
    • Proceedings of SPIN'06, of, Springer
    • J. M. A. Armando and L. Platania. Bounded model checking of software using SMT solvers instead of SAT solvers. In Proceedings of SPIN'06, volume 3925 of LNCS, pages 146-162. Springer, 2006.
    • (2006) LNCS , vol.3925 , pp. 146-162
    • Armando, J.M.A.1    Platania, L.2
  • 2
    • 38149018410 scopus 로고    scopus 로고
    • Structural abstraction of software verification conditions
    • Springer
    • D. Babic and A. J. Hu. Structural abstraction of software verification conditions. In Proceedings of CAV 2007. pages 366-378. Springer, 2007.
    • (2007) Proceedings of CAV , pp. 366-378
    • Babic, D.1    Hu, A.J.2
  • 5
    • 84947289900 scopus 로고    scopus 로고
    • SAT-based verification without state space traversal
    • Springer
    • P. Bjesse and K. Claessen. SAT-based verification without state space traversal. In Proceedings of FMCAD 2000, pages 372-389, Springer, 2000.
    • (2000) Proceedings of FMCAD , pp. 372-389
    • Bjesse, P.1    Claessen, K.2
  • 6
    • 84944385106 scopus 로고    scopus 로고
    • Improving efficiency of symbolic model checking for state-based system requirements. In M
    • Young, editor, ACM
    • W. Chan, R. J. Anderson, P. Beame, and D. Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In M. Young, editor, In Proceedings of ISSTA 98, pages 102-112. ACM, 1998
    • (1998) Proceedings of ISSTA , vol.98 , pp. 102-112
    • Chan, W.1    Anderson, R.J.2    Beame, P.3    Notkin, D.4
  • 7
    • 84948155079 scopus 로고    scopus 로고
    • Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
    • P. Chauhan et al. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In Proceedings of FMCAD'02 , pages 33-51. 2002.
    • (2002) Proceedings of FMCAD'02 , pp. 33-51
    • Chauhan, P.1
  • 8
    • 58049190120 scopus 로고    scopus 로고
    • K. Claessen. Luke webpage, 2006. http://www.cs.chalmers.se/Cs/Grundutb/ Kurser/form/luke.html.
    • (2006) Luke webpage
    • Claessen, K.1
  • 9
    • 58049135184 scopus 로고    scopus 로고
    • L. de Moura, S. Owre, H. Rueß, J. Rushby, N. Shankar, M. Sorea, and A. Tiwari. SAL 2. In Proceedings of CAV 2004. Springer, 2004.
    • L. de Moura, S. Owre, H. Rueß, J. Rushby, N. Shankar, M. Sorea, and A. Tiwari. SAL 2. In Proceedings of CAV 2004. Springer, 2004.
  • 10
    • 29244482627 scopus 로고    scopus 로고
    • Bounded model checking and induction: From refutation to verification
    • Proceedings of CAV 2003, of
    • L. de Moura, H. Rueß, and M. Sorea. Bounded model checking and induction: From refutation to verification. In Proceedings of CAV 2003, volume 2725 of LNCS, 2003.
    • (2003) LNCS , vol.2725
    • de Moura, L.1    Rueß, H.2    Sorea, M.3
  • 12
    • 58049142846 scopus 로고    scopus 로고
    • Combining SAT solving and integer programming for inductive verification of Lustre programs. Master's thesis, Chalmers University of Technology
    • A. Franzén. Combining SAT solving and integer programming for inductive verification of Lustre programs. Master's thesis, Chalmers University of Technology, 2004.
    • (2004)
    • Franzén, A.1
  • 13
    • 58049162668 scopus 로고    scopus 로고
    • Using satisfiability modulo theories for inductive verification of Lustre programs
    • A. Franzén. Using satisfiability modulo theories for inductive verification of Lustre programs. Electronic Notes in Theoretical Computer Science, 114, 2005.
    • (2005) Electronic Notes in Theoretical Computer Science , vol.114
    • Franzén, A.1
  • 14
    • 46149102489 scopus 로고    scopus 로고
    • Accelerating high-level bounded model checking
    • ACM
    • M. K. Ganai and A. Gupta. Accelerating high-level bounded model checking. In Proceedings of ICCAD'06, pages 794-801. ACM, 2006.
    • (2006) Proceedings of ICCAD'06 , pp. 794-801
    • Ganai, M.K.1    Gupta, A.2
  • 16
  • 17
    • 0026912203 scopus 로고
    • Programming and verifying real-time systems by mans of the synchronous data-flow language LUSTRE
    • N. Halbwachs, F. Lagnier, and C. Ratel. Programming and verifying real-time systems by mans of the synchronous data-flow language LUSTRE. IEEE Transactions in Software Engineering, 18(9):785-793, 1992.
    • (1992) IEEE Transactions in Software Engineering , vol.18 , Issue.9 , pp. 785-793
    • Halbwachs, N.1    Lagnier, F.2    Ratel, C.3
  • 18
    • 0042524429 scopus 로고    scopus 로고
    • Dynamic partitioning in linear relation analysis: Application to the verification of synchronous programs
    • B. Jeannet. Dynamic partitioning in linear relation analysis: Application to the verification of synchronous programs. Formal Methods in System Design, 23:5-37, 2003.
    • (2003) Formal Methods in System Design , vol.23 , pp. 5-37
    • Jeannet, B.1
  • 21
    • 70350787997 scopus 로고    scopus 로고
    • Checking safety properties using induction and a SAT-solver
    • Springer
    • M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a SAT-solver. In Proceedings of FMCAD 2000, pages 108-125. Springer, 2000.
    • (2000) Proceedings of FMCAD , pp. 108-125
    • Sheeran, M.1    Singh, S.2    Stålmarck, G.3


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