Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Ravichandhran Madhavan"'
Publikováno v:
Foundations and Trends in Programming Languages
Foundations and Trends® in Programming Languages
Foundations and Trends® in Programming Languages
Modular heap analysis techniques analyze a program by computing summaries for every procedure in the program that describes its effects on an input heap using pre computed summaries for the called procedures. In this article we focus on a family of m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::65df9465b83e44d20dd06ee4cccd6c6f
http://lara.epfl.ch/~kandhada/fntPL-2015.pdf
http://lara.epfl.ch/~kandhada/fntPL-2015.pdf
Modular heap analysis techniques analyze a program by computing summaries for every procedure in the program that describes its effects on an input heap, using pre-computed summaries for the called procedures. In A Framework For Efficient Modular Hea
Publikováno v:
OOPSLA
Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d63b55c9752eae394f7cefd8eaa0e12a
https://doi.org/10.1145/2076021.2048144
https://doi.org/10.1145/2076021.2048144
Autor:
Viktor Kuncak, Ravichandhran Madhavan
Publikováno v:
Computer Aided Verification ISBN: 9783319088662
CAV
CAV
We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbf0cea9281238ac9e05edb1a03bb68f
https://doi.org/10.1007/978-3-319-08867-9_51
https://doi.org/10.1007/978-3-319-08867-9_51
Publikováno v:
Static Analysis ISBN: 9783642331244
SAS
SAS
We consider the problem of computing summaries for procedures that soundly capture the effect of calling a procedure on program state that includes a mutable heap. Such summaries are the basis for a compositional program analysis and key to scalabili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a66bb9050939984a002b8d045f00fff2
https://doi.org/10.1007/978-3-642-33125-1_25
https://doi.org/10.1007/978-3-642-33125-1_25
Publikováno v:
Static Analysis ISBN: 9783642237010
SAS
SAS
Salcianu and Rinard present a compositional purity analysis that computes a summary for every procedure describing its side-effects. In this paper, we formalize a generalization of this analysis as an abstract interpretation, present several optimiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6a98bd411d1d00bafcb4afaa4ee2856
https://doi.org/10.1007/978-3-642-23702-7_6
https://doi.org/10.1007/978-3-642-23702-7_6
We study the problem of proving termination of open, higher-order programs with recursive functions and datatypes. We identify a new point in the design space of solutions, with an appealing trade-off between simplicity of specification, modularity,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cc8a19053ef30c1909bc3fb628f6ccc
https://infoscience.epfl.ch/record/229918
https://infoscience.epfl.ch/record/229918
Publikováno v:
POPL
We present a new approach for specifying and verifying resource utilization of higher-order functional programs that use lazy evaluation and memoization. In our approach, users can specify the desired resource bound as templates with numerical holes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9751f73e47af2d3531a98cfa61536fb
https://infoscience.epfl.ch/record/229847
https://infoscience.epfl.ch/record/229847
Autor:
Ravichandhran Madhavan, Mikaël Mayer
Publikováno v:
SCALA@SPLASH
We present a lightweight library for testing concurrent Scala programs by systematically exploring multiple interleavings between user-specified operations on shared objects. Our library is targeted at beginners of concurrent programming in Scala, ru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47c853078893dc18067c35e6a54ee77a
https://infoscience.epfl.ch/record/225266
https://infoscience.epfl.ch/record/225266