899 search results - page 51 / 180 » Cost Analysis of Games, Using Program Logic |
ACSC
2004
IEEE
15 years 3 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
CAV
2006
Springer
15 years 3 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
112
click to vote
APSEC
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we propose four slicing methods using both static and dynamic analysis information. (1) StatementMark Slice : removes the unnecessary statements using an execution ...
CC
2005
Springer
15 years 5 months ago
2005
Springer
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
110
click to vote
JELIA
2004
Springer
15 years 5 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...