Write in a clean editor, then format for ACM SIGLOG News 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 SIGLOG News is a peer-reviewed journal published by ACM, covering Logic, programming, and type systems, Formal Methods in Verification, Logic, Reasoning, and Knowledge.
| 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 SIGLOG News 12, 3, Article 45 (2023).
Formats any DOI in ACM SIGLOG News style. No sign-up. |
| Publishes research in | Logic, programming, and type systems Formal Methods in Verification Logic, Reasoning, and Knowledge semigroups and automata theory Computability, Logic, AI Algorithms |
| ISSN | 2372-3491 |
| Citation impact (2-yr) | 0.08 |
| h-index | 19 |
| i10-index | 35 |
| Total citations | 1,092 |
| Top institutions publishing here | University of Groningen |
| Journal website | siglog.hosting.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.
Concurrent Separation Logic (CSL) was originally advanced in papers of the authors published in Theoretical Computer Science for John Reynolds's 70th Birthday Festschrift (2007). Preliminary versions appeared as invited papers in the CONCUR'04 conference proceedings. Foundational work leading to these papers began in 2002. Since then there have been significant developments stemming from CSL, both…
The robust theory of regular languages is based on three important pillars: computation (automata), logic, and algebra. In this paper, we survey old and recent results on extensions of these pillars to functions from words to words. We consider two important classes of word functions, the rational and regular functions, respectively defined by one-way and…
The first-order theory of the integers with addition and order, commonly known as Presburger arithmetic, has been a central topic in mathematical logic and computer science for almost 90 years. Presburger arithmetic has been the starting point for numerous lines of research in automata theory, model theory and discrete geometry. In formal verification, Presburger arithmetic…
This paper is intended as an informal and accessible survey of proof complexity for non-experts, focusing on some comparatively weak proof systems of particular interest in connection with SAT solving. We review resolution, polynomial calculus, and cutting planes (related to conflict-driven clause learning, Gröbner basis computations, and pseudo-Boolean solving, respectively) and some complexity measures that…
During the last three decades, there has been considerable research devoted to the symbolic analysis of security protocols and existing tools have had considerable success both in detecting attacks on protocols and showing their absence. Nevertheless, there is still a large discrepancy between the symbolic models that one specifies on paper and the models that…
ACM Transactions on Computation Theory
ACM Transactions on Computer-Human Interaction
ACM Transactions on Cyber-Physical Systems
ACM Transactions on Economics and Computation
ACM Transactions on Graphics
ACM Transactions on Intelligent Systems and Technology
ACM Transactions on Internet Technology
ACM Transactions on Mathematical Software
