Sciweavers

1242 search results - page 45 / 249
» The Theory of Grammar Constraints
Sort
View
TAICPART
2010
IEEE
166views Education» more  TAICPART 2010»
15 years 10 days ago
Linguistic Security Testing for Text Communication Protocols
We introduce a new Syntax-based Security Testing (SST) framework that uses a protocol specification to perform security testing on text-based communication protocols. A protocol sp...
Ben W. Y. Kam, Thomas R. Dean
QSIC
2005
IEEE
15 years 7 months ago
Test Case Generation by OCL Mutation and Constraint Solving
Fault-based testing is a technique where testers anticipate errors in a system under test in order to assess or generate test cases. The idea is to have enough test cases capable ...
Bernhard K. Aichernig, Percy Antonio Pari Salas
TSP
2008
116views more  TSP 2008»
15 years 1 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
DOCENG
2003
ACM
15 years 7 months ago
Handling syntactic constraints in a DTD-compliant XML editor
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Y. S. Kuo, Jaspher Wang, N. C. Shih
112
Voted
BIOCOMP
2008
15 years 3 months ago
Combinations of Context-Free Shifts and Shifts of Finite Type
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
Hiroshi Kamabe