1350 search results - page 14 / 270 » Reasoning about Staged Computation |
CACM
2010
14 years 9 months ago
2010
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
120
click to vote
PODC
1994
ACM
15 years 1 months ago
1994
ACM
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
88
Voted
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper presents a new version of the CL contract specification language. CL combines deontic logic with propositional dynamic logic but it applies the modalities exc...
IJCAI
2003
14 years 11 months ago
2003
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
AIPS
1996
14 years 11 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...