Conformance analysis for context-free languages using abstract interpretation요약 해석을 이용한 문맥자유 언어 부합 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 571
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChoe, Kwang-Moo-
dc.contributor.advisor최광무-
dc.contributor.advisorRyu, Suk-Young-
dc.contributor.advisor류석영-
dc.contributor.authorKim, Se-Won-
dc.contributor.author김세원-
dc.date.accessioned2015-04-23T08:30:31Z-
dc.date.available2015-04-23T08:30:31Z-
dc.date.issued2011-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=567311&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/197810-
dc.description학위논문(박사) - 한국과학기술원 : 전산학과, 2011., [ v, 74 p. ]-
dc.description.abstractWe design a string analysis within abstract interpretation framework. To this end, we invent novel predicates which are derived from the reference pushdown automaton. Using these predicates, we design a conjunctive domain whose element is a conjunction of the predicates. We establish the correctness relation by Galois connection and define a correct abstract concatenation operation on the domain. We also present a family of pushdown automata called $\epsilon$ bounded pushdown automata. This family covers all context-free languages. By using this family of pushdown automata, we can prevent abstract values from becoming infinite conjunctions and make sure that all the operations required in the analyzer are computable. We also present a technique for embracing various string operations other than concatenation. We introduce small refinement to the conjunctive domain to design the abstract replace operation. Other various string operations that require more detailed information about the contents of the string are handled by grammar transformations. After all, these grammars are also accommodated to our analysis after abstracting the language of the grammar. Our analysis can be used for any context-free reference language. Using our string analyzer designed in abstract interpretation framework, we can easily compose the string analysis with other analyses to improve the precision, and it is also possible to design modular string analyzer.eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectabstract interpretation-
dc.subjectstring analysis-
dc.subject푸시다운 오토마타-
dc.subject문맥자유 언어-
dc.subject요약 해석-
dc.subject문자열 분석-
dc.subjectpushdown automata-
dc.subjectcontext-free languages-
dc.titleConformance analysis for context-free languages using abstract interpretation-
dc.title.alternative요약 해석을 이용한 문맥자유 언어 부합 분석-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN567311/325007 -
dc.description.department한국과학기술원 : 전산학과, -
dc.identifier.uid020055018-
dc.contributor.localauthorChoe, Kwang-Moo-
dc.contributor.localauthor최광무-
dc.contributor.localauthorRyu, Suk-Young-
dc.contributor.localauthor류석영-
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0