Latest Research in Programming Languages

Top Research Topics in Programming Languages

• Logic in Computer Science — 12 papers
• Programming Languages — 4 papers
• Data Structures and Algorithms — 4 papers
• Logic, programming, and type systems — 4 papers
• Cryptography and Security — 4 papers
• Software Engineering — 3 papers
• Distributed systems and fault tolerance — 3 papers
• Logic, Reasoning, and Knowledge — 3 papers
• Artificial Intelligence — 2 papers
• Formal Languages and Automata Theory — 2 papers

Highest-Cited Papers

1. The Past, Present, and Future of Formal Methods in Brazil (1 citations)
2. PAA: The Probabilistic Allen Algebra: A Generative and Complete Probabilistic Extension of Allen's Interval Relations
3. STLSat---An Improved Tableau for Satisfiability Checking of Signal Temporal Logic Formulas
4. MightyPPL : Towards model checking MTL
5. A Rig of Transformations
6. Stuffed IBLTs: Optimal Linear Multiset Sketches
7. Mechanizing Gödel's Incompleteness Theorems and Provability Logic
8. Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor
9. Predictive Varanus: Combining CSP Conformance Monitoring with Predictive LTL Runtime Verification
10. Quiescence in Concert: Composing Multi-Channel Time-Outs for IOCO
11. Symbolic Model Checking using Intervals of Vectors
12. Revisiting Soundness for Occurrence Typing, Semantically
13. Quadratic Probing Insertions Are $ε^{-(1+o(1))}$ Time
14. Reflection as a Resource: Stratified Representability, Fixed Points Under Restricted Internalization, and a Selector-Strength Hierarchy Paper 28 of the NEMS Suite
15. Direct Self-Semantic Fixed Points: Intrinsic Diagonal Claims Against Final Internal Self-Theories Paper 52 of the NEMS Suite
16. Reflection as a Resource: Stratified Representability, Fixed Points Under Restricted Internalization, and a Selector-Strength Hierarchy Paper 28 of the NEMS Suite
17. The Case for Automated Hyperspecialization: Evidence from SAT
18. Fast and Theoretically-Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps
19. On Reconfigurable Bisimulation, with an Application to the Distributed Synthesis Problem
20. Linear Probing with Non-Greedy Insertions