556 search results - page 30 / 112 » Pair Programming: Not for Everyone |
JLP
2010
13 years 3 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
CAEPIA
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Multi-adjoint logic programs were recently proposed as a generalization of monotonic and residuated logic programs, in that simultaneous use of several implications in th...
AOSD
2007
ACM
14 years 1 months ago
2007
ACM
Most approaches to programming language extensibility have worked by pairing syntactic extension with semantic extension. We present an approach that works through a combination o...
LOPSTR
2007
Springer
14 years 3 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— In this paper, we study the problem of going from a real-world, multi-agent system to the generation of control programs in an automatic fashion. In particular, a computer visi...