Sciweavers

595 search results - page 66 / 119
» Languages Of Analogical Strings
Sort
View
FSTTCS
2006
Springer
15 years 1 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
ICFP
2007
ACM
15 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
EACL
2003
ACL Anthology
14 years 11 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
ICFP
2010
ACM
14 years 11 months ago
Matching lenses: alignment and view update
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
Davi M. J. Barbosa, Julien Cretin, Nate Foster, Mi...
ICALP
2001
Springer
15 years 2 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...