| 2008 |
|---|
| 33 | EE | Thomas Strahm,
Jeffery I. Zucker:
Primitive recursive selection functions for existential assertions over abstract algebras.
J. Log. Algebr. Program. 76(2): 175-197 (2008) |
| 2007 |
|---|
| 32 | EE | Wei Jiang,
Yuan Wang,
Jeffery I. Zucker:
Universality and semicomputability for nondeterministic programming languages over abstract algebras.
J. Log. Algebr. Program. 71(1): 44-78 (2007) |
| 31 | EE | John V. Tucker,
Jeffery I. Zucker:
Computability of analog networks.
Theor. Comput. Sci. 371(1-2): 115-146 (2007) |
| 2006 |
|---|
| 30 | EE | Jeffery I. Zucker:
Primitive Recursive Selection Functions over Abstract Algebras.
CiE 2006: 595-606 |
| 2005 |
|---|
| 29 | EE | J. V. Tucker,
Jeffery I. Zucker:
A Network Model of Analogue Computation over Metric Algebras.
CiE 2005: 515-529 |
| 28 | EE | Jian Xu,
Jeffery I. Zucker:
First and Second Order Recursion on Abstract Data Types.
Fundam. Inform. 67(4): 377-419 (2005) |
| 27 | EE | J. V. Tucker,
Jeffery I. Zucker:
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems.
J. Log. Algebr. Program. 62(1): 71-108 (2005) |
| 2004 |
|---|
| 26 | EE | J. V. Tucker,
Jeffery I. Zucker:
Abstract versus concrete computation on metric partial algebras.
ACM Trans. Comput. Log. 5(4): 611-668 (2004) |
| 2002 |
|---|
| 25 | EE | J. V. Tucker,
Jeffery I. Zucker:
Abstract computability and algebraic specification.
ACM Trans. Comput. Log. 3(2): 279-333 (2002) |
| 2001 |
|---|
| 24 | EE | J. V. Tucker,
Jeffery I. Zucker:
Abstract versus Concrete Computation on Metric Partial Algebras
CoRR cs.LO/0108007: (2001) |
| 23 | EE | J. V. Tucker,
Jeffery I. Zucker:
Abstract Computability, Algebraic Specification and Initiality
CoRR cs.LO/0109001: (2001) |
| 1999 |
|---|
| 22 | EE | J. V. Tucker,
Jeffery I. Zucker:
Computation by `While' Programs on Topological Partial Algebras.
Theor. Comput. Sci. 219(1-2): 379-420 (1999) |
| 1996 |
|---|
| 21 | | Jeffery I. Zucker:
Transformations of Normal and Inverted Function Tables.
Formal Asp. Comput. 8(6): 679-705 (1996) |
| 1993 |
|---|
| 20 | | Jeffery I. Zucker:
Propositional Temporal Logics and Their Use in Model Checking.
Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 108-116 |
| 19 | | Jeffery I. Zucker:
The Propositional mu-Calculus and Its Use in Model Checking.
Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 117-128 |
| 1992 |
|---|
| 18 | | J. V. Tucker,
Jeffery I. Zucker:
Theory of Computation over Stream Algebras, and its Applications.
MFCS 1992: 62-80 |
| 17 | | Jan J. M. M. Rutten,
Jeffery I. Zucker:
A semantic approach to fairness.
Fundam. Inform. 16(1): 1-38 (1992) |
| 16 | | J. V. Tucker,
Jeffery I. Zucker:
Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types.
J. Log. Program. 13(1): 23-55 (1992) |
| 1991 |
|---|
| 15 | | J. V. Tucker,
Jeffery I. Zucker:
Examples of Semicomputable Sets of Real and Complex Numbers.
Constructivity in Computer Science 1991: 179-198 |
| 14 | | Hing-Kai Hung,
Jeffery I. Zucker:
Semantics of Pointers, Referencing and Dereferencing with Intensional Logic
LICS 1991: 127-136 |
| 13 | | J. V. Tucker,
Jeffery I. Zucker:
Projections of Semicomputable Relations on Abstract Data Tzpes.
Int. J. Found. Comput. Sci. 2(3): 267-296 (1991) |
| 1990 |
|---|
| 12 | | J. V. Tucker,
S. S. Wainer,
Jeffery I. Zucker:
Provable Computable Functions on Abstract Data Types.
ICALP 1990: 660-673 |
| 11 | | J. V. Tucker,
Jeffery I. Zucker:
Toward a General Theory of Computation and Specification over Abstract Data Types.
ICCI 1990: 129-133 |
| 1989 |
|---|
| 10 | | J. V. Tucker,
Jeffery I. Zucker:
Horn Programs and Semicomputable Relations on Abstract Structures.
ICALP 1989: 745-760 |
| 1988 |
|---|
| 9 | | J. W. de Bakker,
John-Jules Ch. Meyer,
Ernst-Rüdiger Olderog,
Jeffery I. Zucker:
Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency.
J. Comput. Syst. Sci. 36(2): 158-224 (1988) |
| 1986 |
|---|
| 8 | | J. W. de Bakker,
Joost N. Kok,
John-Jules Ch. Meyer,
Ernst-Rüdiger Olderog,
Jeffery I. Zucker:
Contrasting Themes in the Semantics of Imperative Concurrency.
Current Trends in Concurrency 1986: 51-122 |
| 1985 |
|---|
| 7 | | J. W. de Bakker,
John-Jules Ch. Meyer,
Ernst-Rüdiger Olderog,
Jeffery I. Zucker:
Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency
STOC 1985: 252-262 |
| 1984 |
|---|
| 6 | | J. W. de Bakker,
John-Jules Ch. Meyer,
Jeffery I. Zucker:
On Infinite Computations in Denotational Semantics.
Theor. Comput. Sci. 29: 229-230 (1984) |
| 1983 |
|---|
| 5 | | J. W. de Bakker,
Jeffery I. Zucker:
Processes and a Fair Semantics for the Ada Rendez-Vous.
ICALP 1983: 52-66 |
| 4 | | J. W. de Bakker,
Jeffery I. Zucker:
Compactness in Semantics for Merge and Fair Merge.
Logic of Programs 1983: 18-33 |
| 3 | | J. W. de Bakker,
John-Jules Ch. Meyer,
Jeffery I. Zucker:
On Infinite Computations in Denotational Semantics.
Theor. Comput. Sci. 26: 53-82 (1983) |
| 1982 |
|---|
| 2 | | J. W. de Bakker,
Jeffery I. Zucker:
Denotational Semantics of Concurrency
STOC 1982: 153-158 |
| 1 | | J. W. de Bakker,
Jeffery I. Zucker:
Processes and the Denotational Semantics of Concurrency
Information and Control 54(1/2): 70-120 (1982) |
