NDLI: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Please wait, while we are loading the content...

Automating Repetitive Tasks for the Masses

Functors are Type Refinement Systems

Runtime Enforcement of Security Policies on Black Box Reactive Programs

Summary-Based Context-Sensitive Data-Dependence Analysis in Presence of Callbacks

DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations

Safe & Efficient Gradual Typing for TypeScript

Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it

A Formally-Verified C Static Analyzer

Polymorphic Functions with Set-Theoretic Types: Part 2: Local Type Inference and Type Reconstruction

Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables

Programming up to Congruence

Proof Spaces for Unbounded Parallelism

K-Java: A Complete Semantics of Java

Coding by Everyone, Every Day

Databases and Programming: Two Subjects Divided by a Common Language?

Probabilistic Termination: Soundness, Completeness, and Compositionality

Full Abstraction for Signal Flow Graphs

Quantitative Interprocedural Analysis

Sound Modular Verification of C Code Executing in an Unverified Context

A Calculus for Relaxed Memory

Decentralizing SDN Policies

Integrating Linear and Dependent Types

Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Data-Parallel String-Manipulating Programs

Space-Efficient Manifest Contracts

From Communicating Machines to Graphical Choreographies

Analyzing Program Analyses

Principal Type Schemes for Gradual Programs

A Coalgebraic Decision Procedure for NetKAT

A Meta Lambda Calculus with Cross-Level Computation

Equations, Contractions, and Unique Solutions

Towards the Essence of Hygiene

Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems

Conjugate Hylomorphisms -- Or: The Mother of All Structured Recursion Schemes

Specification Inference Using Context-Free Language Reachability

Deep Specifications and Certified Abstraction Layers

Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning

Program Boosting: Program Synthesis via Crowd-Sourcing

Higher Inductive Types as Homotopy-Initial Algebras

Differential Privacy: Now it's Getting Personal

Predicting Program Properties from "Big Code"

Ur/Web: A Simple Model for Programming the Web

Manifest Contracts for Datatypes

A Scalable, Correct Time-Stamped Stack

Compositional CompCert

Dependent Information Flow Types

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

Algebraic Effects, Linearity, and Quantum Programming Languages

Succinct Representation of Concurrent Trace Sets

Self-Representation in Girard's System U

On Characterizing the Data Access Complexity of Programs

From Network Interface to Multithreaded Web Applications: A Case Study in Modular Program Verification

Tractable Refinement Checking for Concurrent Objects

Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Content Provider	ACM Digital Library
Author	Goyal, Prateesh Ibsen-Jensen, Rasmus Pavlogiannis, Andreas Chatterjee, Krishnendu
Abstract	Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, etc. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in a very important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect that we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing, but can answer subsequent queries significantly faster as compared to the current best-known solutions for several important problems, such as interprocedural reachability and shortest path. We provide a prototype implementation for interprocedural reachability and intraprocedural shortest path that gives a significant speed-up on several benchmarks.
Starting Page	97
Ending Page	109
Page Count	13
File Format	PDF QT / MOV
ISBN	9781450333009
DOI	10.1145/2676726.2676979
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-01-14
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Constant treewidth graphs Interprocedural analysis Reachability and shortest path. Dataflow analysis
Content Type	Video Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Faster algorithms for algebraic path properties in recursive state machines with constant treewidth (2015)

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth (2014)

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Subcubic algorithms for recursive state machines

Faster Shortest-path Algorithms for Planar Graphs Faster Shortest-path Algorithms for Planar Graphs

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth

Precise interprocedural dataflow analysis with applications to constant propagation (1996)

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Similar Documents

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Faster algorithms for algebraic path properties in recursive state machines with constant treewidth (2015)

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth (2014)

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Subcubic algorithms for recursive state machines

Faster Shortest-path Algorithms for Planar Graphs Faster Shortest-path Algorithms for Planar Graphs

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth

Precise interprocedural dataflow analysis with applications to constant propagation (1996)

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth