Sciweavers

80 search results - page 11 / 16
» Behavioral and Coinductive Rewriting
Sort
View
LRE
2006
175views more  LRE 2006»
13 years 7 months ago
Automatically generating related queries in Japanese
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
Rosie Jones, Kevin Bartz, Pero Subasic, Benjamin R...
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
13 years 11 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
SOSP
1997
ACM
13 years 8 months ago
Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mi...
Stefan Savage, Michael Burrows, Greg Nelson, Patri...
ACTA
2006
74views more  ACTA 2006»
13 years 7 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
PPDP
2005
Springer
14 years 26 days ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...