Jeffery I. Zucker - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2021

Tracking computability of GPAC-generable functionsDiogo Poças, Jeffery I. Zucker. logcom, 31(1):326-346, 2021. [doi]

2020

Tracking Computability of GPAC-Generable FunctionsDiogo Poças, Jeffery I. Zucker. lfcs 2020: 214-235 [doi]

2019

Notions of semicomputability in topological algebras over the realsMark Armstrong, Jeffery I. Zucker. computability, 8(1):1-26, 2019. [doi]

Approximability in the GPACDiogo Poças, Jeffery I. Zucker. lmcs, 15(3), 2019. [doi]

2018

Analog networks on function data streamsDiogo Poças, Jeffery I. Zucker. computability, 7(4):301-322, 2018. [doi]

2015

Models of computation for partial functions on the realsMing Quan Fu, Jeffery I. Zucker. jlp, 84(2):218-237, 2015. [doi]

Characterizations of semicomputable sets of real numbersBo Xie, Ming Quan Fu, Jeffery I. Zucker. jlp, 84(1):124-154, 2015. [doi]

2014

Computability of Operators on Continuous and Discrete Time StreamsJ. V. Tucker, Jeffery I. Zucker. computability, 3(1):9-44, 2014. [doi]

2013

Assignment Calculus: A Pure Imperative LanguageMarc Bender, Jeffery I. Zucker. lfcs 2013: 44-58 [doi]

A Class of Contracting Stream OperatorsNick D. James, Jeffery I. Zucker. cj, 56(1):15-33, 2013. [doi]

2011

Continuity of operators on continuous and discrete time streamsJohn V. Tucker, Jeffery I. Zucker. TCS, 412(28):3378-3403, 2011. [doi]

2009

Unifying computers and dynamical systems using the theory of synchronous concurrent algorithmsB. C. Thompson, J. V. Tucker, Jeffery I. Zucker. amc, 215(4):1386-1403, 2009. [doi]

2008

Primitive recursive selection functions for existential assertions over abstract algebrasThomas Strahm, Jeffery I. Zucker. jlp, 76(2):175-197, 2008. [doi]

2007

Universality and semicomputability for nondeterministic programming languages over abstract algebrasWei Jiang, Yuan Wang, Jeffery I. Zucker. jlp, 71(1):44-78, 2007. [doi]

Computability of analog networksJohn V. Tucker, Jeffery I. Zucker. TCS, 371(1-2):115-146, 2007. [doi]

2006

Primitive Recursive Selection Functions over Abstract AlgebrasJeffery I. Zucker. cie 2006: 595-606 [doi]

2005

A Network Model of Analogue Computation over Metric AlgebrasJ. V. Tucker, Jeffery I. Zucker. cie 2005: 515-529 [doi]

Computable total functions on metric algebras, universal algebraic specifications and dynamical systemsJ. V. Tucker, Jeffery I. Zucker. jlp, 62(1):71-108, 2005. [doi]

First and Second Order Recursion on Abstract Data TypesJian Xu, Jeffery I. Zucker. FUIN, 67(4):377-419, 2005. [doi]

2004

Abstract versus concrete computation on metric partial algebrasJ. V. Tucker, Jeffery I. Zucker. tocl, 5(4):611-668, 2004. [doi]

2002

Abstract computability and algebraic specificationJ. V. Tucker, Jeffery I. Zucker. tocl, 3(2):279-333, 2002. [doi]

1999

Computation by While Programs on Topological Partial AlgebrasJ. V. Tucker, Jeffery I. Zucker. TCS, 219(1-2):379-420, 1999. [doi]

1997

Tabular Representations in Relational DocumentsRyszard Janicki, David Lorge Parnas, Jeffery I. Zucker. In Chris Brink, Wolfram Kahl, Gunther Schmidt 0001, editors, Relational Methods in Computer Science. Advances in computing science, pages 184-196, Springer, 1997. [doi]

1996

Transformations of Normal and Inverted Function TablesJeffery I. Zucker. fac, 8(6):679-705, 1996.

1993

The Propositional ::::mu::::-Calculus and Its Use in Model CheckingJeffery I. Zucker. mcmaster 1993: 117-128

Propositional Temporal Logics and Their Use in Model CheckingJeffery I. Zucker. mcmaster 1993: 108-116

1992

A semantic approach to fairnessJan J. M. M. Rutten, Jeffery I. Zucker. FUIN, 16(1):1-38, 1992.

Theory of Computation over Stream Algebras, and its ApplicationsJ. V. Tucker, Jeffery I. Zucker. mfcs 1992: 62-80

Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data TypesJ. V. Tucker, Jeffery I. Zucker. jlp, 13(1):23-55, 1992.

1991

Semantics of Pointers, Referencing and Dereferencing with Intensional LogicHing-Kai Hung, Jeffery I. Zucker. lics 1991: 127-136

Examples of Semicomputable Sets of Real and Complex NumbersJ. V. Tucker, Jeffery I. Zucker. constructivity 1992: 179-198

Projections of Semicomputable Relations on Abstract Data TzpesJ. V. Tucker, Jeffery I. Zucker. ijfcs, 2(3):267-296, 1991.

1990

Toward a General Theory of Computation and Specification over Abstract Data TypesJ. V. Tucker, Jeffery I. Zucker. icci 1990: 129-133

Provable Computable Functions on Abstract Data TypesJ. V. Tucker, S. S. Wainer, Jeffery I. Zucker. icalp 1990: 660-673

1989

Horn Programs and Semicomputable Relations on Abstract StructuresJ. V. Tucker, Jeffery I. Zucker. icalp 1989: 745-760

1988

Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform ConcurrencyJ. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker. jcss, 36(2):158-224, 1988.

Program correctness over abstract data types, with error-state semanticsJohn V. Tucker, Jeffery I. Zucker. Volume 6 of CWI monographs, North-Holland, 1988.

1986

Contrasting Themes in the Semantics of Imperative ConcurrencyJ. W. de Bakker, Joost N. Kok, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker. In J. W. de Bakker, Willem P. de Roever, Grzegorz Rozenberg, editors, Current Trends in Concurrency, Overviews and Tutorials. Volume 224 of Lecture Notes in Computer Science, pages 51-122, Springer, 1986.

1985

Transition Systems, Infinitary Languages and the Semantics of Uniform ConcurrencyJ. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker. stoc 1985: 252-262

1984

On Infinite Computations in Denotational SemanticsJ. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker. TCS, 29:229-230, 1984.

1983

Processes and a Fair Semantics for the Ada Rendez-VousJ. W. de Bakker, Jeffery I. Zucker. icalp 1983: 52-66

Compactness in Semantics for Merge and Fair MergeJ. W. de Bakker, Jeffery I. Zucker. lop 1984: 18-33

On Infinite Computations in Denotational SemanticsJ. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker. TCS, 26:53-82, 1983.

1982

Processes and the Denotational Semantics of ConcurrencyJ. W. de Bakker, Jeffery I. Zucker. iandc, 54(1/2):70-120, July/August 1982.

Denotational Semantics of ConcurrencyJ. W. de Bakker, Jeffery I. Zucker. stoc 1982: 153-158

1978

The adequacy problem for classical logicJeffery I. Zucker. jphil, 7(1):517-535, 1978. [doi]

The adequacy problem for inferential logicJeffery I. Zucker, Robert S. Tragesser. jphil, 7(1):501-516, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL