198 search results - page 31 / 40 » Modal Proofs as Distributed Programs (Extended Abstract) |
ICAIL
2005
ACM
14 years 2 months ago
2005
ACM
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
RTA
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
AAECC
2005
Springer
13 years 8 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
OOPSLA
2005
Springer
14 years 2 months ago
2005
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
ECOOPW
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. In Aspect-Oriented Programming we decompose a problem into a number of functional components as well as a number of aspects and then we compose these components and aspec...