Search Results - Theory of computation Formal languages and automation theory Formalisms Rewrite systems

Incremental Context-free Grammar Inference in Black Box Settings by Li, Feifei, Chen, Xiao, Xiao, Xi, Sun, Xiaoyu, Chen, Chuan, Wang, Shaohua, Han, Jitao

“… We have observed that these approaches suffer from low quality and readability, primarily because they process entire example strings, adding to the complexity and substantially slowing down computations…”
Get full text

A Database Dependent Framework for K-Input Maximum Fanout-Free Window Rewriting by Zhu, Xuliang, Tang, Ruofei, Chen, Lei, Li, Xing, Huang, Xin, Yuan, Mingxuan, Sheng, Weihua, Xu, Jianliang

“…) and rewrites with a more compact implementation. Both exact synthesis and heuristic methods can be adopted to optimize MFFWs…”
Get full text

Directed-Logical Testing for Functional Verification of Microprocessors by Katelman, M., Meseguer, J., Escobar, S.

“… to drive a simulation-based methodology. However, formal methods are, in particular, gaining wider adoption and are seen as having potential to bridge large gaps left by current techniques…”
Get full text

Application of term rewriting techniques to hardware design verification by Chandrasekhar, M. S., Privitera, J. P., Conradt, K. W.

“…Term rewriting systems have been used in automatic theorem proving. A canonical term rewriting system for Boolean algebra recently discovered, and a refutation…”
Get full text