default search action
ACM Transactions on Computational Logic, Volume 25
Volume 25, Number 1, January 2024
- Rob van Glabbeek
:
Comparing the Expressiveness of the π-calculus and CCS. 1:1-1:58 - Rance Cleaveland
Extensible Proof Systems for Infinite-State Systems. 2:1-2:60 - Maximiliano Cristiá
A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals. 3:1-3:34 - Orna Kupferman, Gal Vardi:
Perspective Games. 4:1-4:26 - Domenico Cantone
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator. 5:1-5:30 - Giuseppe Greco
Algebraic Proof Theory for LE-logics. 6:1-6:37 - Michele Boreale
Products, Polynomials and Differential Equations in the Stream Calculus. 7:1-7:26 - Laura Bozzelli
On the Complexity of Model Checking Knowledge and Time. 8:1-8:42
Volume 25, Number 2, April 2024
- Yury Yarovikov
Spectrum of FO Logic with Quantifier Depth 4 is Finite. 9:1-9:24 - Orna Kupferman
The Complexity of LTL Rational Synthesis. 10:1-10:31 - Ivan Lanese
An Axiomatic Theory for Reversible Computation. 11:1-11:40 - Balder ten Cate
Characterising Modal Formulas with Examples. 12:1-12:27 - Alessandro Artale
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications. 13:1-13:43 - Véronique Bruyère
Stackelberg-Pareto Synthesis. 14:1-14:49
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-19 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: