Sciweavers

2409 search results - page 55 / 482
» On Extended Regular Expressions
Sort
View
FSTTCS
2001
Springer
15 years 2 months ago
Beyond Regular Model Checking
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
Dana Fisman, Amir Pnueli
IUI
2000
ACM
15 years 2 months ago
Extending software through metaphors and metonymies
This article is about applications that can be customized or extended through their own user interface. This is achieved by the interface’s ability to interpret users’ non-lit...
Simone Diniz Junqueira Barbosa, Clarisse Sieckeniu...
APSEC
2004
IEEE
15 years 1 months ago
Extending a Graphic Modeling Language to Support Partial and Evolutionary Specification
The notion of partial and evolutionary specification has gained attention both in research and industry in the last years. While many people regard this just as a process issue, w...
Yong Xia, Martin Glinz
IJBRA
2006
59views more  IJBRA 2006»
14 years 9 months ago
Predicting altered pathways using extendable scaffolds
: Many diseases, especially solid tumors, involve the disruption or deregulation of cellular processes. Most current work using gene expression and other high-throughput data, simp...
B. M. Broom, T. J. McDonnell, D. Subramanian
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
15 years 3 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu