메뉴 건너뛰기




Volumn , Issue , 2011, Pages 43-50

Mining assumptions for synthesis

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC SYNTHESIS; FORMAL SPECIFICATION; REACTIVE SYSTEM; ROBOTIC CONTROLLERS; SPECIFICATION MINING;

EID: 80052113581     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MEMCOD.2011.5970509     Document Type: Conference Paper
Times cited : (103)

References (31)
  • 1
    • 0003770586 scopus 로고    scopus 로고
    • Cadence smv. http://www.kenmcmil.com/smv.html.
    • Cadence Smv
  • 2
    • 80052109804 scopus 로고    scopus 로고
    • http://www.eecs.berkeley.edu/~wenchaol/files/genbuf.result.
  • 3
    • 80052125914 scopus 로고    scopus 로고
    • http://www.eecs.berkeley.edu/~wenchaol/files/robotic.rat.
  • 4
    • 0023558367 scopus 로고
    • Recognizing safety and liveness
    • 10.1007/BF01782772
    • Bowen Alpern and Fred B. Schneider. Recognizing safety and liveness. Distributed Computing, 2:117-126, 1987. 10.1007/BF01782772.
    • (1987) Distributed Computing , vol.2 , pp. 117-126
    • Alpern, B.1    Schneider, F.B.2
  • 8
    • 35548937893 scopus 로고    scopus 로고
    • Specify, Compile, Run: Hardware from PSL
    • DOI 10.1016/j.entcs.2007.09.004, PII S157106610700583X, Proceesdings of the Worhshop on Complier Optimization meets Complier Verification (COCV 2007)
    • Roderick Bloem, Stefan Galler, Barbara Jobstmann, Nir Piterman, Amir Pnueli, and Martin Weiglhofer. Specify, compile, run: Hardware from psl. Electron. Notes Theor. Comput. Sci., 190:3-16, November 2007. (Pubitemid 350017816)
    • (2007) Electronic Notes in Theoretical Computer Science , vol.190 , Issue.4 , pp. 3-16
    • Bloem, R.1    Galler, S.2    Jobstmann, B.3    Piterman, N.4    Pnueli, A.5    Weiglhofer, M.6
  • 9
    • 4644317319 scopus 로고    scopus 로고
    • Synthesis of open reactive systems from scenario-based specifications
    • February
    • Yves Bontemps, Pierre-Yves Schobbens, and Christof Löding. Synthesis of open reactive systems from scenario-based specifications. Fundam. Inf., 62:139-169, February 2004.
    • (2004) Fundam. Inf. , vol.62 , pp. 139-169
    • Bontemps, Y.1    Schobbens, P.-Y.2    Löding, C.3
  • 10
    • 84944404064 scopus 로고    scopus 로고
    • Temporal-logic queries
    • E. Emerson and A. Sistla, editors, Computer Aided Verification, Springer Berlin / Heidelberg
    • William Chan. Temporal-logic queries. In E. Emerson and A. Sistla, editors, Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 450-463. Springer Berlin / Heidelberg, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1855 , pp. 450-463
    • Chan, W.1
  • 11
    • 77954966349 scopus 로고    scopus 로고
    • A solver for probabilistic games
    • Tayssir Touili, Byron Cook, and Paul Jackson, editors, Computer Aided Verification, Springer Berlin / Heidelberg
    • Krishnendu Chatterjee, Thomas Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. A solver for probabilistic games. In Tayssir Touili, Byron Cook, and Paul Jackson, editors, Computer Aided Verification, volume 6174 of Lecture Notes in Computer Science, pages 665-669. Springer Berlin / Heidelberg, 2010.
    • (2010) Lecture Notes in Computer Science , vol.6174 , pp. 665-669
    • Chatterjee, K.1    Henzinger, T.2    Jobstmann, B.3    Radhakrishna, A.4
  • 14
    • 84947216585 scopus 로고    scopus 로고
    • Efficient Debugging in a Formal Verification Environment
    • Correct Hardware Design and Verification Methods
    • Fady Copty, Amitai Irron, Osnat Weissberg, Nathan P. Kropp, and Gila Kamhi. Efficient debugging in a formal verification environment. In Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME '01, pages 275-292, London, UK, 2001. Springer-Verlag. (Pubitemid 33332735)
    • (2001) Lecture Notes in Computer Science , Issue.2144 , pp. 275-292
    • Copty, F.1    Irron, A.2    Weissberg, O.3    Kropp, N.4    Kamhi, G.5
  • 16
    • 35348872682 scopus 로고    scopus 로고
    • The Daikon system for dynamic detection of likely invariants
    • DOI 10.1016/j.scico.2007.01.015, PII S016764230700161X, Experimental Software and Toolkits
    • Michael D. Ernst, Jeff H. Perkins, Philip J. Guo, Stephen McCamant, Carlos Pacheco, Matthew S. Tschantz, and Chen Xiao. The daikon system for dynamic detection of likely invariants. Sci. Comput. Program., 69(1-3):35-45, 2007. (Pubitemid 350087239)
    • (2007) Science of Computer Programming , vol.69 , Issue.1-3 , pp. 35-45
    • Ernst, M.D.1    Perkins, J.H.2    Guo, P.J.3    McCamant, S.4    Pacheco, C.5    Tschantz, M.S.6    Xiao, C.7
  • 20
    • 34547394959 scopus 로고    scopus 로고
    • Optimizations for LTL synthesis
    • DOI 10.1109/FMCAD.2006.22, 4021017, Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006
    • Barbara Jobstmann and Roderick Bloem. Optimizations for ltl synthesis. In Proceedings of the Formal Methods in Computer Aided Design, FMCAD '06, pages 117-124, Washington, DC, USA, 2006. IEEE Computer Society. (Pubitemid 47159932)
    • (2006) Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006 , pp. 117-124
    • Jobstmann, B.1    Bloem, R.2
  • 23
    • 84857697762 scopus 로고    scopus 로고
    • Debugging unrealizable specifications with model-based diagnosis
    • Lecture Notes in Computer Science. Springer
    • Robert Könighofer, Georg Hofferek, and Roderick Paul Bloem. Debugging unrealizable specifications with model-based diagnosis. In Haifa Verification Conference (HVC), Lecture Notes in Computer Science. Springer, 2010.
    • (2010) Haifa Verification Conference (HVC)
    • Könighofer, R.1    Hofferek, G.2    Bloem, R.P.3
  • 24
    • 77956200046 scopus 로고    scopus 로고
    • Scalable specification mining for verification and diagnosis
    • Wenchao Li, Alessandro Forin, and Sanjit A. Seshia. Scalable specification mining for verification and diagnosis. In DAC '10, pages 755-760, 2010.
    • (2010) DAC '10 , pp. 755-760
    • Li, W.1    Forin, A.2    Seshia, S.A.3
  • 25
    • 34547262497 scopus 로고    scopus 로고
    • From nondeterministic büchi and streett automata to deterministic parity automata
    • DOI 10.1109/LICS.2006.28, 1691236, Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006
    • Nir Piterman. From nondeterministic büchi and streett automata to deterministic parity automata. In 21st Symposium on Logic in Computer Science (LICS06), pages 255-264. IEEE Computer Society, 2006. (Pubitemid 47130371)
    • (2006) Proceedings - Symposium on Logic in Computer Science , pp. 255-264
    • Piterman, N.1
  • 29
  • 30
    • 0016025566 scopus 로고
    • The synthesis of loop predicates
    • Ben Wegbreit. The synthesis of loop predicates. Commun. ACM, 17(2):102-113, 1974.
    • (1974) Commun. ACM , vol.17 , Issue.2 , pp. 102-113
    • Wegbreit, B.1


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