1418 search results - page 255 / 284 » The Dynamic Complexity of Formal Languages |
235
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
129
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
144
click to vote
LFP
1992
15 years 5 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
148
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for...
196
click to vote
FUIN
2007
15 years 4 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...