New Logic in Computer Science papers from arxiv.org: finite model theory, logics of programs. Thank you to arXiv for use of its open access interoperability.
Joined December 2009
- Tweets 354
- Following 2
- Followers 366
- Likes 0
219 Photos and videos
UMB: A Unified Markov Binary Format for Probabilistic Model Checking (extended version)
Roman Andriushchenko, Arnd Hartmanns, Joshua Jeppson, Sebastian Junges, Tobias Meggendorfer, David Parker, Tim Quatmann, Maximilian Weininger
arxiv.org/abs/2606.17811 [ππ.π»πΎ]
2
Verifying LTL for Infinite State Systems via Termination Analysis
Nils Lommen, Moritz Leven Rosarius, JΓΌrgen Giesl
arxiv.org/abs/2606.17693 [ππ.π»πΎ]
2
Verifying the Rust Standard Library
Byron Cook, Remi Delmas, Zyad Hassan, Bart Jacobs, Ranjit Jhala, Rahul Kumar, Felipe R. Monteiro, Thanh Nguyen, Rebecca Rumbul, Michael Tautschnig, Celina Val, Carolyn Zech
arxiv.org/abs/2606.17374 [ππ.π»πΎ ππ.πΏπ» ππ.ππ΄]
6
Syntactic Systems Cannot See Semantic Invariants
Fabio F. G. Buono
arxiv.org/abs/2606.17275 [ππ.π»πΎ ππ.π²π]
A Stone-Cech Collecting Semantics for Residual Process Behaviour
Mike Stannett
arxiv.org/abs/2606.17228 [ππ.π»πΎ ππ.πΏπ»]
Constructive Preference Relations: Navigating Undecidability in Rational LTL Contraction
Hannes GaiΓer, Dominik Klumpp, Jandson S. Ribeiro
arxiv.org/abs/2606.16957 [ππ.π»πΎ]
π¬Accepted at 24th International Workshop on Nonmonotonic Reasoning (NMR'26)
7
An Efficient MaxSAT-DDD Approach for Train Rescheduling via Precedence Propagation and Hybrid AMO Encodings
Tuyen Van Kieu, Tan Huu Nguyen, Khanh Van To
arxiv.org/abs/2606.16814 [ππ.π»πΎ]
2
The Complexity of Bisimilarity and Model Checking in Finitary Diagrams
Markus BlΓ€ser, Sagnik Dutta, Samuel Okyay
arxiv.org/abs/2606.16744 [ππ.π»πΎ]
Witnesses and Counterexamples for Timed Bisimulation
Alexander Lieb, Malte Lochau
arxiv.org/abs/2606.16736 [ππ.π»πΎ ππ.π΅π»]
2
Revisiting average case complexity of multilevel syllogistic: From the 1995 Courant Technical Report to Lean 4 Formalization
Lars Warren Ericson
arxiv.org/abs/2606.16134 [ππ.π»πΎ ππ.π²π²]
1
14
Interpolation and Query Rewriting
Michael Benedikt
arxiv.org/abs/2606.15737 [ππ.π»πΎ]
The algebra of Krom logic programs
Christian AntiΔ
arxiv.org/abs/2606.15719 [ππ.π»πΎ ππ.π°πΈ ππππ.π»πΎ]
2
A Lean 4 Formalization of Euclidean Domain Algorithms from a 1986 Icon Experimentation Package
Lars Warren Ericson
arxiv.org/abs/2606.15520 [ππ.π»πΎ ππ.ππ²]
2
GPU-Accelerated Search and Certification of Bounded Indistinguishability in Finite Kripke Semantics
Faruk Alpay, Baris Basaran
arxiv.org/abs/2606.15437 [ππ.π»πΎ ππ.πΆπ]
1
4
Provenance-Enhanced Statements in Knowledge Graphs
Fabio Vitali, Valentina Pasqual
arxiv.org/abs/2606.15246 [ππ.π»πΎ ππ.π°πΈ ππ.π³π»]
4
Obligation-Producing Actions
Kalonji Kalala, Iluju Kiringa, Tet Yeap
arxiv.org/abs/2606.14810 [ππ.π»πΎ ππ.πΌπ°]
3
Syntax and semantics of focalisation with relative monads and comonads
ΓlΓ©onore Mangel, Paul-AndrΓ© MelliΓ¨s, Guillaume Munch-Maccagnoni
arxiv.org/abs/2606.14652 [ππ.π»πΎ ππ.πΏπ»]
5
Algebraic Circuits Over Sum and Shift and Existential Presburger Arithmetic with Divisibility
Ignacio Barros, MichaΓ«l Cadilhac, Guillermo A. PΓ©rez
arxiv.org/abs/2606.14167 [ππ.π»πΎ ππ.π²π²]
4
From Phase Semantics to Base-extension Semantics (and back)
Ekaterina Piotrovskaya
arxiv.org/abs/2606.13855 [ππ.π»πΎ ππππ.π»πΎ]
1
8
Testing Theory of Truly Concurrent Processes
Yong Wang
arxiv.org/abs/2606.12944 [ππ.π»πΎ]
1
13