Výsledky vyhledávání - "Marc Brockschmidt"

Inferring Lower Runtime Bounds for Integer Programs

Autor: Florian Frohn, Jürgen Giesl, Matthias Naaf, Marc Brockschmidt

Publikováno v: ACM Transactions on Programming Languages and Systems. 42:1-50

We present a technique to infer lower bounds on the worst-case runtime complexity of integer programs, where in contrast to earlier work, our approach is not restricted to tail-recursion. Our technique constructs symbolic representations of program e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdf0e2862e27e26857d67641c9cd834a
https://doi.org/10.1145/3410331

Zobrazit plný text záznamu

Analyzing Information Leakage of Updates to Natural Language Models

Autor: Marc Brockschmidt, Santiago Zanella-Béguelin, Andrew Paverd, Lukas Wutschitz, Victor Rühle, Olga Ohrimenko, Boris Köpf, Shruti Tople

Publikováno v: CCS

To continuously improve quality and reflect changes in data, machine learning applications have to regularly retrain and update their core models. We show that a differential analysis of language model snapshots before and after an update can reveal

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43b8e2503af3226e4dd6122e3dfc2b92
https://doi.org/10.1145/3372297.3417880

Zobrazit plný text záznamu

Learning units-of-measure from scientific code

Autor: Marc Brockschmidt, Miltiadis Allamanis, Dominic Orchard, Andrew Rice, Matthew Danish

Publikováno v: SE4Science@ICSE

CamFort is our multi-purpose tool for lightweight analysis and verification of scientific Fortran code. One core feature provides units-of-measure verification (dimensional analysis) of programs, where users partially annotate programs with units-of-

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5ec09a8d7b1b087364e4e2a4f8314a6

Zobrazit plný text záznamu

Learning from code with graphs (keynote)

Autor: Marc Brockschmidt

Publikováno v: NL4SE@ESEC/SIGSOFT FSE

Learning from large corpora of source code ("Big Code") has seen increasing interest over the past few years. A first wave of work has focused on leveraging off-the-shelf methods from other machine learning fields such as natural language processing.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5da56fe3075f90ed920f284364a79bd3
https://doi.org/10.1145/3283812.3283813

Zobrazit plný text záznamu

Complexity Analysis for Term Rewriting by Integer Transition Systems

Autor: Juergen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Matthias Naaf

Publikováno v: Frontiers of Combining Systems ISBN: 9783319661667
FroCoS

We present a new method to infer upper bounds on the innermost runtime complexity of term rewrite systems (TRSs), which benefits from recent advances on complexity analysis of integer transition systems (ITSs). To this end, we develop a transformatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a08263a6080e84833fbd11fe0b554f50
https://doi.org/10.1007/978-3-319-66167-4_8

Zobrazit plný text záznamu

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic

Autor: Carsten Fuhs, Marc Brockschmidt, Florian Frohn, Thomas Ströder, Jürgen Giesl, Cornelius Aschermann, Peter Schneider-Kamp, Jera Hensel

Publikováno v: Ströder, T, Giesl, J, Brockschmidt, M, Frohn, F, Fuhs, C, Hensel, J, Schneider-Kamp, P & Aschermann, C 2017, ' Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic ', Journal of Automated Reasoning, vol. 58, no. 1, pp. 33-65 . https://doi.org/10.1007/s10817-016-9389-x

While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully automatically was still an open problem. To close this gap, we introduce a novel abstract domain

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41e1bc0e99652eac9f971e835f1794cf
https://findresearcher.sdu.dk:8443/ws/files/141379199/Automatically_Proving_Termination_and_Memory_Safety_for_Programs_with_Pointer_Arithmetic.pdf

Zobrazit plný text záznamu

Proving termination through conditional termination

Autor: Marc Brockschmidt, Enric Rodríguez-Carbonell, Daniel Larraz, Albert Rubio, Cristina Borralleras, Albert Oliveras

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662545768
TACAS (1)

We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a1ec6a4a90b65b239baa38fda0688d8

Zobrazit plný text záznamu

Learning Shape Analysis

Autor: Siddharth Krishna, Marc Brockschmidt, Daniel Tarlow, Pushmeet Kohli, Yuxin Chen

Publikováno v: Static Analysis ISBN: 9783319667058
SAS

We present a data-driven verification framework to automatically prove memory safety of heap-manipulating programs. Our core contribution is a novel statistical machine learning technique that maps observed program states to (possibly disjunctive) se

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0e75f067831c516d453536e6872b155d
https://doi.org/10.1007/978-3-319-66706-5_4

Zobrazit plný text záznamu

Analyzing Program Termination and Complexity Automatically with AProVE

Autor: Peter Schneider-Kamp, Stephanie Swiderski, Carsten Otto, Florian Frohn, Marc Brockschmidt, Jera Hensel, Jürgen Giesl, Martin Plücker, Thomas Ströder, Carsten Fuhs, René Thiemann, Fabian Emmes, Cornelius Aschermann

Publikováno v: Giesl, J, Aschermann, C, Brockschmidt, M, Emmes, F, Frohn, F, Fuhs, C, Hensel, J, Otto, C, Plücker, M, Schneider-Kamp, P, Ströder, T, Swiderski, S & Thiemann, R 2017, ' Analyzing Program Termination and Complexity Automatically with AProVE ', Journal of Automated Reasoning, vol. 58, no. 1, pp. 3-31 . https://doi.org/10.1007/s10817-016-9388-y

In this system description, we present the tool AProVE for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical term rewrite systems (TRSs), AProVE also supports rewrite systems contai

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20ed30e232c853f8e57d105104d9844a
https://findresearcher.sdu.dk:8443/ws/files/141379108/Analyzing_Program_Termination_and_Complexity_Automatically_with_AProVE.pdf

Zobrazit plný text záznamu

Analyzing runtime and size complexity of integer programs

Autor: Carsten Fuhs, Fabian Emmes, Stephan Falke, Marc Brockschmidt, Jürgen Giesl

We present a modular approach to automatic complexity analysis of integer programs. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer bounds on the absolute values of program variables, we ca

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b366b89336b6454cf5a813b78307207
https://eprints.bbk.ac.uk/id/eprint/16257/1/16257.pdf

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání