output
20072026
most citedSciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

40.2k citations

Showing 2011Show all

7 papers · 1 filter

eess.SY2011★ 6 cited

A theory of robust software synthesis

Rupak Majumdar, Elaine Render, Paulo Tabuada

A key property for systems subject to uncertainty in their operating environment is robustness, ensuring that unmodelled, but bounded, disturbances have only a proportionally bound…

cs.PL2011

Self-Adjusting Stack Machines

Matthew A. Hammer, Georg Neis, Yan Chen +1

Self-adjusting computation offers a language-based approach to writing programs that automatically respond to dynamically changing data. Recent work made significant progress in de…

cs.LO2011★ 3 cited

On the mathematical synthesis of equational logics

Marcelo Fiore, Chung-Kil Hur

We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a ratio…

math.OC2011★ 1 cited

Coordinate-invariant incremental Lyapunov functions

Majid Zamani, Rupak Majumdar

In this note, we propose coordinate-invariant notions of incremental Lyapunov function and provide characterizations of incremental stability in terms of existence of the proposed…

cs.CR2011

Adding Query Privacy to Robust DHTs

Michael Backes, Ian Goldberg, Aniket Kate +1

Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or request…

cs.PL2011★ 57 cited

Logical Step-Indexed Logical Relations

Derek Dreyer, Amal Ahmed, Lars Birkedal

Appel and McAllester's "step-indexed" logical relations have proven to be a simple and effective technique for reasoning about programs in languages with semantically interesting t…