yusuke1997/dblp-id-title huggingface dataset:
Probabilistic Horn Clause Verification
Polyhedral Analysis for Synchronous Languages
Checking Cleanness in Linked Lists
Interactive Verification of Distributed Protocols Using Decidable Logic
Trace Partitioning as an Optimization Problem
Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs
Effective Soundness-Guided Reflection Analysis
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Satisfying Subtype Inequalities in Polynomial Space
Fast Strictness Analysis Via Symbolic Fixpoint Iteration
Verification as Learning Geometric Concepts
Freeness, Sharing, Linearity and Correctness - All at Once
Understanding the Origin of Alarms in Astrée
Invertible Linear Transforms of Numerical Abstract Domains
An Analysis/Synthesis Language with Learning Strategies
Static Analysis of Non-interference in Expressive Low-Level Languages
Abstracting Cryptographic Protocols with Tree Automata
Algorithmic Program Synthesis with Partial Programs and Decision Procedures
Modular Static Analysis with Zonotopes
Automatic Abstraction for Intervals Using Boolean Formulae
From Concrete Examples to Heap Manipulating Programs
Block Me If You Can! - Context-Sensitive Parameterized Verification
Fast Abstract Interpretation Using Sequential Algorithms
Satisfiability Modulo Recursive Programs
Transforming Programs to Eliminate Intermediate Structures
Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction
Robustness Verification of Multi-label Neural Network Classifiers
Transforming Abstract Interpretations by Abstract Interpretation
From Secrecy to Authenticity in Security Protocols
Finding Fixpoints in Finite Function Spaces Using Neddedness Analysis and Chaotic Iteration
Closing the Performance Gap Between Doubles and Rationals for Octagons
Witnessing Program Transformations
Cache Behavior Prediction by Abstract Interpretation
A Generalization of Stålmarck's Method
More Precise Yet Efficient Type Inference for Logic Programs
A Behavioral Module System for the Pi-Calculus
Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants
Region Analysis for Race Detection
Refactoring Using Type Constraints
Relational Analysis of Correlation
Liveness-Based Pointer Analysis
Lifting On-Demand Analysis to Higher-Order Languages
Challenges in Developing Useful and Practical Static Analysis for Logic Programs
Securing Communication in a Concurrent Language
A Type-based Analysis for Stack Allocation in Functional Languages
A Programming Language for Feasible Solutions
Numerical Invariants via Abstract Machines
Usage Analysis with Natural Reduction Types
Abstract Interpretation of Mobile Ambients
LSign Reordered
Securing the SSA Transform
Combining Forward and Backward Abstract Interpretation of Horn Clauses
Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs
Static Analysis of Dynamic Communication Systems by Partner Abstraction
Fast and Incremental Computation of Weak Control Closure
A New Algorithm for Identifying Loops in Decompilation
Deriving Numerical Abstract Domains via Principal Component Analysis
The Impact of Granularity in Abstract Interpretation of Prolog
Using Dependent Types to Certify the Safety of Assembly Code
Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs
Cost-Aware Automatic Program Repair
From Typed Process Calculi to Source-Based Security
A Relational Abstraction for Functions
Stack Size Analysis for Interrupt-Driven Programs
Probabilistic Abstractions with Arbitrary Domains
Catching and Identifying Bugs in Register Allocation
Towards Optimization of Full Prolog Programs guided by Abstract Interpretation
Static Analyses of the Precision of Floating-Point Operations
Abstraction Refinement for Quantified Array Assertions
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
Selective Tail Call Elimination
Abstraction Refinement for Termination
Embedding Chaos
Static Analysis - 27th International Symposium, SAS 2020, Virtual Event, November 18-20, 2020, Proceedings
Security-Typed Languages and Distributed Computation
Abstract Interpretation with Specialized Definitions
Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis
Static Analysis of the Numerical Stability of Loops
Invariant Checking for Programs with Procedure Calls
Arithmetic Strengthening for Shape Analysis
Verifying Bounded Subset-Closed Hyperproperties
Fixing Latent Unsound Abstract Operators in the eBPF Verifier of the Linux Kernel
Pointer-Range Analysis
Cleanness Checking of String Manipulations in C Programs via Integer Analysis
Static Analysis - 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings
A Tool for Abstract Interpretation: Dynamic Programming
A Change-Based Heuristic for Static Analysis with Policy Iteration
Heap Decomposition for Concurrent Shape Analysis
Speeding Up Logico-Numerical Strategy Iteration
Extracting Non-Strict Independent And-Parallelism Using Sharing and Freeness Information
Shape Analysis with Structural Invariant Checkers
Cartesian Factoring of Polyhedra in Linear Relation Analysis
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
How Fitting is Your Abstract Domain?
Termination Analysis for Partial Functions
Relational Verification Through Horn Clause Transformation
The Flow-Insensitive Precision of Andersen's Analysis in Practice
Boxes: A Symbolic Abstract Domain of Boxes
Static Analysis - 25th International Symposium, SAS 2018, Freiburg, Germany, August 29-31, 2018, Proceedings
Confidentiality Analysis of Mobile Systems
Inference Systems for Binding Time Analysis
Decomposing Non-redundant Sharing by Complementation
Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
Precise Widening Operators for Convex Polyhedra
Type Systems for Distributed Data Sharing
Program Generators and the Tools to Make Them
Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages
An Efficient Abstract Domain for Not Necessarily Closed Polyhedra
A Voyage to the Deep-Heap
Decompilation is the Efficient Enumeration of Types
Interprocedural Shape Analysis with Separated Heap Abstractions
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra
Binding-Time Analysis for Both Static and Dynamic Expressions
Contextual Equality Saturation
A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs
The Correctness of Set-Sharing
Revisiting Polyhedral Analysis for Hybrid Systems
Data-Flow-Based Virtual Function Resolution
Modular Heap Analysis for Higher-Order Programs
A New Abstraction Framework for Affine Transformers
Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs
Understanding Mobile Agents via a Non-Interleaving Semantics for Facile
Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis
Combining Widening and Acceleration in Linear Relation Analysis
A Temporal Logic for Higher-Order Functional Programs
Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem
Programming Language Design and Analysis Motivated by Hardware Evolution
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
Relative Store Fragments for Singleton Abstraction
Principles of Staged Static+Dynamic Partial Analysis
Abstract Interpretation Based Static Analysis Parameterized by Semantics
Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To Graphs
Structural Invariants
STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation
Static Analysis - 18th International Symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings
On the Complexity Analysis of Static Analyses
Abstract Neural Networks
Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings
Can Abstract Interpretation Become a Mainstream Compiler Technology? (Abstract)
From Array Domains to Abstract Interpretation Under Store-Buffer-Based Memory Models
Memory Leak Analysis by Contradiction
Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract)
Hiding Software Watermarks in Loop Structures
Loop Leaping with Closures
Type-Safe Optimisation of Plugin Architectures
Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables
Deductive Verification in Decidable Fragments with Ivy
Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
Partial Evaluation of an Intermediate Language for Equational Programs
Side-Effect Analysis of Assembly Code
Abstract Interpretation of Programs as Markov Decision Processes
Extending Constraint-Only Representation of Polyhedra with Boolean Constraints
Bounded Abstract Interpretation
Static Analysis of Accessed Regions in Recursive Data Structures
Completeness in Approximate Transduction
Abstract Semantic Dependency
Static Provenance Verification for Message Passing Programs
Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis
An Even Faster Solver for General Systems of Equations
Static Analysis of Endian Portability by Abstract Interpretation
Refinement Types for Program Analysis
Une représentation abstraite des expressions et continuations en Scheme
Efficient Closure Utilisation by Higher-Order Inheritance Analysis
Toward a Sound Analysis of Guarded LTI Loops with Inputs by Abstract Acceleration
Static Analysis - 26th International Symposium, SAS 2019, Porto, Portugal, October 8-11, 2019, Proceedings
Modular Safety Checking for Fine-Grained Concurrency
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings
Static Analysis of String Manipulations in Critical Embedded C Programs
A Polynomial-Time Algorithm for Global Value Numbering
The PER Model of Abstract Non-interference
Toward Neural-Network-Guided Program Synthesis and Verification
A Comparison of Three Occur-Check Analysers
Static Analysis of CLP Programs over Numeric Domains
Abstract Interpretation of Combinational Asynchronous Circuits
Directed Symbolic Execution
Analysis of the Equality Relations for the Program Terms
Static Analysis for Logic Program Specification
Predicate Abstraction for Relaxed Memory Models
A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs
A propos du contrôle de la résolution
Reuse of Results in Termination Analysis of Typed Logic Programs
On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract)
Structure-Sensitive Points-To Analysis for C and C++
On Program Equivalence with Reductions
Static Analysis, 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007, Proceedings
Parameterized Recursive Refinement Types for Automated Program Verification
Formalised Inductive Reasoning in the Logic of Bunched Implications
Static Analysis, 8th International Symposium, SAS 2001, Paris, France, July 16-18, 2001, Proceedings
Static Verification for Code Contracts
Cryptographically-Masked Flows
A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives
Lift-Offline: Instruction Lifter Generators
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions
Stackability in the Simply-Typed Call-by-Value Lambda Calculus
Precise Analysis of String Expressions
Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation
An Implementation of Parametrized Partial Evaluation
About Synchronous Programming and Abstract Interpretation
Efficient May Happen in Parallel Analysis for Async-Finish Parallelism
Static Analysis of Quantum Programs
Proving Correctness of Constraint Logic Programs with Dynamic Scheduling
Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs
Partitioning Non-strict Functional Languages for Multi-threaded Code Generation
Minimal Thunkification
Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization
Finding Basic Block and Variable Correspondence
On Termination of Logic Programs with Floating Point Computations
Modal Abstractions of Concurrent Behaviour
Analysing Approximate Confinement under Uniform Attacks
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving
Tupling Functions with Multiple Recursion Parameters
Static Analysis, 5th International Symposium, SAS '98, Pisa, Italy, September 14-16, 1998, Proceedings
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
Portability Analysis for Weak Memory Models. PORTHOS: One Tool for all Models
Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data
Polynomial Analysis of Modular Arithmetic
Loop Transformations for Reducing Data Space Requirements of Resource-Constrained Applications
BinSub: The Simple Essence of Polymorphic Type Inference for Machine Code
Computer-Assisted Verification of a Protocol for Certified Email
BREWasm: A General Static Binary Rewriting Framework for WebAssembly
Polymorphic Fractional Capabilities
Abstract Semantic Diffing of Evolving Concurrent Programs
Octagons Revisited - Elegant Proofs and Simplified Algorithms
The Effects of the Precision of Pointer Analysis
Strictness and Totality Analysis
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants
Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction
Reflections on Program Optimization
Program Analysis Using Symbolic Ranges
Localizing Widening and Narrowing
On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines
Analysis of Concurrent Transactions in a Functional Database Programming Language
A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware
Abstract Interpretation of ReLU Neural Networks with Optimizable Polynomial Relaxations
Abstracting Cryptographic Protocols by Prolog Rules
Memory-Efficient Fixpoint Computation
Abstract Interpretation Based Semantics of Sequent Calculi
Enforcing Design Constraints with Object Logic
Static Analysis and Software Assurance
Quantitative Static Analysis of Communication Protocols Using Abstract Markov Chains
Boosting Multi-neuron Convex Relaxation for Neural Network Verification
Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding
Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation
Specifying and Verifying Future Conditions
Coalescing Conditional Branches into Efficient Indirect Jumps
Compositional Verification and 3-Valued Abstractions Join Forces
Invariant Inference with Provable Complexity from the Monotone Theory
Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract)
Automated Synthesis of Asynchronizations
Fairness: A Formal-Methods Perspective
Inferring Dataflow Properties of User Defined Table Processors
Termination Analysis for Mercury
Freeness Analysis Through Linear Refinement
Order-of-Demand Analysis for Lazy Languages
Error Localization for Sequential Effect Systems
State Space Reduction Based on Live Variables Analysis
Software Verification Using k-Induction
Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods
Transformation of Gamma Programs
Code Specialization Based on Value Profiles
Program Development Using Abstract Interpretation (And The Ciao System Preprocessor)
Automatic Verification of Determinism for Structured Parallel Programs
Verification of Programs with ADTs Using Shallow Horn Clauses
A Reduced Product of Absolute and Relative Error Bounds for Floating-Point Analysis
Bootstrapping Library-Based Synthesis
Type Analysis for JavaScript
Protocol Inference Using Static Path Profiles
Concurrency Analysis for Java
Memory Usage Verification for OO Programs
Static Analysis, 16th International Symposium, SAS 2009, Los Angeles, CA, USA, August 9-11, 2009. Proceedings
Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing
Analysing All Polynomial Equations in
Symbolic Automata for Static Specification Mining
Combining Dependability with Architectural Adatability by Means of the SIGNAL Language
Region Inference for Higher-Order Functional Languages
Solving Invariant Generation for Unsolvable Loops
A Forward Analysis for Recurrent Sets
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely
Abstract Domains for Sharing Analysis by Optimal Semantics
Bidirectional Data Flow Analysis in Code Motion: Myth and Reality
Semantics-Directed Program Analysis: A Tool-Maker's Perspective
On a Simple Problem Due to Yves Bertot
Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Parameterizing a Groundness Analysis of Logic Programs
Safety of Strictness Analysis via Term Graph Rewriting
Full Control-Flow Sensitivity for Definitional Interpreters
Fast and Precise Handling of Positive Weight Cycles for Field-Sensitive Pointer Analysis
Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Programs
Inserting Safe Memory Reuse Commands into ML-Like Programs
Trust in the lambda-Calculus
On Solving Universally Quantified Horn Clauses
Program Transformation in a Nonmonotonic Reasoning System
Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation
Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations
Learning Shape Analysis
Representation Analysis for Coercion Placement
Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation
Abstract Interpretation of Probabilistic Semantics
Astrée: From Research to Industry
Refinement of LTL Formulas for Abstract Model Checking
Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite
Data-Abstraction Refinement: A Game Semantic Approach
Safety Verification and Refutation by k-Invariants and k-Induction
Static Analysis, 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006, Proceedings
Flattening Is an Improvement
Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems
CLEVEREST: Accelerating CEGAR-based Neural Network Verification via Adversarial Attacks
Hyperhierarchy of Semantics - A Formal Framework for Hyperproperties Verification
Type Inference Against Races
GENA - A Tool for Generating Prolog Analyzers from Specifications
Language Inclusion Algorithms as Complete Abstract Interpretations
Guided Static Analysis
Model Checking Guided Abstraction and Analysis
A Polyvariant Binding Time Analysis Handling Partially Known Values
Local Shape Analysis for Overlaid Data Structures
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
Closed and Logical Relations for Over- and Under-Approximation of Powersets
Simple and Efficient Computation of Minimal Weak Control Closure
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
The Julia Static Analyzer for Java
Ductape: Optimizing Dynamically Typed Programs Using Ahead-of-Time Compilation and Data-Flow Analysis
Constraint-Based Linear-Relations Analysis
Formal Analysis of Networked PLC Controllers Interacting with Physical Environments
TVLA: A System for Implementing Static Analyses
Attribute Grammars and Functional Programming Deforestation
Static Analysis, Second International Symposium, SAS'95, Glasgow, UK, September 25-27, 1995, Proceedings
Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings
Optimal Abstraction on Real-Valued Programs
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)
A Symbolic Semantics for Abstract Model Checking
From Processor Timing Specifications to Static Intruction Scheduling
An Abstract Interpretation Algorithm for Residuating Logic Programs
An Abstract Interpretation Framework for Analysing Mobile Ambients
Synthesis of Directionality Information for Functional Logic Programs
Static Analysis, 4th International Symposium, SAS '97, Paris, France, September 8-10, 1997, Proceedings
Accelerating Program Analyses in Datalog by Merging Library Facts
Semantics-Based Transformation of Arithmetic Expressions
Non Functional Properties Can Guide Program Developments
On the Linear Ranking Problem for Simple Floating-Point Loops
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis
Static Analysis - 24th International Symposium, SAS 2017, New York, NY, USA, August 30 - September 1, 2017, Proceedings
Using Abstract Interpretation for Gate splitting in LOTOS Specifications
Boosting Robustness Verification of Semantic Feature Neighborhoods
Verifying Numerical Programs via Iterative Abstract Testing
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
New Applications of Software Synthesis: Verification of Configuration Files and Firewall Repair
Unified Analysis of Array and Object References in Strongly Typed Languages
Craig Interpretation
May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization
Quantitative Monitor Automata
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
The Impact of Program Transformations on Static Program Analysis
Finiteness Conditions for Strictness Analysis
Symbolic Learning of Component Interfaces
Probabilistically Accurate Program Transformations
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Cost Analysis of Smart Contracts Via Parametric Resource Analysis
Program Analysis and Machine Learning: A Win-Win Deal
Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation
Proving the Correctness of the Implementation of a Control-Command Algorithm
The Mu-Calculus over Finite Domains as an Abstract Semantics of Prolog
Static Analysis with Set-Closure in Secrecy
Inferring Program Specifications in Polynomial-Time
Using Slicing to Identify Duplication in Source Code
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
On Logics of Aliasing
Inter-program Properties
Directional Type Checking of Logic Programs
A Binary Decision Tree Abstract Domain Functor
Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges
Existential Heap Abstraction Entailment Is Undecidable
Memory Space Conscious Loop Iteration Duplication for Reliable Execution
Polynomial Constants Are Decidable
Selectively-Amortized Resource Bounding
Type-Directed Flow Analysis for Typed Intermediate Languages
Verifying Recursive Programs Using Intraprocedural Analyzers
Modular Control Flow Analysis for Libraries
Modular Class Analysis with DATALOG
Partially Disjunctive Heap Abstraction
Strictness Meets Data Flow
Invisible Invariants and Abstract Interpretation
Pipeline Modeling for Timing Analysis
Abstract Semantic Differencing for Numerical Programs
Refinement Type Inference via Horn Constraint Optimization
Partial Dead Code Elimination Using Extended Value Graph
An Algebraic Approach to Sharing Analysis of Logic Programs
Contextual Locking for Dynamic Pushdown Networks
Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM
Block-Size Independence for GPU Programs
Precise Data Flow Analysis in the Presence of Correlated Method Calls
The Abstract Domain of Segmented Ranking Functions
Minimal Function Graphs are not Instrumented
Delta Store Semantics: Abstract Garbage Collection for Abstract Definitional Interpreters
Loopy: Programmable and Formally Verified Loop Transformations
Prédire à bon escient
Abstract Error Projection
Byte-Precise Verification of Low-Level List Manipulation
Program Analysis Using Mixed Term and Set Constraints