Sciweavers

101 search results - page 3 / 21
» Error Correcting Analysis for Tree Languages
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICTCS
2005
Springer
14 years 29 days ago
Error Mining for Regular Expression Patterns
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
Giuseppe Castagna, Dario Colazzo, Alain Frisch
ACL
1998
13 years 8 months ago
Characterizing and Recognizing Spoken Corrections in Human-Computer Dialogue
Miscommunication in speech recognition systems is unavoidable, but a detailed characterization of user corrections will enable speech systems to identify when a correction is taki...
Gina-Anne Levow
OOPSLA
2005
Springer
14 years 29 days ago
Finding application errors and security flaws using PQL: a program query language
A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with s...
Michael C. Martin, V. Benjamin Livshits, Monica S....
WCRE
2009
IEEE
14 years 2 months ago
Static Detection of Disassembly Errors
—Static disassembly is a crucial first step in reverse engineering executable files, and there is a considerable body of work in reverse-engineering of binaries, as well as are...
Nithya Krishnamoorthy, Saumya K. Debray, Keith Fli...