229 search results - page 36 / 46 » Bilateral Algorithms for Symbolic Abstraction |
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
CASC
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
IANDC
2011
13 years 2 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
COOPIS
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...