ACM-SIGACT Symposium on Principles of Programming Languages

POPL

CORE rank

CORE rank (raw)

Acceptance rate

26.0% (2024)

Fields of research

Software Engineering

Papers indexed

1,604

1973–2017

Best Software Engineering conferences

Papers per year

197368 peak2017

Most published authors

POPL papers

1,604 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
1976	A Complexity Theory of Grammar Problems.	Harry B. Hunt III
1976	A Lazy Evaluator.	Peter Henderson, James H. Morris Jr.
1976	Verifying Formal Specifications of Synchronous Processes.	Patricia P. Griffiths, Charles J. Prenner
1976	Test Data as an Aid in Proving Program Correctness.	Matthew M. Geller
1976	PLAN2D - Syntactic Analysis of Precedence Graph Grammars.	Reinhold Franck
1976	Induction Variables in Very High Level Languages.	Amelia C. Fong, Jeffrey D. Ullman
1976	Procedure Referencing Environments in SL5.	Dianne E. Britton, Frederick C. Druseikis, Ralph E. Griswold, David R. Hanson, Richard A. Holmes
1976	Primitive Recursive Program Transformations.	Robert S. Boyer, J Strother Moore, Robert E. Shostak
1976	An Algorithm for Structuring Programs.	Brenda S. Baker
1976	Code Generation for Expressions with Common Subexpressions.	Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman
1975	New Control Structures to Aid Gotolessness.	D. M. Symes
1975	An Algebraic Model for String Patterns.	Glenn F. Stewart
1975	Modes, Values, and Expressions.	Marvin H. Solomon
1975	Automatic Data Structure Choice in a Language of Very High Level.	Jacob T. Schwartz
1975	Programming Languages, Natural Languages, and Mathematics.	Peter Naur
1975	Computer Assisted Application Definition.	Martin Mikelsons
1975	Reduction: A New Method of Proving Properties of Systems of Processes.	Richard J. Lipton
1975	A Mathematical Approach to Language Design.	George T. Ligler
1975	Program Schemas with Concurrency: Execution Time and Hangups.	Bruce P. Lester
1975	A Description of Path Expressions by Petri Nets.	Peter E. Lauer, Roy H. Campbell
1975	Node Listings Applied to Data Flow Analysis.	Ken Kennedy
1975	Even Simple Programs are Hard to Analyze.	Neil D. Jones, Steven S. Muchnick
1975	On the Complexity of the Circularity Test for Attribute Grammars.	Mehdi Jazayeri, William F. Ogden, William C. Rounds
1975	On the Complexity of LR(k) Testing.	Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
1975	An Algebra of Relations for Machine Computation.	Patrick A. V. Hall, Peter Hitchcock, Stephen Todd

1,551–1,575 of 1,604← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.