Continuity analysis of programs

By Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerman. 2010

108 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Hardware and Architecture

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Gilles Barthe
2. Marco Gaboardi
3. Benjamin Gr'egoire
4. César Kunz
5. Pierre-Yves Strub
6. Emilio Jesús Gallego Arias
7. Gian Pietro Farina
8. Stephen Chong

In Hardware and Architecture

1. Marco Gaboardi
2. Gian Pietro Farina
3. Stephen Chong
4. Justin Hsu

Citations in the corpus

• AI2: Safety and Robustness Certification of Neural Networks with Abstract Interpretation (2018, neutral): “, [4], [5], [13], [28]).”
• Proving Differential Privacy in Hoare Logic (2014, background): “On a more practical side, it would be interesting to implement our transformation for a realistic setting, for instance modeling thePINQ language [30].”
• Relational Symbolic Execution (2017, methodology): “Milushev et al. (2012) use symbolic execution to check non-interference by means of an analysis based on a type directed transformation of the program first presented in Terauchi and Aiken (2005).”
• Dimensions in program synthesis (2010, unknown): “∙ How do we combine the power of various search techniques such as version space algebras, logical reasoning techniques (based on abstraction, mathematical induction, theorem proving, SAT/SMT/QBF solving) and machine learning techniques (probabilistic inference, bayesian learning, genetic programmin”
• Coupling proofs are probabilistic product programs (2016, background): “[26] propose a logical approach for proving continuity properties of programs, and Carbin et al.”