This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.

Theoretical Computer Science

A conference, workshop or journal: the thing that recurs, across all its years.

Elsevier's broad theory journal, split into sections covering algorithms and complexity, logic and semantics, and formal languages. Large, long-running, and where a conference paper in theory is often expanded into its definitive form.

https://www.sciencedirect.com/journal/theoretical-computer-science

31 references

History-based reasoning about behavioral subtyping (extended paper)
Jinting Bian and others (2026) · Theoretical Computer Science · Elsevier BV
Completeness for recursive procedures in separation logic
Mahmudul Faisal Al Ameen and others (2016) · Theoretical Computer Science · Elsevier
On the performance of a retransmission-based synchronizer
Thomas Nowak and others (2013) · Theoretical Computer Science · Elsevier BV
Contract-based discovery of Web services modulo simple orchestrators
Luca Padovani (2010) · Theoretical Computer Science · Elsevier BV
A semantics for concurrent separation logic
Stephen Brookes (2007) · Theoretical Computer Science · Elsevier
The rewriting logic semantics project
José Meseguer and others (2007) · Theoretical Computer Science · Elsevier BV
Resources, concurrency, and local reasoning
Peter W. O'Hearn (2007) · Theoretical Computer Science · Elsevier
Model checking restricted sets of timed paths
Nicolas Markey and others (2006) · Theoretical Computer Science · Elsevier BV
Possible worlds and resources: the semantics of BI
David J. Pym and others (2004) · Theoretical Computer Science · Elsevier BV
Axioms for real-time logics
Pierre‐Yves Schobbens and others (2002) · Theoretical Computer Science · Elsevier BV
Logical analysis of demonic nondeterministic programs
Stéphane Demri and others (1996) · Theoretical Computer Science · Elsevier BV
Universal computation and other capabilities of hybrid and continuous dynamical systems
Michael S. Branicky (1995) · Theoretical Computer Science · Elsevier BV
Finite-memory automata
Michael Kaminski and others (1994) · Theoretical Computer Science · Elsevier BV
Combining angels, demons and miracles in program specifications
R.J.R. Back and others (1992) · Theoretical Computer Science · Elsevier
The existence of refinement mappings
Martı́n Abadi and others (1991) · Theoretical Computer Science · Elsevier BV
A syntactic theory of sequential state
Matthias Felleisen and others (1989) · Theoretical Computer Science · Elsevier BV
The linear abstract machine
Yves Lafont (1988) · Theoretical Computer Science · Elsevier BV
Linear logic
Jean-Yves Girard (1987) · Theoretical Computer Science · Elsevier BV
Some questions about expressiveness and relative completeness in Hoare's logic
Mario Rodriguez Artalejo (1985) · Theoretical Computer Science
Hierarchical Verification of Asynchronous Circuits Using Temporal Logic
Bud Mishra and others (1985) · Theoretical Computer Science · North-Holland
Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism
Krzysztof R. Apt (1984) · Theoretical Computer Science
Testing equivalences for processes
R. De Nicola and others (1984) · Theoretical Computer Science · Elsevier BV
Calculi for synchrony and asynchrony
Robin Milner (1983) · Theoretical Computer Science · Elsevier BV
On the Notion of Expressiveness and the Rule of Adaption
Ernst-Rüdiger Olderog (1983) · Theoretical Computer Science
Floyd's principle, correctness theories and program equivalence
J.A. Bergstra and others (1982) · Theoretical Computer Science · Elsevier BV
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
Jan A. Bergstra and others (1982) · Theoretical Computer Science
Petri nets, event structures and domains, part I
Mogens Nielsen and others (1981) · Theoretical Computer Science · Elsevier BV
The temporal semantics of concurrent programs
Amir Pnueli (1981) · Theoretical Computer Science · Elsevier BV
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
David Harel (1980) · Theoretical Computer Science · Elsevier BV
Recursive assertions are not enough - or are they?
Krzysztof R. Apt and others (1979) · Theoretical Computer Science · Elsevier BV
Call-by-name, call-by-value and the λ-calculus
Gordon D. Plotkin (1975) · Theoretical Computer Science · Elsevier BV