From

Institution

Field

Type

Topic: Logic, programming, and type systems ×

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

Reset

Papers matching “integer programming” in Logic, programming, and type systems 28

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Experiments and Details for "Scaling Automated Program Verification and Complexity Analysis: From Decidability for Single-Path Loops to Integer Programs and Beyond''
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

Nils Lommen

0

citations
Experiments and Details for "Scaling Automated Program Verification and Complexity Analysis: From Decidability for Single-Path Loops to Integer Programs and Beyond''
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

Nils Lommen

0

citations
Inferring Lower Runtime Bounds for Integer Programs
2020 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl

12

citations
Targeting Completeness: Automated Complexity Analysis of Integer Programs
2026 Journal of Automated Reasoning article Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

4

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

0

citations
Modular Automatic Complexity Analysis of Recursive Integer Programs
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Nils Lommen, Jürgen Giesl

1

citations
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

7

citations
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jürgen Giesl, Nils Lommen, Marcel Hark

0

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

7

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 other Computer Science Logic, programming, and type systems

Marcel Hark, Jürgen Giesl, Fabian Meyer

2

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer

10

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

1

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 RWTH Publications (RWTH Aachen) article Computer Science Logic, programming, and type systems Open access

Nils Michael Lommen, Éléanore Marie Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Fabian Meyer, Marcel Hark, Jürgen Giesl

20

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Marcel Hark, Jürgen Giesl

0

citations
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

6

citations
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

1

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

0

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

16

citations