450 search results - page 26 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
JCSS
2010
13 years 6 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
PODS
2010
ACM
14 years 18 days ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
IPL
2007
13 years 7 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
HT
2011
ACM
12 years 11 months ago
2011
ACM
Personalized search and browsing is increasingly vital especially for enterprises to able to reach their customers. Key challenge in supporting personalization is the need for ric...