4767 search results - page 102 / 954 » Structures for Abstract Rewriting |
CSUR
1999
13 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...
TCS
2002
13 years 9 months ago
2002
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
TODAES
2008
13 years 9 months ago
2008
Abstract-- Automata-based methods for generating PSL hardware assertion checkers were primarily considered for use with temporal sequences, as opposed to full-scale properties. We ...
NA
2010
13 years 8 months ago
2010
Abstract: In this work we give an interpretation of a (s(d + 1) + 1)-term recurrence relation in terms of type II multiple orthogonal polynomials. We rewrite this recurrence relati...
LPAR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...