377 search results - page 28 / 76 » Modular logic metaprogramming |
103
click to vote
CADE
2004
Springer
15 years 5 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
BIRTHDAY
2009
Springer
15 years 3 months ago
2009
Springer
An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of a...
107
click to vote
GLVLSI
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
COLING
1994
15 years 1 months ago
1994
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their ...
ATVA
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...