1. Bossi, A. , Cocco, N. , and Fabris, M. 1991. Proving termination of logic programs by exploiting term properties. In APSOFT 1991: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8–12, 1991, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD), Abramsky, S. and Maibaum, T. S. E. , Eds. Lecture Notes in Computer Science, vol. 494. Springer, 153–180.
2. A lattice-theoretical fixpoint theorem and its applications
3. Puebla, G. and Hermenegildo, M. 1996. Optimized algorithms for the incremental analysis of logic programs. In International Static Analysis Symposium (SAS 1996), vol. 1145. Lecture Notes in Computer Science. Springer-Verlag, 270–284.
4. Flores-Montoya, A. and Hähnle, R. 2014. Resource analysis of complex programs with cost equations. In Programming Languages and Systems – 12th Asian Symposium, APLAS 2014, Singapore, November 17–19, 2014, Proceedings. LNCS, vol. 8858. Springer, 275–295.