GithubHelp home page GithubHelp logo

comitaco's Introduction

comittaco

comitaco's People

Contributors

mffrias avatar nmaguirre avatar saiema avatar gastonscilingo avatar

Watchers

Federico Ramundo avatar Luciano Zemin avatar Conrado Mader Blanco avatar  avatar  avatar  avatar  avatar  avatar

comitaco's Issues

Java version called from MuJavaController through Runtime.getRuntime().exec depends on the environment

Java version called from MuJavaController through Runtime.getRuntime().exec depends on the environment, and may differ from that being used in the project. See lines 1014-1017 in file MuJavaController.java.

If Java version called using Runtime.getRuntime().exec is not 1.7, then mutated files (fix candidates) do not compile, and the generation of mutants is stuck in filtering out cases that do not compile.

For the time being, I fixed this issue in my setup by calling java with its fully qualified path, to make sure Java 1.7 is being called.

refinar especificaciones en pldi.bintree.BinTree

En pldi.bintree.BinTree(Integer) se define el siguiente requires

requires (\forall BinTreeNode n1; 
    \reach(root, BinTreeNode, left+right).has(n1);
    (\forall BinTreeNode m1; 
        \reach(root, BinTreeNode, left+right).has(m1); n1 != m1 ==> n1.key != m1.key));

Este siempre se cumple dado que el Invariante debería especificar

invariant (\forall BinTreeNode n; 
    \reach(root, BinTreeNode, left + right).has(n) == true;
        (\forall BinTreeNode m; 
        \reach(n.left, BinTreeNode, left + right).has(m) == true;
                m.key < n.key) &&
                (\forall BinTreeNode m;
                \reach(n.right, BinTreeNode, left + right).has(m) == true;
                m.key > n.key));

Sin embargo el invariante actual está definido como

invariant (\forall BinTreeNode n; 
    \reach(root, BinTreeNode, left + right).has(n) == true;
        (\forall BinTreeNode m; 
        \reach(n.left, BinTreeNode, left + right).has(m) == true;
                m.key <= n.key) &&
                (\forall BinTreeNode m;
                \reach(n.right, BinTreeNode, left + right).has(m) == true;
                m.key > n.key));

Que permite repetidos, sin embargo el método insertar no admite repetidos y el método remover tampoco. Con lo cual es necesario modificar el invariante para no admitir repetidos y corregir el requires del método remove acorde al mismo.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.