204 search results - page 30 / 41 » Reasoning with Spider Diagrams |
SAS
2004
Springer
14 years 29 days ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
STACS
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
UML
2000
Springer
13 years 11 months ago
2000
Springer
User interfaces (UIs) are essential components of most software systems, and significantly affect the effectiveness of installed applications. In addition, UIs often represent a s...
IJCAI
2007
13 years 9 months ago
2007
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of comp...
JUCS
2008
13 years 7 months ago
2008
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...