57 search results - page 5 / 12 » Variable elimination for building interpreters |
106
click to vote
ESOP
2008
Springer
15 years 24 days ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
75
Voted
AAAI
2004
15 years 13 days ago
2004
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been give...
62
Voted
COLING
2010
14 years 6 months ago
2010
In this paper, we offer broad insight into the underperformance of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model de...
ICFP
2001
ACM
15 years 11 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
121
click to vote
TRIER
2002
14 years 10 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...