3 search results - page 1 / 1 » Deciding inclusion of set constants over infinite non-strict... |
ITA
2007
13 years 4 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
CSL
2010
Springer
13 years 5 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...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...