Follow
Theory Group Swansea
Title
Cited by
Cited by
Year
A temporal calculus of communicating systems
F Moller, C Tofts
International Conference on Concurrency Theory, 401-415, 1990
6041990
The mobility workbench — A tool for the π-Calculus
B Victor, F Moller
International Conference on Computer Aided Verification, 428-440, 1994
3951994
An inverse of the evaluation functional for typed lambda-calculus
U Berger, H Schwichtenberg
IEEE Computer Society Press, Los Alamitos, 1991
2931991
Universal algebra
K Meinke, JV Tucker
Handbook of logic in computer science 1, 189-411, 1992
2731992
Verification on infinite structures
O Burkart, D Caucal, F Moller, B Steffen
Handbook of Process algebra, 545-623, 2001
2672001
New methods for 3-SAT decision and worst-case analysis
O Kullmann
Theoretical Computer Science 223 (1-2), 1-72, 1999
2401999
Bisimulation equivalence is decidable for basic parallel processes
S Christensen, Y Hirshfeld, F Moller
International Conference on Concurrency Theory, 143-157, 1993
2151993
Solving and verifying the boolean pythagorean triples problem via cube-and-conquer
MJH Heule, O Kullmann, VW Marek
International Conference on Theory and Applications of Satisfiability …, 2016
2142016
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
1801996
Algebraic specifications of computable and semicomputable data types
JA Bergstra, JV Tucker
Theoretical Computer Science 50 (2), 137-181, 1987
179*1987
Cube and conquer: Guiding CDCL SAT solvers by lookaheads
MJH Heule, O Kullmann, S Wieringa, A Biere
Haifa Verification Conference, 50-65, 2011
1682011
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
1681980
Constructive volume geometry
M Chen, JV Tucker
Computer Graphics Forum 19 (4), 281-293, 2000
1572000
Infinite results
F Moller
International Conference on Concurrency Theory, 195-216, 1996
1541996
Copatterns: Programming infinite structures by observations
A Abel, B Pientka, D Thibodeau, A Setzer
ACM SIGPLAN Notices 48 (1), 27-38, 2013
1532013
On a generalization of extended resolution
O Kullmann
Discrete Applied Mathematics 96, 149-176, 1999
1481999
Program extraction from normalization proofs
U Berger
International Conference on Typed Lambda Calculi and Applications, 91-106, 1993
1421993
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
1382002
Refined program extraction from classical proofs
U Berger, W Buchholz, H Schwichtenberg
Annals of Pure and Applied Logic 114 (1-3), 3-25, 2002
1342002
A finite axiomatization of inductive-recursive definitions
P Dybjer, A Setzer
International Conference on Typed Lambda Calculi and Applications, 129-146, 1999
1341999
The system can't perform the operation now. Try again later.
Articles 1–20