ACM Trans. Program. Lang. Syst

159 papers19 directions

Papers by Year

2026 3
2025 2
2024 3
2023 2
2022 7
2021 7
2020 3
2019 7
2018 6
2017 7
2016 3
2015 4
2014 7
2013 2
2012 2
2011 5
2010 5
2009 4
2008 7
2007 5
2006 5
2005 9
2004 4
2003 2
2002 3
2001 2
2000 3
1999 5
1998 8
1997 7
1996 3
1995 5
1994 5
1993 1
1992 2
1991 1
1990 1
1989 2
1988 2
1987 2
1984 2
1983 1
1980 2

Top Research Directions

Research directions most represented by papers from this venue.

Termination Analysis of Probabilistic Programs 2
Formal Verification of Heap-Manipulating Programs 2
Modeling Concurrent Processes with Petri Nets 1
Game Semantics for Higher-Order Program Verification 1
Hierarchical Variable Decomposition for Tractable Logical Reasoning 1
Bit-Precise Semantics for Formal Verification 1
Compositional Decomposition for Program Verification and Logical Reasoning 1
Navigating the Decidability Frontier in Program Verification 1
Synthesizing Programs by Unifying Partial Solutions 1
Verifying Concurrent Software Under Relaxed Memory Models 1
Equivalence Preserving Simplification of Logic Programs 1
Constraint-Driven Search Space Pruning 1
The Succinctness Tractability Trade-Off in Knowledge Compilation 1
Expressivity Constraints in Grammar-Constrained Program Synthesis 1
Graph Neural Networks for Wireless Interference Modeling 1

Top Authors

AuthorPapers
Thomas Reps20
Peter J. Stuckey10
Naoki Kobayashi6
Daniel Kroening5
Rajeev Alur5
Gail Kaiser4
Hongseok Yang4
Krishnendu Chatterjee4
Maria Garcia de la Banda4
Thomas A. Henzinger4
Daniel Rosenkrantz3
John Mitchell3
Martin Hirzel3
Wonchan Lee3
Yang Liu3
Catuscia Palamidessi2
Cristina David2
Haim Kaplan2
Haruo Hosoya2
Ian T. Foster2

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Eliminating synchronization bottlenecks using adaptive replication2003
Pointer analysis for structured parallel programs2003
An assume-guarantee rule for checking simulation2002
On the usefulness of type and liveness accuracy for garbage collection and leak detection2002
Parametric shape analysis via 3-valued logic2002
An indexed model of recursive types for foundational proof-carrying code2001
Model checking of hierarchical state machines2001
Incremental analysis of constraint logic programs2000
Independence in CLP languages2000
Undecidability of context-sensitive data-independence analysis2000
A global communication optimization technique based on data-flow analysis and linear algebra1999
Effectivness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming1999
Linearity and the pi-calculus1999
Sharing and groundness dependencies in logic programs1999
The type system for object initializatiion in the Jave bytecode language1999
A New, Simpler Linear-Time Dominators Algorithm1998
A Partially Deadlock-Free Typed Process Calculus1998
Finitary Fairness1998
Isomorph-Free Model Enumeration: A New Method for Checking Relational Specifications1998
"Maximal-munch" Tokenization in Linear Time1998
Optimizing Compilation of CLP(R)1998
Solving Shape-Analysis Problems in Languages with Destructive Updating1998
The Design, Implementation, and Evaluation of Jade1998
Commutativity Analysis: A New Analysis Technique for Parallelizing Compilers1997
Complementation in Abstract Interpretation1997
Evidence-Based Static Branch Prediction Using Machine Learning1997
On the Use of Regular Expressions for Searching Text1997
Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipelining1997
Proving Concurrent Constraint Programs Correct1997
Verifying Parameterized Networks1997
Compositional Parallel Programming Languages1996
Global Analysis of Constraint Logic Programs1996
Storage Assignment to Decrease Code Size1996
Backtracking without Trailing in CLP(R-lin)1995
Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation1995
Improving Abstract Interpretations by Combining Domains1995
Optimal Evaluation of Array Expressions on Massively Parallel Machines1995
Safe: A Semantic Technique for Transforming Programs in the Presence of Errors1995
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem1994
A Compiler Approach to Scalable Concurrent-Program Design1994
A Linear-Time Scheme for Version Reconstruction1994
Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG1994
Extending Attribute Grammars to Support Programming-in-the-Large1994
On the Type Structure of Standard ML1993
An Object-Based Programming Model for Shared Data1992
The CLP(R) Language and System1992
A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables1991
Interprocedural Slicing Using Dependence Graphs1990
Incremental Dynamic Semantics for Language-Based Programming Environments1989
Integrating Noninterfering Versions of Programs1989

« prev Page 3/4 next »