Sistemas Informáticos y Computación

2008

1. A Gentle Introduction to Mutual Recursion

   ITICSE '08: PROCEEDINGS OF THE 13TH ANNUAL CONFERENCE ON INNOVATION AND TECHNOLOGY IN COMPUTER SCIENCE EDUCATION

2. A New Proposal for Debugging Datalog Programs

   Electronic Notes in Theoretical Computer Science, Vol. 216, Núm. C, pp. 79-92

3. A Rewriting semantics for Maude strategies

   Electronic Notes in Theoretical Computer Science

4. A comparative study of STOPA and RTPA

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

5. A debugger for parallel haskell dialects

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

6. A declarative debugger for Maude

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

7. A declarative debugger for Maude functional modules

   Electronic Notes in Theoretical Computer Science

8. A formal methodology to specify hierarchical agent-based systems

   SITIS 2008 - Proceedings of the 4th International Conference on Signal Image Technology and Internet Based Systems

9. A formal specification of the memorization process

   Novel Approaches in Cognitive Informatics and Natural Intelligence (IGI Global), pp. 157-170

10. A fully CPU-implemented rigid body simulator

    GRAPP 2008 - Proceedings of the 3rd International Conference on Computer Graphics Theory and Applications

11. A gentle introduction to mutual recursion

    Proceedings of the Conference on Integrating Technology into Computer Science Education, ITiCSE

12. A hierarchy of equivalences for probabilistic processes

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

13. A lightweight combination of semantics for non-deterministic functions

    18th Workshop on Logic-based methods in Programming Environments, WLPE 2008

14. A practical type analysis for verification of modular prolog programs

    Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

15. A theoretical framework for the declarative debugging of datalog programs

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

16. A tool for teaching interactions between design patterns

    Proceedings of the Conference on Integrating Technology into Computer Science Education, ITiCSE

17. A type system for safe memory management and its proof of correctness

    PPDP'08 - Proceedings of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

18. A write-based solver F or SAT modulo the theory of arrays

    Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD

19. ACABARASE: An anti-spam case-based reasoning system

    3rd International Conference on Systems, ICONS 2008

20. Abstraction-carrying code: A model for mobile code safety

    New Generation Computing, Vol. 26, Núm. 2, pp. 171-204