We had two papers accepted for LCTES this year in June:
The first paper is a joint work with Rodrigo and presents a formal semantics of the languages and proofs for memory boundedness, determinism and termination reactions. (The paper is somewhat heavy.)
The second paper is a work-in-progress paper that proposes Céu as a language to achieve transparent standby for low-power applications.Naveen will be working with us to extend the range of devices and drivers with this purpose.
We had two papers accepted for LCTES this year in June:
On Friday, 4 May 2018 21:52:34 UTC+2, Francisco Sant'Anna wrote:We had two papers accepted for LCTES this year in June:Congratulations!The first paper is a joint work with Rodrigo and presents a formal semantics of the languages and proofs for memory boundedness, determinism and termination reactions. (The paper is somewhat heavy.)I just skimmed it, it's clearly over my head. But out of curiosity: I presume you can only prove this for Céu itself? As in: it depends on a host language without bugs for all of these proofs to hold?
The second paper is a work-in-progress paper that proposes Céu as a language to achieve transparent standby for low-power applications.Naveen will be working with us to extend the range of devices and drivers with this purpose.Like I said in the other topic: excited to see where this will go!