Jeffery I. Zucker

J. Log. Comput., 2021

2019

Approximability in the GPAC.

[BibT_eX]

[DOI]

Diogo Poças

Log. Methods Comput. Sci., 2019

Notions of semicomputability in topological algebras over the reals.

[BibT_eX]

[DOI]

Mark Armstrong

Comput., 2019

2018

Analog networks on function data streams.

[BibT_eX]

[DOI]

Diogo Poças

Comput., 2018

2015

Characterizations of semicomputable sets of real numbers.

[BibT_eX]

[DOI]

Bo Xie

Ming Quan Fu

J. Log. Algebraic Methods Program., 2015

Models of computation for partial functions on the reals.

[BibT_eX]

[DOI]

Ming Quan Fu

J. Log. Algebraic Methods Program., 2015

2014

Computability of Operators on Continuous and Discrete Time Streams.

[BibT_eX]

[DOI]

Comput., 2014

2013

A Class of Contracting Stream Operators.

[BibT_eX]

[DOI]

Nick D. James

Comput. J., 2013

Assignment Calculus: A Pure Imperative Language.

[BibT_eX]

[DOI]

Marc Bender

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2011

Continuity of operators on continuous and discrete time streams.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2009

Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms.

[BibT_eX]

[DOI]

B. C. Thompson

Appl. Math. Comput., 2009

2008

Primitive recursive selection functions for existential assertions over abstract algebras.

[BibT_eX]

[DOI]

Thomas Strahm

J. Log. Algebraic Methods Program., 2008

2007

Computability of analog networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Universality and semicomputability for nondeterministic programming languages over abstract algebras.

[BibT_eX]

[DOI]

Wei Jiang

Yuan Wang

J. Log. Algebraic Methods Program., 2007

2006

Primitive Recursive Selection Functions over Abstract Algebras.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Computable total functions on metric algebras, universal algebraic specifications and dynamical systems.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2005

First and Second Order Recursion on Abstract Data Types.

[BibT_eX]

[DOI]

Jian Xu

Fundam. Informaticae, 2005

A Network Model of Analogue Computation over Metric Algebras.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Abstract versus concrete computation on metric partial algebras.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2004

2002

Abstract computability and algebraic specification.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2002

2001

Abstract Computability, Algebraic Specification and Initiality

[BibT_eX]

[DOI]

CoRR, 2001

1999

Computation by 'While' Programs on Topological Partial Algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1997

Tabular Representations in Relational Documents.

[BibT_eX]

[DOI]

Ryszard Janicki

David Lorge Parnas

Proceedings of the Relational Methods in Computer Science., 1997

1996

Transformations of Normal and Inverted Function Tables.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1996

1993

The Propositional <i>mu</i>-Calculus and Its Use in Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Functional Programming, 1993

Propositional Temporal Logics and Their Use in Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Functional Programming, 1993

1992

Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types.

[BibT_eX]

[DOI]

J. Log. Program., 1992

A semantic approach to fairness.

[BibT_eX]

Jan J. M. M. Rutten

Fundam. Informaticae, 1992

Theory of Computation over Stream Algebras, and its Applications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991

Projections of Semicomputable Relations on Abstract Data Tzpes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1991

Semantics of Pointers, Referencing and Dereferencing with Intensional Logic

[BibT_eX]

[DOI]

Hing-Kai Hung

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Examples of Semicomputable Sets of Real and Complex Numbers.

[BibT_eX]

[DOI]

Proceedings of the Constructivity in Computer Science, 1991

1990

Toward a General Theory of Computation and Specification over Abstract Data Types.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1990

Provable Computable Functions on Abstract Data Types.

[BibT_eX]

[DOI]

Stanley S. Wainer

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Horn Programs and Semicomputable Relations on Abstract Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency.

[BibT_eX]

[DOI]

Ernst-Rüdiger Olderog

J. Comput. Syst. Sci., 1988

Program correctness over abstract data types, with error-state semantics.

[BibT_eX]

CWI monographs 6, North-Holland, ISBN: 978-0-444-70340-8, 1988

1986

Contrasting Themes in the Semantics of Imperative Concurrency.

[BibT_eX]

[DOI]

Joost N. Kok

Ernst-Rüdiger Olderog

Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985

Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency

[BibT_eX]

[DOI]

Ernst-Rüdiger Olderog

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1983

On Infinite Computations in Denotational Semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Compactness in Semantics for Merge and Fair Merge.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1983

Processes and a Fair Semantics for the Ada Rendez-Vous.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1983

1982

Processes and the Denotational Semantics of Concurrency

[BibT_eX]

[DOI]

Inf. Control., 1982

Denotational Semantics of Concurrency

[BibT_eX]

[DOI]

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1978

The adequacy problem for inferential logic.

[BibT_eX]

[DOI]

Robert S. Tragesser

J. Philos. Log., 1978

The adequacy problem for classical logic.

[BibT_eX]

[DOI]