Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Symposium on Principles of Programming Languages

Known as: POPL, ACM Symposium on Principles of Programming Languages, Annual ACM Symposium on Principles of Programming Languages 
The annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) is an academic conference in the field of computer science… Expand
Wikipedia

Related topics

Related topics

10 relations
ACM SIGACTAbstract interpretationComputer scienceFunction composition (computer science)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Lazy Annotation for Program Testing and Verification
We describe an interpolant-based approach to test generation and model checking for sequential programs The method generates… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
System F with type equality coercions
We introduce System FC, which extends System F with support for non-syntactic type equality. There are two main extensions: (i… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract interpretation of reactive systems
The advent of ever more complex reactive systems in increasingly critical areas calls for the development of automated verication… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Model checking, abstraction, and compositional verification
Because of the difficulty of adequately simulating large digital designs, there has been a recent surge of interest in formal… Expand
  • figure 2.7
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A Calculus of Mobile Processes, I
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages
The Program Dependence Web (PDW) is a program representation that can be directly interpreted using control-, data-, or demand… Expand
  • figure 3
  • figure 1
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Incremental computation via function caching
 
  • figure 2.1
  • figure 25
  • figure 2.6
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Polymorphic effect systems
We present a new approach to programming languages for parallel computers that uses an effect system to discover expression… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Decision Procedures and Expressiveness in the Temporal Logic of Branching Time
We consider the computation tree logic (CTL) proposed in (Sci. Comput. Programming 2 (1982), 241–260) which extends the unified… Expand
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
1983
1983
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The papers in this volume were presented at the Tenth Annual ACM Symposium on the Principals of Programming Languages, sponsored… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE