67 search results - page 14 / 14 » Reasoning on temporal class diagrams: Undecidability results |
KI
2006
Springer
13 years 5 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
PLDI
2009
ACM
14 years 1 hour ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...