255 search results - page 7 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
107
click to vote
ENTCS
2007
14 years 11 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
112
click to vote
ECAI
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
133
click to vote
ISSTA
2012
ACM
13 years 2 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
181
click to vote
POPL
2009
ACM
16 years 10 days ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
ENTCS
2002
14 years 11 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...