Write in a clean editor, then format for ACM Transactions on Programming Languages and Systems in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM Transactions on Programming Languages and Systems is a peer-reviewed journal published by ACM, covering Logic, programming, and type systems, Formal Methods in Verification, Parallel Computing and Optimization Techniques. Over its lifetime it has published 1,296 papers, which have received 109,021 citations.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Transactions on Programming Languages and Systems 12, 3, Article 45 (2023).
Formats any DOI in ACM Transactions on Programming Languages and Systems style. No sign-up. |
| Publishes research in | Logic, programming, and type systems Formal Methods in Verification Parallel Computing and Optimization Techniques Distributed systems and fault tolerance Software Testing and Debugging Techniques |
| ISSN | 0164-0925 |
| Citation impact (2-yr) | 1.47 |
| h-index | 141 |
| i10-index | 918 |
| Top institutions publishing here | Carnegie Mellon University |
| Journal website | toplas.acm.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enemy city. Communicating only by messenger, the generals must agree upon a common battle plan.…
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent system. We also show how this approach can be adapted…
A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent objects that exploits the semantics of abstract data types. It permits a high degree of concurrency, yet it permits programmers to specify and reason about concurrent objects using known techniques from the sequential domain. Linearizability provides the…
In this paper we present an intermediate program representation, called the program dependence graph ( PDG ), that makes explicit both the data and control dependences for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. Control dependences are introduced to analogously represent…
Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control. Virtual time provides a flexible abstraction of real time in much the same way that virtual memory provides an abstraction of real memory. It is implemented…
ACM Transactions on Architecture and Code Optimization
ACM Transactions on Computing Education
ACM Transactions on Evolutionary Learning and Optimization
ACM Transactions on Internet Technology
ACM Transactions on Parallel Computing
ACM Transactions on Social Computing
Journal of Energy Resources Technology, Part B: Subsurface Energy and Carbon Capture
Journal of Mechanisms and Robotics
