Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
The Complex(ity) Landscape of Checking Infinite Descent
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue POPLArticle No.: 46, Pages 1352–1384https://doi.org/10.1145/3632888Cyclic proof systems, in which induction is managed implicitly, are a promising approach to automatic verification. The soundness of cyclic proof graphs is ensured by checking them against a trace-based Infinite Descent property. Although the problem of ...
Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue OOPSLA2Article No.: 292, Pages 1993–2022https://doi.org/10.1145/3622868Algebraic Program Analysis (APA) is a ubiquitous framework that has been employed as a unifying model for various problems in data-flow analysis, termination analysis, invariant generation, predicate abstraction and a wide variety of other standard ...
The Bounded Pathwidth of Control-Flow Graphs
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue OOPSLA2Article No.: 232, Pages 292–317https://doi.org/10.1145/3622807Pathwidth and treewidth are standard and well-studied graph sparsity parameters which intuitively model the degree to which a given graph resembles a path or a tree, respectively. It is well-known that the control-flow graphs of structured goto-free ...
- research-articleOctober 2019
Qubit allocation as a combination of subgraph isomorphism and token swapping
- Marcos Yukio Siraichi,
- Vinícius Fernandes dos Santos,
- Caroline Collange,
- Fernando Magno Quintão Pereira
Proceedings of the ACM on Programming Languages (PACMPL), Volume 3, Issue OOPSLAArticle No.: 120, Pages 1–29https://doi.org/10.1145/3360546In 2016, the first quantum processors have been made available to the general public. The possibility of programming an actual quantum device has elicited much enthusiasm. Yet, such possibility also brought challenges. One challenge is the so called ...
Efficient parameterized algorithms for data packing
Proceedings of the ACM on Programming Languages (PACMPL), Volume 3, Issue POPLArticle No.: 53, Pages 1–28https://doi.org/10.1145/3290366There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are ...