255 search results - page 4 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
CADE
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
SEFM
2008
IEEE
14 years 4 days ago
2008
IEEE
Aspect oriented programming can arbitrarily distort the semantics of programs. In particular, weaving can invalidate crucial safety and liveness properties of the base program. In...
ERSHOV
2009
Springer
14 years 10 days ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...