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

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

“…Rewriting is a widely used logic optimization approach incorporated in most commercial logic synthesis tools. In this paper, we present a new rewriting method…”
Get full text

PuRSUE -from specification of robotic environments to synthesis of controllers by Bersani, Marcello M., Soldo, Matteo, Menghi, Claudio, Pelliccione, Patrizio, Rossi, Matteo

“… While formal methods that help developers in the creation and design of robotic applications exist, they must be explicitly customized to be impactful in the robotics domain and to support…”
Get full text

Logical time control of concurrent DES by Béchennec, Jean-Luc, Lime, Didier, Roux, Olivier H.

“…) Automata are an appropriate formalism to model real-time embedded systems but are not easy to use for controller synthesis for two reasons…”
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

Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code by Shashidhar, K. C., Bruynooghe, Maurice, Catthoor, Francky, Janssens, Gerda

“… Currently they have to rely on incomplete and time-consuming simulation. Formal automatic verification of the transformed program against the original is instead desirable…”
Get full text

Invisible formal methods for embedded control systems by Tiwari, A., Shankar, N., Rushby, J.

“… These systems are modeled using a hybrid automaton formalism, which is obtained by combining the discrete transition system formalism with continuous dynamical systems…”
Get full text

Towards a unified proof framework for automated fixpoint reasoning using matching logic by Chen, Xiaohong, Trinh, Minh-Thai, Rodrigues, Nishant, Peña, Lucas, Roşu, Grigore

“…Automation of fixpoint reasoning has been extensively studied for various mathematical structures, logical formalisms, and computational domains, resulting in specialized fixpoint provers for heaps…”
Get full text

Scenario-based verification of real-time systems using Uppaal by Li, Shuhao, Balaguer, Sandie, David, Alexandre, Larsen, Kim G., Nielsen, Brian, Pusinskas, Saulius

“… We make timed extensions to a kernel subset of the LSC language and define a trace-based semantics…”
Get full text

Abstraction of word-level linear arithmetic functions from bit-level component descriptions by Dasgupta, P., Chakrabarti, P., Nandi, A., Krishna, S., Chakrabarti, A.

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

Verification of digital circuits based on formal semantics of a hardware description language by Mutz, Matthias

“… Higher-order Logic serves as the formalism to define the underlying theory…”
Get full text

Virtual prototyping AADL architectures in a polychronous model of computation by Yue Ma, Talpin, J.-P., Gautier, T.

“…While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both synchronous…”
Get full text

Constrained expressions: Adding analysis capabilities to design methods for concurrent software systems by Avrunin, G. S., Dillon, L. K., Wileden, J. C., Riddle, W. E.

“… This formalism provides a rigorous conceptual model for the semantics of concurrent computations, thereby supporting analysis of important system properties as part of the design process…”
Get full text

A formal specification of the object-oriented data model by Um, Yoon-Sup

“…As applications of database systems expand to more data intensive domains (e.g., CAD/CAM, geographic information systems, software engineering, office automation…”
Get full text