Related papers: Retrograde Program Analysis: A Practical Tutorial

Retrograde Program Analysis: A Practical Tutorial

URL: http://arxiv.org/abs/1006.2534v9
Date: Tue, 16 Sep 2025 21:13:05 GMT
Title: Retrograde Program Analysis: A Practical Tutorial
Authors: Aleksandar Perisic,
Abstract summary: This tutorial condenses a longer exposition to a focused guide with definitions.<n>The aim is practical: short proofs, concrete invariants, and drop-in code and property tests.
Score: 51.56484100374058
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Retrograde analysis reads programs from the end to the beginning: treat statements as constraints on prior states, propagate sets of states backward, and compare the reachable inputs with the intended specification. This tutorial condenses a longer exposition to a focused guide with definitions, worked examples (toy branches, sorting networks, binary search), loop treatment via fixpoints, and a range-algebra appendix that standardizes array splits and midpoints. The aim is practical: short proofs, concrete invariants, and drop-in code and property tests

Related papers

GRainsaCK: a Comprehensive Software Library for Benchmarking Explanations of Link Prediction Tasks on Knowledge Graphs [0.0]
Explanation methods tackle this issue by identifying supporting knowledge explaining the predicted facts.<n>We propose GRainsaCK, a reusable software resource that fully streamlines all the tasks involved in benchmarking explanations.<n>GRainsaCK furthers modularity/extensibility by implementing the main components as functions that can be easily replaced.
arXiv Detail & Related papers (2025-08-12T10:15:58Z)
ListConRanker: A Contrastive Text Reranker with Listwise Encoding [27.017035527335402]
We propose a novel Listwise-encoded Contrastive text reRanker (ListConRanker)<n>It can help the passage to be compared with other passages during the encoding process.<n>It achieves state-of-the-art performance on the reranking benchmark of Chinese Massive Text Embedding Benchmark.
arXiv Detail & Related papers (2025-01-13T07:51:46Z)
Algorithmic Details behind the Predator Shape Analyser [0.0]
This chapter concentrates on a detailed description of the algorithms behind the Predator shape analyser. Predator is particularly suited for formal analysis and verification of sequential non-recursive C code.
arXiv Detail & Related papers (2024-03-27T12:05:49Z)
SMATCH++: Standardized and Extended Evaluation of Semantic Graphs [4.987581730476023]
The Smatch metric is a popular method for evaluating graph distances. We show how to fully conform to annotation guidelines that allow structurally deviating but valid graphs. For improved scoring, we propose standardized and extended metric calculation of fine-grained sub-graph meaning aspects.
arXiv Detail & Related papers (2023-05-11T17:29:47Z)
On Parsing as Tagging [66.31276017088477]
We show how to reduce tetratagging, a state-of-the-art constituency tagger, to shift--reduce parsing. We empirically evaluate our taxonomy of tagging pipelines with different choices of linearizers, learners, and decoders.
arXiv Detail & Related papers (2022-11-14T13:37:07Z)
On the Evaluation of Answer-Agnostic Paragraph-level Multi-Question Generation [57.630606799713526]
We study the task of predicting a set of salient questions from a given paragraph without any prior knowledge of the precise answer. First, we propose a new method to evaluate a set of predicted questions against the set of references by using the Hungarian algorithm to assign predicted questions to references before scoring the assigned pairs. Second, we compare different strategies to utilize a pre-trained seq2seq model to generate and select a set of questions related to a given paragraph.
arXiv Detail & Related papers (2022-03-09T00:55:54Z)
Comprehensive Studies for Arbitrary-shape Scene Text Detection [78.50639779134944]
We propose a unified framework for the bottom-up based scene text detection methods. Under the unified framework, we ensure the consistent settings for non-core modules. With the comprehensive investigations and elaborate analyses, it reveals the advantages and disadvantages of previous models.
arXiv Detail & Related papers (2021-07-25T13:18:55Z)
SOLD2: Self-supervised Occlusion-aware Line Description and Detection [95.8719432775724]
We introduce the first joint detection and description of line segments in a single deep network. Our method does not require any annotated line labels and can therefore generalize to any dataset. We evaluate our approach against previous line detection and description methods on several multi-view datasets.
arXiv Detail & Related papers (2021-04-07T19:27:17Z)
Self-Supervised Tuning for Few-Shot Segmentation [82.32143982269892]
Few-shot segmentation aims at assigning a category label to each image pixel with few annotated samples. Existing meta-learning method tends to fail in generating category-specifically discriminative descriptor when the visual features extracted from support images are marginalized in embedding space. This paper presents an adaptive framework tuning, in which the distribution of latent features across different episodes is dynamically adjusted based on a self-segmentation scheme.
arXiv Detail & Related papers (2020-04-12T03:53:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.