From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “computation tree logic” 7

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Computing Sufficient and Necessary Conditions in CTL: A Forgetting Approach
2022 Information Sciences article Computer Science Formal Methods in Verification Open access

Renyan Feng, Erman Acar, Yisong Wang, Wanwei Liu, Stefan Schlobach, Weiping Ding

3

citations
A Systematic Exploration of Evolutionary Computation for the Design of Hardware-oriented Non-cryptographic Hash Functions
2024 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Evolutionary Algorithms and Applications Open access

Mujtaba Hassan, Jo Vliegen, Stjepan Picek, Nele Mentens

2

citations
Parameter Synthesis for Probabilistic Hyperproperties
2020 EPiC series in computing conference-paper Computer Science Formal Methods in Verification Open access

Erika Ábrahám, Ezio Bartocci, Borzoo Bonakdarpour, Oyendrila Dobe

9

citations
Differentiable Programming: Efficient Smoothing of Control-Flow-Induced Discontinuities
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Sebastian Christodoulou, Uwe Naumann

2

citations
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory
2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Romain Péchoux

17

citations
Quantum Programming with Inductive Datatypes
2020 HAL (Le Centre pour la Communication Scientifique Directe) preprint Computer Science Logic, programming, and type systems Open access

Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev

3

citations
Efficient Lookahead Encoding and Abstracted Width for Learning General Policies in Classical Planning
2026 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Michael Aichmüller, Simon Ståhlberg, Martin Funkquist, Hector Geffner

0

citations

7 results