{"push_id":1437267058,"size":19,"distinct_size":1,"ref":"refs/heads/master","head":"7978ce19d0ae61d19e3bcaf08b0e4ed161502b83","before":"ad5ce238b270556e779a81bb3b9080c020aef439","commits":[{"sha":"b451e0d789f86f55da4477ddec84e401856ba62c","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Solved some of the biggest problems with the lisp translation:\n\n-moved transformations (car-cdr constraints, call unifications...) to a post-processing phase\n-compute strongly connected components\n-partially evaluate the ifs involved in the recursive paths\n-apply the post-processing afterwards\n-added post-processing for products of constants","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/b451e0d789f86f55da4477ddec84e401856ba62c"},{"sha":"a9b7ca5482fe17ca378af60c0faf60f3ef5b2e92","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"if the condition of the if and the 'then' branch are equal,\nwe assume it is an or and we remove the second computation.","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/a9b7ca5482fe17ca378af60c0faf60f3ef5b2e92"},{"sha":"4dde7be7fb0cea0542f982730920cf1b84a0e03f","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Solved bug in template inference","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/4dde7be7fb0cea0542f982730920cf1b84a0e03f"},{"sha":"c23eaaf2aa1dd893b77df2fa50afd98f595163a8","author":{"name":"v5r","email":"f27a17fc90c00d8c248d8510a1084221738b492b@b8000h.org"},"message":"fix definitions of char-code/code-char, add throw-nonexec-error","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/c23eaaf2aa1dd893b77df2fa50afd98f595163a8"},{"sha":"8cdd343c574ef8ed2ffec81cb15b8fb342e374b1","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Added a new strategy that can approximate the sum of a linear expression over a level\nby the number of elements in the level multiplied by the maximum/minimum value of the expression.","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/8cdd343c574ef8ed2ffec81cb15b8fb342e374b1"},{"sha":"e57e04f2e64e30db98cbe49ae2d0389e84f425d8","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"added messages to find a specific kind of examples, where the 'size analysis' is not powerful enough","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/e57e04f2e64e30db98cbe49ae2d0389e84f425d8"},{"sha":"b650b2eae73d2e16b1888a29d4163f0190cb2a73","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Added slicing","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/b650b2eae73d2e16b1888a29d4163f0190cb2a73"},{"sha":"6642fd586d3653805bd17fee38ae83a49ea96a68","author":{"name":"v5r","email":"f27a17fc90c00d8c248d8510a1084221738b492b@b8000h.org"},"message":"include original Lisp argument names in generated entry declarations","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/6642fd586d3653805bd17fee38ae83a49ea96a68"},{"sha":"1fd8f4a376de466cbe227bf47f4b6a03dc2a02f6","author":{"name":"v5r","email":"f27a17fc90c00d8c248d8510a1084221738b492b@b8000h.org"},"message":"fix filter_argnames","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/1fd8f4a376de466cbe227bf47f4b6a03dc2a02f6"},{"sha":"e91463425738630aff6c607a8aca928867b09993","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Improved checks to find interesting examples","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/e91463425738630aff6c607a8aca928867b09993"},{"sha":"7d98866311f247f34bd7f86f620d116ba2aa655c","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"improved template inference. For multiple recursion it makes sense to have\na non-zero constant component i.e. infer candidates like 2X-1","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/7d98866311f247f34bd7f86f620d116ba2aa655c"},{"sha":"ba1877ad5c2e35e2d4d003ae7947c8a73546d3d3","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Improved/corrected the generation of candidates for the leafs in multiple recursion\ntake all the loops into account to generate a sound candidate.","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/ba1877ad5c2e35e2d4d003ae7947c8a73546d3d3"},{"sha":"26e9605bc8944c94fa0fede508de7381c4d21130","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"added option '-incremental' to perform control flow refinement and bound computation together\none cost relation at a time (instead of doing all the refinement first and all the bound computation later)","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/26e9605bc8944c94fa0fede508de7381c4d21130"},{"sha":"f54860585098ab7963db2938fd97a7acee47c08d","author":{"name":"v5r","email":"f27a17fc90c00d8c248d8510a1084221738b492b@b8000h.org"},"message":"ignore return-last except for its second argument","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/f54860585098ab7963db2938fd97a7acee47c08d"},{"sha":"c2a9a261fba512341710c03501f231dec43240ef","author":{"name":"v5r","email":"f27a17fc90c00d8c248d8510a1084221738b492b@b8000h.org"},"message":"fix incorrect replacement '_' for generating variable names","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/c2a9a261fba512341710c03501f231dec43240ef"},{"sha":"aa7f7ea172b34ac2f2b3493dfba626e5f3989b3f","author":{"name":"v5r","email":"f27a17fc90c00d8c248d8510a1084221738b492b@b8000h.org"},"message":"add missing linebreak to warning output","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/aa7f7ea172b34ac2f2b3493dfba626e5f3989b3f"},{"sha":"d0763d6fadb70c13f9418e874bbbb2b0a7e3d5fa","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Efficiency improvement in the candidate generation","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/d0763d6fadb70c13f9418e874bbbb2b0a7e3d5fa"},{"sha":"7f4adca2a37c07a2298b9a8e4ab90d05ead9b682","author":{"name":"aeflores","email":"3a6b28683aeb06a511bd347e4a29af1c40288c69"},"message":"Fixed bug with invariant computation in multiple recursive CRs\n -when computing backward invariants we can assume one iteration,\n  but with multiple recursion we should do it at the end rather than at the beginning","distinct":false,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/7f4adca2a37c07a2298b9a8e4ab90d05ead9b682"},{"sha":"7978ce19d0ae61d19e3bcaf08b0e4ed161502b83","author":{"name":"Antonio Flores Montoya","email":"0b9dad840a322dee412f42162257b8548b49eb62@gmail.com"},"message":"Merge pull request #21 from aeflores/new_ubs_method\n\nNew ubs method","distinct":true,"url":"https://api.github.com/repos/aeflores/CoFloCo/commits/7978ce19d0ae61d19e3bcaf08b0e4ed161502b83"}]}
{"actor":{"display_login":"aeflores"}}