3573 search results - page 285 / 715 » Reasoning about Codata |
160
Voted
RE
2010
Springer
14 years 11 months ago
2010
Springer
Abstract Requirements Engineering (RE) research often ignores, or presumes a uniform nature of the context in which the system operates. This assumption is no longer valid in emerg...
139
click to vote
CSL
2004
Springer
15 years 10 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
187
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
174
click to vote
AAMAS
2005
Springer
15 years 4 months ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
153
click to vote
AIPS
2011
14 years 8 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...