762 search results - page 14 / 153 » Intercode Regular Languages |
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
FMSD
2007
13 years 7 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
FOSSACS
2001
Springer
13 years 12 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
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...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
We demonstrate that regularization can improve feedback in a language modeling framework. Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: Relevance Fee...