Sciweavers

4211 search results - page 184 / 843
» Types as Abstract Interpretations
Sort
View
136
Voted
JANCL
2007
115views more  JANCL 2007»
15 years 4 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
145
Voted
LOPSTR
2004
Springer
15 years 9 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
127
Voted
AGP
1998
IEEE
15 years 7 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
129
Voted
PPDP
2009
Springer
15 years 10 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reļ...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
ENTCS
2010
66views more  ENTCS 2010»
15 years 4 months ago
A Nominal Relational Model for Local Store
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
Rasmus Ejlers Møgelberg