Search Results - "Theory of computation Formal languages and automata 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

“…Black-box context-free grammar inference presents a significant challenge in many practical settings due to limited access to example programs. The…”
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

A Relational Theory of Monadic Rewriting Systems, Part I by Gavazzo, Francesco, Faggian, Claudia

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems. The latter are…”
Get full text

Parikh's theorem for infinite alphabets by Hofman, Piotr, Juzepczuk, Marta, Lasota, Slawomir, Pattathurajan, Mohnish

“…We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this…”
Get full text

Positive First-order Logic on Words by Kuperberg, Denis

“…We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable…”
Get full text

SD-Regular Transducer Expressions for Aperiodic Transformations by Dartois, Luc, Gastin, Paul, Krishna, Shankara Narayanan

“…FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order…”
Get full text

First-order definability of rational transductions: An algebraic approach by Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan

“…The algebraic theory of rational languages has provided powerful decidability results. Among them, one of the most fundamental is the definability of a…”
Get full text

Incremental model synchronization for multiple updates by Giese, Holger, Hildebrandt, Stephan

“…One required capability to make the vision of model-driven software development reality is, that changes in the models can be consistently propagated between…”
Get full text

Towards a Basis for Endochronous Functions in Dataflow Process Networks by Theis, Daniel, Schneider, Klaus

“…To ensure deterministic computations, nodes of Kahn process networks must implement sequential functions with blocking read methods. However, while the Kahn…”
Get full text

Term rewriting and lambda calculus by Klop, Jan Willem

Get full text

Omnisc'IO: a grammar-based approach to spatial and temporal I/O patterns prediction by Dorier, Matthieu, Ibrahim, Shadi, Antoniu, Gabriel, Ross, Rob

“…The increasing gap between the computation performance of post-petascale machines and the performance of their I/O subsystem has motivated many I/O…”
Get full text

Graph rewriting and transformation (GReAT): a solution for the model integrated computing (MIC) bottleneck by Agrawal, Aditya

“…Graph grammars and transformations (GGT) have been a field of theoretical study for over two decades. However, it has produced only a handful of practical…”
Get full text

FPGA in Rough-Granular Computing: Reduct Generation by Kopczynski, Maciej, Grzes, Tomasz, Stepaniuk, Jaroslaw

“…In this paper we propose a combination of capabilities of the FPGA based device for computing reduct. Presented architecture has been tested on a real-world…”
Get full text

A formal executable semantics of Verilog by Meredith, Patrick, Katelman, Michael, Meseguer, Jose, Rosu, Grigore

“…This paper describes a formal executable semantics for the Verilog hardware description language. The goal of our formalization is to provide a concise and…”
Get full text

The CommUnity Workbench by Oliveira, Cristovao, Wermelinger, Michel

Get full text

Constraint Based Syntax of Modifiers by Loukanova, R.

“…The paper introduces a technique for grammar rules that licence post-and pre-modified phrases, by using a generalized approach to constraint based lexicalized…”
Get full text

BehaviorScope: Real-Time Remote Human Monitoring Using Sensor Networks by Lymberopoulos, Dimitrios, Bamis, Athanasios, Teixeira, Thiago, Savvides, Andreas

“…In this demonstration we present the Behavior Scope, a system for interpreting human activity patterns using a sensor network and its application to elder…”
Get full text

Rewriting Agent Societies Strategically by Astefanoaei, Lacramioara, Boer, Frank S. de, Dastani, Mehdi

“…In a normative multi-agent system the behaviour of the constituting agents is regulated by means of social and organisational inspired concepts like norms and…”
Get full text

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

“…The length of the microprocessor development cycle is largely determined by functional verification, where contemporary practice relies primarily on…”
Get full text

Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic by Ayala-Rincón, Mauricio, Jacobi, Ricardo P., Carvalho, Luis G. A., Llanos, Carlos H., Hartenstein, Reiner W.

“…Systolic arrays provide a large amount of parallelism. However, their applicability is restricted to a small set of computational problems due to their lack of…”
Get full text