3573 search results - page 200 / 715 » Reasoning about Codata |
119
Voted
MPC
2000
Springer
15 years 7 months ago
2000
Springer
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
110
Voted
SEKE
1995
Springer
15 years 7 months ago
1995
Springer
This paper argues for new computational mechanisms to aid specification of requirements for composite systems. It presents mechanisms for storing specification fragments, or viewp...
109
click to vote
RTA
1987
Springer
15 years 7 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
117
Voted
BMVC
2002
15 years 6 months ago
2002
This paper investigates the combination of spatial and probabilistic models for reasoning about pedestrian behaviour in visual surveillance systems. Models are learnt by a multi-s...
125
Voted
COLING
2008
15 years 5 months ago
2008
Reasoning about how much to generate when space is limited is a challenge for generation systems. This paper presents two algorithms that exploit the discourse structure to decide...