949 search results - page 114 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
FM
2008
Springer
13 years 10 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
EDOC
2000
IEEE
14 years 1 months ago
2000
IEEE
Practical experience indicates that the definition of realworld workflow applications is a complex and error-prone process. Existing workflow management systems provide the means,...
ICDCSW
2000
IEEE
14 years 13 days ago
2000
IEEE
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...