Sciweavers

2474 search results - page 31 / 495
» Learning Languages in a Union
Sort
View
ESOP
2005
Springer
14 years 2 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg
ICDT
2005
ACM
139views Database» more  ICDT 2005»
14 years 2 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx
ISSTA
1991
ACM
14 years 7 days ago
Dynamic Slicing in the Presence of Unconstrained Pointers
Program slices are useful in debugging. Most work on program slicing to date has concentrated on nding slices of programs involving only scalar variables. Pointers and composite v...
Hiralal Agrawal, Richard A. DeMillo, Eugene H. Spa...
EACL
2006
ACL Anthology
13 years 10 months ago
Improved Lexical Alignment by Combining Multiple Reified Alignments
We describe a word alignment platform which ensures text pre-processing (tokenization, POS-tagging, lemmatization, chunking, sentence alignment) as required by an accurate word al...
Dan Tufis, Radu Ion, Alexandru Ceausu, Dan Stefane...
EACL
2003
ACL Anthology
13 years 10 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä