534 search results - page 51 / 107 » Proving Termination of Rewrite Systems Using Bounds |
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
In recent years it has been shown that dynamic monitoring can be used to soundly enforce information flow policies. For programs distributed in source or bytecode form, the use o...
COMPGEOM
2000
ACM
14 years 2 days ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
LDTA
2010
13 years 8 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
COOPIS
2003
IEEE
14 years 1 months ago
2003
IEEE
The use of semantic knowledge in its various forms has become an important aspect in managing data in database and information systems. In the form of integrity constraints, it ha...
DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...