P-time Completeness of Light Linear Logic and its Nondeterministic Extension

Pairing Functions, Boolean Evaluation and Binary Decision Diagrams in Prolog

Paraconsistency and Topological Semantics

Paraconsistency of Interactive Computation

Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems

Parallel symbolic state-space exploration is difficult, but what is the alternative?

Parameterized complexity results for 1-safe Petri nets

Parameterized Modal Satisfiability

Parameterized Proof Complexity and W[1]

Parameterized Resolution with bounded conjunction

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

Parametric Verification of a Group Membership Algorithm

Parikh Images of Regular Languages: Complexity and Applications

Pattern Unification for the Lambda Calculus with Linear and Affine Types

Pebble Games and Linear Equations

PELCR: Parallel Environment for Optimal Lambda-Calculus Reduction

Permission-Based Separation Logic for Message-Passing Concurrency

Perturbed affine arithmetic for invariant computation in numerical program analysis

Phase Selection Heuristics for Satisfiability Solvers

PKind: A parallel k-induction based model checker