„Program Analysis“

Suchergebnisse

7.892 Treffer

• Lifted Static Analysis of Dynamic Program Families by Abstract Interpretation (Artifact)
  Dimovski, Aleksandar S. ; Apel, Sven
• Enabling Additional Parallelism in Asynchronous JavaScript Applications (Artifact)
  Arteca, Ellen ; Tip, Frank ; Schäfer, Max
• Static Type Analysis by Abstract Interpretation of Python Programs (Artifact)
  Monat, Raphaël ; Ouadjaout, Abdelraouf ; Miné, Antoine
• Static Analysis of Shape in TensorFlow Programs (Artifact)
  Lagouvardos, Sifis ; Dolby, Julian ; Grech, Neville ; Antoniadis, Anastasios ; Smaragdakis, Yannis
• Automated Large-Scale Multi-Language Dynamic Program Analysis in the Wild (Artifact)
  Villazón, Alex ; Sun, Haiyang ; Rosà, Andrea ; Rosales, Eduardo ; Bonetta, Daniele ; Defilippis, Isabella ; Oporto, Sergio ; Binder, Walter
• Mailbox Abstractions for Static Analysis of Actor Programs (Artifact)
  Stiévenart, Quentin ; Nicolay, Jens ; De Meuter, Wolfgang ; De Roover, Coen
• Group Identity, Self-Concept, and Gender Bias: A Regression Analysis of Female Student Experiences Within Emergency Management-Related Higher Education Programs
  Wier, Lisa ; King Lewis, Amy ; McAleavy, Tony ; Li, Xiangyu (Dale)
• An analysis on component reliability of (n, k)-star networks
  Wang, Zhihang ; Liu, Jiafei ; Lee, Chia-Wei ; Wu, Jingli ; Li, Gaoshi
• Confluence of Conditional Rewriting Modulo
  Lucas, Salvador 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Constraint Programming with External Worst-Case Traversal Time Analysis
  Talbot, Pierre ; Hu, Tingting ; Navet, Nicolas 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
  Mexi, Gioni ; Berthold, Timo ; Gleixner, Ambros M. ; Nordström, Jakob 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Completeness for Program Correctness and Incorrectness (Invited Talk)
  Bruni, Roberto 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Integrating Cost and Behavior in Type Theory (Invited Talk)
  Harper, Robert 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Formalizing Hyperspaces for Extracting Efficient Exact Real Computation
  Konečný, Michal ; Park, Sewon ; Thies, Holger 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming
  Katsirelos, George 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Algorithm for Path-Edge Sampling
  Jeffery, Stacey ; Kimmel, Shelby ; Piedrafita, Alvaro 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Information Flow Analysis for Detecting Non-Determinism in Blockchain
  Olivieri, Luca ; Negrini, Luca ; Arceri, Vincenzo ; Tagliaferro, Fabio ; Ferrara, Pietro ; Cortesi, Agostino ; Spoto, Fausto 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Leveraging Tests to Infer Nullable Annotations
  Dietrich, Jens ; Pearce, David J. ; Chandramohan, Mahin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm
  Hsieh, Jun-Ting ; Kothari, Pravesh K. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Context-Bounded Analysis of Concurrent Programs (Invited Talk)
  Baumann, Pascal ; Ganardi, Moses ; Majumdar, Rupak ; Thinniyam, Ramanathan S. ; Zetzsche, Georg 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik