498 search results - page 63 / 100 » Term Rewriting |
CSUR
1999
14 years 9 months ago
1999
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
CISIS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Discovery biological organisation of the cell in modules network is a challenging task. Currently, approaches based on a controlled vocabulary, as Gene Ontology, to iden...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
ACL
1996
14 years 11 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...