756 search results - page 108 / 152 » Using Logic Programs to Reason about Infinite Sets |
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
ATAL
2006
Springer
14 years 7 days ago
2006
Springer
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
EMSOFT
2007
Springer
14 years 2 months ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
ACTA
2010
13 years 8 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
TOPLAS
2002
13 years 8 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...