No article text was recorded for this version.
decidability-expressivity tradeoff
Version 1 of 139 papers53 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Program Equivalence (Dagstuhl Seminar 18151)
- Blog: Verifying higher-order concurrency with data automata
- Blog: On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
- Blog: Leafy automata for higher-order concurrency
- Blog: Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
- Blog: Decidable Models of Integer-Manipulating Programs with Recursive Parallelism
- Blog: SemRegex: A Semantics-Based Approach for Generating Regular Expressions from Natural Language Specifications
- Blog: A Perfect Model for Bounded Verification
- Blog: SemRep : Generative Code Representation Learning with Code Transformations
- Blog: The inclusion structure of partially lossy queue monoids and their trace submonoids
- Blog: Kernel Equivalence of Programs and Proving Kernel Equivalence and Correctness by Test Cases
- Blog: Misleading Authorship Attribution of Source Code using Adversarial Learning
- Blog: Querying Schemas With Access Restrictions
- Blog: On Repetitive Finite Automata with Translucent Words
- Blog: Parikh one-counter automata
- Blog: Fragments of ML Decidable by Nested Data Class Memory Automata
- Blog: Measuring code behavioral similarity for programming and software engineering education
- Blog: Fast and Precise Sanitizer Analysis with BEK
- Blog: Bounds on Mobility
- Blog: Probabilistic Weighted Automata
- Blog: Analysis of Asynchronous Programs with Event-Based Synchronization
- Blog: An overview on smart contracts: Challenges, advances and platforms
- Blog: Complete trace models of state and control
- Blog: The Counting Power of Transformers
- Blog: CodeARC: Benchmarking Reasoning Capabilities of LLM Agents for Inductive Program Synthesis
- Blog: EquiBench: Benchmarking Large Language Models’ Understanding of Program Semantics via Equivalence Checking
- Blog: AdvSQLi: Generating Adversarial SQL Injections against Real-world WAF-as-a-service
- Blog: A Classification of Symbolic Transition Systems
- Blog: Sharing Computations for User-Defined Aggregate Functions
- Blog: Kernel
- Blog: Block Structure vs. Scope Extrusion: Between Innocence and Omniscience
- Blog: A Temporal Concurrent Constraint Programming Calculus
- Blog: Regular Methods for Operator Precedence Languages
- Blog: A Theory of Name Boundedness
- Blog: Global value numbering using random interpretation
- Blog: Nested Weighted Automata
- Blog: On Hierarchical Communication Topologies in the pi-calculus
- Blog: Decidable Verification of Golog Programs over Non-Local Effect Actions
- Blog: On the expressive power of temporal concurrent constraint programming languages
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_decidability_expressivity_tradeoff_927ca270,
title = {decidability-expressivity tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/decidability-expressivity-tradeoff/rdr_927ca270d66740c5bc0ef93ce8a4a05b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_decidability_expressivity_tradeoff_927ca270_v1,
title = {decidability-expressivity tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/decidability-expressivity-tradeoff/rdr_927ca270d66740c5bc0ef93ce8a4a05b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}