Search Results - "Theory of computation Logic Proof theory"

A Logic for Locally Complete Abstract Interpretations by Bruni, Roberto, Giacobazzi, Roberto, Gori, Roberta, Ranzato, Francesco

“…We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program…”
Get full text

PolyCleaner: Clean your Polynomials before Backward Rewriting to verify Million-gate Multipliers by Mahzoon, Alireza, Grosse, Daniel, Drechsler, Rolf

“…Nowadays, a variety of multipliers are used in different computationally intensive industrial applications. Most of these multipliers are highly parallelized…”
Get full text

Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation by Komorida, Yuichi, Katsumata, Shin-ya, Kupke, Clemens, Rot, Jurriaan, Hasuo, Ichiro

“…A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be…”
Get full text

Leveraging Critical Proof Obligations for Efficient IC3 Verification by Zhu, Lingfeng, Zhang, Xindi, Li, Yongjian, Cai, Shaowei

“…IC3 and its variants are SAT-based model-checking methods that play a critical role in hardware verification. Efficient management of proof obligations, which…”
Get full text

Chaff: engineering an efficient SAT solver by Moskewicz, Matthew W., Madigan, Conor F., Zhao, Ying, Zhang, Lintao, Malik, Sharad

“…Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide…”
Get full text

CoqPilot, a plugin for LLM-based generation of proofs by Kozyrev, Andrei, Solovev, Gleb, Khramov, Nikita, Podkopaev, Anton

“…We present CoqPilot, a VS Code extension designed to help automate writing of Coq proofs. The plugin collects the parts of proofs marked with the admit tactic…”
Get full text

Some constructive variants of S4 with the finite model property by Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“…The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a…”
Get full text

Finite Model Theory of the Triguarded Fragment and Related Logics by Kieronski, Emanuel, Rudolph, Sebastian

“…The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments…”
Get full text

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic by Zhou, Li, Barthe, Gilles, Hsu, Justin, Ying, Mingsheng, Yu, Nengkun

“…We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states. In our model, the separating…”
Get full text

Logics of Dynamical Systems by Platzer, A.

“…We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models…”
Get full text

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP by Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“…This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify,…”
Get full text

A Theorem Proving Approach to Programming Language Semantics by Roy, Subhajit

“…The semantics of programming languages is one of the core topics in computer science. This topic is formalism-heavy and requires the student to attempt…”
Get full text

Categorical models of Linear Logic with fixed points of formulas by Ehrhard, Thomas, Jafarrahmani, Farzad

“…We develop a categorical semantics of µLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional…”
Get full text

Conflict nets: Efficient locally canonical MALL proof nets by Hughes, Dominic, Heijltjes, Willem

“…Proof nets for MLL (unit-free multiplicative linear logic) and ALL (unit-free additive linear logic) are graphical abstractions of proofs which are efficient…”
Get full text

Combinatorial Proofs and Decomposition Theorems for First-order Logic by Hughes, Dominic J. D., Strasburger, Lutz, Wu, Jui-Hsuan

“…We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in…”
Get full text

On the logical structure of choice and bar induction principles by Brede, Nuria, Herbelin, Hugo

“…We develop an approach to choice principles and their contrapositive bar-induction principles as extensionality schemes connecting an "intensional" or…”
Get full text

A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis by Shah, Preey, Bansal, Aman, Akshay, S., Chakraborty, Supratik

“…Boolean Skolem function synthesis concerns syn¬thesizing outputs as Boolean functions of inputs such that a relational specification between inputs and outputs…”
Get full text

Identifying Mutation Subsumption Relations by Souza, Beatriz

“…One recent promising direction in reducing costs of mutation analysis is to identify redundant mutations. We propose a technique to discover redundant…”
Get full text

First-Order Reasoning and Efficient Semi-Algebraic Proofs by Part, Fedor, Thapen, Neil, Tzameret, Iddo

“…Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms [3]:…”
Get full text

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem by Zhuk, Dmitriy

“…The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to…”
Get full text