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

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

Programming the world of uncertain things (keynote)

Breaking through the normalization barrier: a self-interpreter for f-omega

Temporal verification of higher-order functional programs

Query-guided maximum satisfiability

Fully-abstract compilation by approximate back-translation

Decidability of inferring inductive invariants

Dependent types and multi-monadic effects in F*

Automatic patch generation by learning correct code

Chapar: certified causally consistent distributed key-value stores

Principal type inference for GADTs

Combining static analysis with probabilistic models to enable market-scale Android inter-component analysis

SMO: an integrated approach to intra-array and inter-array storage optimization

Effects as sessions, sessions as effects

Modelling the ARMv8 architecture, operationally: concurrency and ISA

Newtonian program analysis via tensor product

Lattice-theoretic progress measures and coalgebraic model checking

Learning programs from noisy data

Synthesis of reactive controllers for hybrid systems (keynote)

Type theory in type theory using quotient inductive types

Scaling network verification using symmetry and surgery

String solving with word equations and transducers: towards a logic for analysing mutation XSS

Lightweight verification of separate compilation

The hardness of data packing

Fabular: regression formulas as probabilistic programming

Estimating types in binaries using predictive modeling

'Cause I'm strong enough: Reasoning about consistency choices in distributed systems

Abstracting gradual typing

Abstraction refinement guided by a learnt probabilistic model

PolyCheck: dynamic verification of iteration space transformations on affine programs

Monitors and blame assignment for higher-order session types

A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions

Casper: an efficient approach to call trace collection

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

Optimizing synthesis with metasketches

Confluences in programming languages research (keynote)

System f-omega with equirecursive types for datatype-generic programming

Model checking for symbolic-heap separation logic with inductive predicates

Symbolic computation of differential equivalences

From MinX to MinC: semantics-driven decompilation of recursive datatypes

The complexity of interaction

Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs

A program logic for concurrent objects under fair scheduling

The gradualizer: a methodology and algorithm for generating gradual type systems

Learning invariants using decision trees and implication counterexamples

Printing floating-point numbers: a faster, always correct method

Environmental bisimulations for probabilistic higher-order languages

Overhauling SC atomics in C11 and OpenCL

Pushdown control-flow analysis for free

Memoryful geometry of Interaction II: recursion and adequacy

Maximal specification synthesis

A theory of effects and resources: adjunction models and polarised calculi

Reducing crash recoverability to reachability

Unboundedness and downward closures of higher-order pushdown automata

Sound type-dependent syntactic language extension

Transforming spreadsheet data types using examples

PSync: a partially synchronous language for fault-tolerant distributed algorithms

Is sound gradual typing dead?

Symbolic abstract data type inference

Taming release-acquire consistency

Binding as sets of scopes

Example-directed synthesis: a type-theoretic interpretation

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

Content Provider	ACM Digital Library
Author	Ibsen-Jensen, Rasmus Pavlogiannis, Andreas Goharshady, Amir Kafshdar Chatterjee, Krishnendu
Abstract	We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks. .
Starting Page	733
Ending Page	747
Page Count	15
File Format	PDF
ISBN	9781450335492
DOI	10.1145/2837614.2837624
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-01-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Constant-treewidth graphs Shortest path Algebraic path properties Concurrent systems
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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