English
Related papers

Related papers: Compositional Shape Analysis with Shared Abduction…

200 papers

Shape analysis is of great importance for the verification of the correctness and memory-safety of heap-manipulating programs, yet such analyses have been shown to be highly difficult problems. The integration of separation logic into shape…

Logic in Computer Science · Computer Science 2020-06-19 Christopher Curry , Quang Loc Le

Memory safety is an essential correctness property of software systems. For programs operating on linked heap-allocated data structures, the problem of proving memory safety boils down to analyzing the possible shapes of data structures,…

Programming Languages · Computer Science 2024-08-20 Sebastian Wolff , Ekanshdeep Gupta , Zafer Esen , Hossein Hojjat , Philipp Rümmer , Thomas Wies

This paper introduces a new hybrid memory analysis, Structural Analysis, which combines an expressive shape analysis style abstract domain with efficient and simple points-to style transfer functions. Using data from empirical studies on…

Programming Languages · Computer Science 2012-01-06 Mark Marron

We investigate array separation logic (ASL), a variant of symbolic-heap separation logic in which the data structures are either pointers or arrays, i.e., contiguous blocks of allocated memory. This logic provides a language for…

Logic in Computer Science · Computer Science 2016-11-21 James Brotherston , Nikos Gorogiannis , Max Kanovich

Advances in natural language processing have resulted in increased capabilities with respect to multiple tasks. One of the possible causes of the observed performance gains is the introduction of increasingly sophisticated text…

Computation and Language · Computer Science 2020-11-19 Sarah Tymochko , Zachary New , Lucius Bynum , Emilie Purvine , Timothy Doster , Julien Chaput , Tegan Emerson

The rules in a shape grammar apply in terms of embedding to take advantage of the parts that emerge visually in the appearance of shapes. While the shapes are kept unanalyzed as a computation moves forward, part-structures for shapes can be…

Formal Languages and Automata Theory · Computer Science 2022-03-15 Alexandros Haridis , George Stiny

We investigate the addition of constraints on the function image and its derivatives for the incorporation of prior knowledge in symbolic regression. The approach is called shape-constrained symbolic regression and allows us to enforce e.g.…

Neural and Evolutionary Computing · Computer Science 2021-06-01 Gabriel Kronberger , Fabricio Olivetti de França , Bogdan Burlacu , Christian Haider , Michael Kommenda

We present abstract acceleration techniques for computing loop invariants for numerical programs with linear assignments and conditionals. Whereas abstract interpretation techniques typically over-approximate the set of reachable states…

Programming Languages · Computer Science 2014-01-07 Bertrand Jeannet , Peter Schrammel , Sriram Sankaranarayanan

Computational analysis of performed music is a key component of music information research, as performance shapes much of the music we hear. Music performance analysis studies the acoustic variations introduced by performers and how these…

Sound · Computer Science 2026-05-06 Corentin Guichaoua , Daniel Bedoya , Elaine Chew

A demand-driven approach to program analysis have been viewed as efficient algorithms to compute only the information required to serve a target demand. In contrast, an exhaustive approach computes all information in anticipation of it…

Programming Languages · Computer Science 2018-02-06 Swati Jaiswal , Uday P. Khedker , Supratik Chakraborty

Abduction is one of the most important forms of reasoning; it has been successfully applied to several practical problems such as diagnosis. In this paper we investigate whether the computational complexity of abduction can be reduced by an…

Artificial Intelligence · Computer Science 2007-07-25 Paolo Liberatore , Marco Schaerf

The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…

Logic in Computer Science · Computer Science 2018-02-21 Henning Basold

One of the main challenges in the verification of software systems is the analysis of unbounded data structures with dynamic memory allocation, such as linked data structures and arrays. We describe Bohne, a new analysis for verifying data…

Programming Languages · Computer Science 2007-05-23 Thomas Wies , Viktor Kuncak , Karen Zee , Andreas Podelski , Martin Rinard

Abstraction (in its various forms) is a powerful established technique in model-checking; still, when unbounded data-structures are concerned, it cannot always cope with divergence phenomena in a satisfactory way. Acceleration is an…

Logic in Computer Science · Computer Science 2013-10-04 Francesco Alberti , Silvio Ghilardi , Natasha Sharygina

Composed image retrieval searches for a target image based on a multi-modal user query comprised of a reference image and modification text describing the desired changes. Existing approaches to solving this challenging task learn a mapping…

Computer Vision and Pattern Recognition · Computer Science 2023-11-07 Zheyuan Liu , Weixuan Sun , Yicong Hong , Damien Teney , Stephen Gould

In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…

Computational Complexity · Computer Science 2010-06-28 Nadia Creignou , Johannes Schmidt , Michael Thomas

Chord recognition systems depend on robust feature extraction pipelines. While these pipelines are traditionally hand-crafted, recent advances in end-to-end machine learning have begun to inspire researchers to explore data-driven methods…

Machine Learning · Computer Science 2016-12-16 Filip Korzeniowski , Gerhard Widmer

The recent criticisms of the robustness of post hoc model approximation explanation methods (like LIME and SHAP) have led to the rise of model-precise abductive explanations. For each data point, abductive explanations provide a minimal…

Artificial Intelligence · Computer Science 2023-10-13 Gagan Biradar , Yacine Izza , Elita Lobo , Vignesh Viswanathan , Yair Zick

Failure attribution in multi-agent systems -- pinpointing the exact step where a decisive error occurs -- is a critical yet unsolved challenge. Current methods treat this as a pattern recognition task over long conversation logs, leading to…

Artificial Intelligence · Computer Science 2025-09-24 Alva West , Yixuan Weng , Minjun Zhu , Zhen Lin , Zhiyuan Ning , Yue Zhang

We propose a novel approach for spoofed speech characterization through explainable probabilistic attribute embeddings. In contrast to high-dimensional raw embeddings extracted from a spoofing countermeasure (CM) whose dimensions are not…

Audio and Speech Processing · Electrical Eng. & Systems 2024-09-18 Manasi Chhibber , Jagabandhu Mishra , Hyejin Shim , Tomi H. Kinnunen
‹ Prev 1 2 3 10 Next ›