110 search results - page 22 / 22 » Finite-State Registered Automata and Their Uses in Natural L... |
CAV
2009
Springer
16 years 7 days ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
FOIKS
2008
Springer
15 years 1 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
119
click to vote
JUCS
2010
14 years 10 months ago
2010
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
101
click to vote
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
Speculative compiler optimizations are effective in improving both single-thread performance and reducing power consumption, but their implementation introduces significant compl...
118
click to vote
FDL
2003
IEEE
15 years 5 months ago
2003
IEEE
SystemC-Plus from the ODETTE project provides the ability to simulate and synthesise object-oriented specifications into hardware. The current ODETTE compiler translates each obj...