„program analysis“

Suchergebnisse

7.892 Treffer

• Adaptive Context-sensitive Analysis for JavaScript
  Wei, Shiyi ; Ryder, Barbara G. 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Variability Abstractions: Trading Precision for Speed in Family-Based Analyses
  Dimovski, Aleksandar S. ; Brabrand, Claus ; Wasowski, Andrzej 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Reachability Analysis of Innermost Rewriting
  Genet, Thomas ; Salmon, Yann 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Programming with "Big Code": Lessons, Techniques and Applications
  Bielik, Pavol ; Raychev, Veselin ; Vechev, Martin 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Summary-Based Inter-Procedural Analysis via Modular Trace Refinement
  Cassez, Franck ; Müller, Christian ; Burnett, Karla 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs
  Steinke, Thomas ; Vadhan, Salil ; Wan, Andrew 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Surface Movement Method for Linear Programming
  Olkhovsky, N. A. ; Sokolinsky, L. B.
• Reaching priority populations with different HIV self-testing distribution models in South Africa: an analysis of programme data
  Majam, Mohammed ; Hatzold, Karin ; Mavhu, Webster ; Tembo, Angela ; Zishiri, Vincent ; Phiri, Jane ; Conserve, Donaldson ; Haile, Zelalem ; Chidarikire, Thato ; Johnson, Cheryl C. ; Moyo, Sangiwe ; Meyer-Rath, Gesine ; Venter, Francois
• Do highly exclusive social welfare programs increase political inequality? – a comparative analysis of the 50 US states
  Plutzer, Eric 2010 WZB
• An extensive bibliometric analysis of artificial intelligence techniques from 2013 to 2023
  Bajpai, Aditi ; Yadav, Sonal ; Nagwani, Naresh Kumar
• Termination Analysis of C Programs Using Compiler Intermediate Languages
  Falke, Stephan ; Kapur, Deepak ; Sinz, Carsten 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Behavioral economics and policy evaluation
  Brennan, Timothy John
• A cost-benefit analysis of Tulsa’s IDA program
  Greenberg, David H.
• Warp-Level CFG Construction for GPU Kernel WCET Analysis
  Jeanmougin, Louison ; Sotin, Pascal ; Rochange, Christine ; Carle, Thomas 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Visitor Optimization Revisited - Realizing Traversal Graph Pruning by Runtime Bytecode Generation
  Lepper, Markus ; Trancón y Widemann, Baltasar 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tyrolean Complexity Tool: Features and Usage
  Avanzini, Martin ; Moser, Georg 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Combination Framework for Complexity
  Avanzini, Martin ; Moser, Georg 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Complexity of Quantitative Information Flow in Recursive Programs
  Chadha, Rohit ; Ummels, Michael 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Static Analysis for Checking Data Format Compatibility of Programs
  Devaki, Pranavadatta ; Kanade, Aditya 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
  Bonsma, Paul 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik