Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
We are interested in programming languages for cognitive agents with preferences. We define rule-based agent theories and inference procedures in defeasible logic, and in this set...
Mehdi Dastani, Guido Governatori, Antonino Rotolo,...
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of state...
Koen V. Hindriks, Wiebe van der Hoek, M. Birna van...
Automating software evolution requires both identifying precisely the affected program points and selecting the appropriate modification at each point. This task is particularly ...