← Foundations
Computer Science › Foundations ›

Formal Languages

110 directly classified papers

Papers per year

Papers

Anvil: Verifying Liveness of Cluster Management Controllers OSDI 2024
Solving Quantified Boolean Formulas with Few Existential Variables IJCAI 2024
Correct and Optimal: The Regular Expression Inference Challenge IJCAI 2024
Automata Cascades: Expressivity and Sample Complexity AAAI 2023
Working Towards Digital Documentation of Uralic Languages With Open-Source Tools and Modern NLP Methods EMNLP 2023
Co-Certificate Learning with SAT Modulo Symmetries IJCAI 2023
Moral Planning Agents with LTL Values IJCAI 2023
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI 2023
Lifting (D)QBF Preprocessing and Solving Techniques to (D)SSAT AAAI 2023
Convergence and Diversity in the Control Hierarchy ACL 2023
Characterizing the Program Expressive Power of Existential Rule Languages AAAI 2022
DuoAI: Fast, Automated Inference of Inductive Invariants for Verifying Distributed Protocols OSDI 2022
Simulating Feature Structures with Simple Types NAACL 2022
Logical Transductions for the Typology of Ditransitive Prosody NAACL 2022
Verifying Hardware Security Modules with Information-Preserving Refinement OSDI 2022
Splitting EUD Graphs into Trees: A Quick and Clatty Approach IJCNLP 2021
Toward Determining NFA Equivalence via QBFs (Student Abstract) AAAI 2021
Finding Invariants of Distributed Systems: It's a Small (Enough) World After All NSDI 2021
An FST morphological analyzer for the Gitksan language IJCNLP 2021
Recognizing Reduplicated Forms: Finite-State Buffered Machines ACL 2021
On the Relation Between Approximation Fixpoint Theory and Justification Theory IJCAI 2021
Program Synthesis as Dependency Quantified Formula Modulo Theory IJCAI 2021
Parameterized Logical Theories AAAI 2021
HyperLDLf: a Logic for Checking Properties of Finite Traces Process Logs IJCAI 2021
SMT-based Safety Checking of Parameterized Multi-Agent Systems AAAI 2021