Publications related to Strict programming language

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Algorithmic Resource Verification

Ravichandhran Kandhadai Madhavan

Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...

EPFL2017

A Study on the Programming Structures for RRAM-based FPGA Architectures

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Xifan Tang, Gain Kim

Field Programmable Gate Arrays (FPGAs) can benefit non-volatility and high-performance by exploiting Resistive Random Access Memories (RRAMs). In RRAM-based FPGAs, the memories do not only replace the SRAMs and store configurations, but they can also repla ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Concurrent Tries with Efficient Non-Blocking Snapshots

Martin Odersky, Aleksandar Prokopec

We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants. To ensure spac ...

Assoc Computing Machinery2012

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

2009

Internet-scale storage systems under churn - A study of the steady state using Markov models

Karl Aberer, Anwitaman Datta

Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment, where peers continuously leave and rejoin the network, various lazy strategi ...

IEEE Computer Society2006

Strict programming language

Graph Chatbot

Chat with Graph Search

Algorithmic Resource Verification

A Study on the Programming Structures for RRAM-based FPGA Architectures

Concurrent Tries with Efficient Non-Blocking Snapshots

Opis: Reliable Distributed Systems in OCaml

Opis: Reliable Distributed Systems in OCaml

Internet-scale storage systems under churn - A study of the steady state using Markov models

On Correctness of Dynamic Protocol Update

Algorithmic Resource Verification

Opis: Reliable Distributed Systems in OCaml

A Study on the Programming Structures for RRAM-based FPGA Architectures

On Correctness of Dynamic Protocol Update

Concurrent Tries with Efficient Non-Blocking Snapshots

Opis: Reliable Distributed Systems in OCaml

Internet-scale storage systems under churn - A study of the steady state using Markov models