default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 300
Volume 300, Number 1-3, 7 May 2003
- Peter Aczel, Jirí Adámek, Stefan Milius, Jirí Velebil:
Infinite trees and completely iterative theories: a coalgebraic view. 1-45 - Gian Luca Cattani, Glynn Winskel:
Presheaf models for CCS-like languages. 47-89 - Stacy E. Finkelstein, Peter J. Freyd, James Lipton:
A new framework for declarative programming. 91-160 - Otmane Aït Mohamed, Xiaoyu Song, Eduard Cerny:
On the non-termination of M-based abstract state enumeration. 161-179 - Axel Wabenhorst:
Induction in the Timed Interval Calculus. 181-207 - Sándor Vágvölgyi:
Intersection of finitely generated congruences over term algebra. 209-234 - Stéphane Demri:
A polynomial space construction of tree-like models for logics with local chains of modal connectives. 235-258 - Raymond Devillers, Hanna Klaudel, Robert-C. Riemann:
General parameterised refinement and recursion for the M-net calculus. 259-300 - Abdelwaheb Ayari, David A. Basin, Felix Klaedtke:
Decision procedures for inductive Boolean functions based on alternating automata. 301-329 - Alexander Moshe Rabinovich
:
Automata over continuous time. 331-363 - Lorenzo Carlucci:
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem. 365-378 - Andrew D. Gordon, Alan Jeffrey:
Typing correspondence assertions for communication protocols. 379-409 - Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen:
The power of reachability testing for timed automata. 411-475 - René David:
Decidability results for primitive recursive algorithms. 477-504
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 2025-12-04 01:27 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:
