J. Appl. non Class. Logics 2009
Top Research Directions
The 3 research directions with J. Appl. non Class. Logics 2009 papers, ranked by paper count, next to 2007. Share is the fraction of the edition’s papers in the direction.
| # | Direction | 2009 | 2007 | Share 2009 | Share 2007 | 2007 rank |
|---|---|---|---|---|---|---|
| 1 | Computational Soundness for Symbolic Security Proofs | 1 | 0 | 100.0% | 0.0% | — |
| 2 | Information Restricted Scheduling for Concurrent Systems | 1 | 0 | 100.0% | 0.0% | — |
| 3 | Reducing Manual Proof Overhead in Theorem Proving | 1 | 0 | 100.0% | 0.0% | — |
Download all directions as CSV
About this data
Papers. J. Appl. non Class. Logics 2009 lists 1 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.
Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2007 use shares, since the edition went from 1 to 1 papers.
Data. Counts come from Lacuna’s data build of 2026-11-20 and change as papers are added. Tables as CSV: directions. Cite as: Lacuna, “J. Appl. non Class. Logics 2009”, https://lacuna.tiptreesystems.com/venue/j-appl-non-class-logics-q6wr/2009.
Top Authors
| Author | Papers |
|---|---|
| Catuscia Palamidessi | 1 |
Impactful Papers
Papers from J. Appl. non Class. Logics 2009 that shaped research clusters.
Foundational
Papers
| Title |
|---|
| A quantitative doxastic logic for probabilistic processes and applications to information-hiding |