| A temporal calculus of communicating systems F Moller, C Tofts CONCUR'90 Theories of Concurrency: Unification and Extension: Amsterdam, The …, 1990 | 626 | 1990 |
| The mobility workbench — A tool for the π-Calculus B Victor, F Moller Computer Aided Verification: 6th International Conference, CAV'94 Stanford …, 1994 | 414 | 1994 |
| An inverse of the evaluation functional for typed lambda-calculus U Berger, H Schwichtenberg IEEE Computer Society Press, Los Alamitos, 1991 | 321 | 1991 |
| Solving and verifying the boolean pythagorean triples problem via cube-and-conquer MJH Heule, O Kullmann, VW Marek Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 290 | 2016 |
| Universal algebra K Meinke, JV Tucker Handbook of logic in computer science 1, 189-411, 1992 | 288 | 1992 |
| Verification on infinite structures O Burkart, D Caucal, F Moller, B Steffen Handbook of Process algebra, 545-623, 2001 | 267 | 2001 |
| New methods for 3-SAT decision and worst-case analysis O Kullmann Theoretical Computer Science 223 (1-2), 1-72, 1999 | 248 | 1999 |
| Bisimulation equivalence is decidable for basic parallel processes S Christensen, Y Hirshfeld, F Moller CONCUR'93: 4th Intrenational Conference on Concurrency Theory Hildesheim …, 1993 | 223 | 1993 |
| Cube and conquer: Guiding CDCL SAT solvers by lookaheads MJH Heule, O Kullmann, S Wieringa, A Biere Hardware and Software: Verification and Testing: 7th International Haifa …, 2012 | 212 | 2012 |
| A polynomial algorithm for deciding bisimilarity of normed context-free processes Y Hirshfeld, M Jerrum, F Moller Theoretical Computer Science 158 (1-2), 143-159, 1996 | 196* | 1996 |
| A characterisation of computable data types by means of a finite equational specification method JA Bergstra, JV Tucker International Colloquium on Automata, Languages, and Programming, 76-90, 1980 | 187 | 1980 |
| Copatterns: Programming infinite structures by observations A Abel, B Pientka, D Thibodeau, A Setzer ACM SIGPLAN Notices 48 (1), 27-38, 2013 | 180 | 2013 |
| Algebraic specifications of computable and semi-computable data structures JA Bergstra, JV Tucker Theoretical Computer Science: the journal of the EATCS 50 (2), 137-181, 1987 | 179* | 1987 |
| On a generalization of extended resolution O Kullmann Discrete Applied Mathematics 96, 149-176, 1999 | 169 | 1999 |
| A maturity assessment approach for conceiving context-specific roadmaps in the Industry 4.0 era M Colli, U Berger, M Bockholt, O Madsen, C Møller, BV Wæhrens Annual Reviews in Control 48, 165-177, 2019 | 160 | 2019 |
| Contextualizing the outcome of a maturity assessment for Industry 4.0 M Colli, O Madsen, U Berger, C Møller, BV Wæhrens, M Bockholt Ifac-papersonline 51 (11), 1347-1352, 2018 | 154 | 2018 |
| Constructive volume geometry M Chen, JV Tucker Computer Graphics Forum 19 (4), 281-293, 2000 | 154 | 2000 |
| Infinite results F Moller CONCUR'96: Concurrency Theory: 7th International Conference Pisa, Italy …, 2005 | 152 | 2005 |
| A finite axiomatization of inductive-recursive definitions P Dybjer, A Setzer Typed Lambda Calculi and Applications: 4th International Conference, TLCA’99 …, 1999 | 148 | 1999 |
| Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference H Fleischner, O Kullmann, S Szeider Theoretical Computer Science 289 (1), 503-516, 2002 | 141 | 2002 |
