2 search results - page 1 / 1 » Counting Multiplicity over Infinite Alphabets |
RP
2009
Springer
13 years 11 months ago
2009
Springer
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...