35 search results - page 6 / 7 » Expressiveness and Closure Properties for Quantitative Langu... |
SAS
2010
Springer
13 years 3 months ago
2010
Springer
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
PODS
1999
ACM
13 years 9 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
DALT
2005
Springer
13 years 11 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
ISTA
2004
13 years 6 months ago
2004
: The article proposes a conceptual modeling technique based on Semantically Complete model, the main property of which is that relations carry complete information about interconn...