Sciweavers

1419 search results - page 66 / 284
» Notes on Formalizing Context
Sort
View
94
Voted
DLT
2004
15 years 2 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
98
Voted
FMCO
2003
Springer
145views Formal Methods» more  FMCO 2003»
15 years 5 months ago
Causality and Scheduling Constraints in Heterogeneous Reactive Systems Modeling
Recently we proposed a mathematical framework offering diverse models of computation and a formal foundation for correct-byconstruction deployment of synchronous designs over dist...
Albert Benveniste, Benoît Caillaud, Luca P. ...
FMCAD
2008
Springer
15 years 2 months ago
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance
The quality of formal specifications and the circuits they are written for can be evaluated through checks such as vacuity and coverage. Both checks involve mutations to the specif...
Orna Kupferman, Wenchao Li, Sanjit A. Seshia
CSMR
2006
IEEE
15 years 6 months ago
A Refactoring-based Tool for Software Component Adaptation
Abstract— Adapting software components usable by a particular application is a crucial issue in software component based technology. In fact, software components can be used in c...
Gautier Bastide
DRMTICS
2005
Springer
15 years 6 months ago
Call Tree Transformation for Program Obfuscation and Copy Protection
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
Valery Pryamikov