From

Institution

Field

Type

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

Reset

Papers matching “pair programming” 19

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

CLAPP: The CLASS LLM Agent for Pair Programming
2025 arXiv (Cornell University) preprint Computer Science Software Engineering Research Open access

Santiago Casas, Christian Fidler, Boris Bolliet, Francisco Villaescusa-Navarro, Julien Lesgourgues

4

citations
The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting
2026 Science of Computer Programming article Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing

3

citations
Who Does What? Work Division and Allocation Strategies of Computer Science Student Teams
2021 IEEE/ACM International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET) conference-paper Computer Science Teaching and Learning Programming Open access

Anna van der Meulen, Efthimia Aivaloglou

0

citations
Python Slow-Cooked
2026 book Computer Science Teaching and Learning Programming Open access

Matthijs Westera

0

citations
On approximate quantum error correction for symmetric noise
2025 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Gereon Koßmann, Julius A. Zeiss, Omar Fawzi, Mario Berta

4

citations
Precedence‐Constrained Shortest Path
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Dennis John, Corinna Mathwieser

0

citations
Satisficing and Optimal Generalised Planning via Goal Regression
2026 Underline Science Inc. other Computer Science AI-based Problem Solving and Planning Open access

Association for Artificial Intelligence 2026, Dillon Z. Chen, Till Hofmann, Toryn Q. Klassen, Sheila A. McIlraith

0

citations
A pre-expectation calculus for probabilistic sensitivity
2021 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

24

citations
Developing a Quantum Crypto Theorem Prover from Scratch (Invited Talk)
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, programming, and type systems Open access

Dominique Unruh

0

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

7

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
A Rewriting Framework for Interacting Cyber-Physical Agents
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Benjamin Lion, Farhad Arbab, Carolyn Talcott

0

citations

19 results