John V. Tucker

J. Univers. Comput. Sci., 2024

On human-centred security: A new systems model based on modes and mode transitions.

[BibT_eX]

[DOI]

CoRR, 2024

Rings with common division, common meadows and their conditional equational theories.

[BibT_eX]

[DOI]

CoRR, 2024

Eager Term Rewriting For The Fracterm Calculus Of Common Meadows.

[BibT_eX]

[DOI]

Comput. J., 2024

2023

Naive Fracterm Calculus.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., September, 2023

On The Axioms Of Common Meadows: Fracterm Calculus, Flattening And Incompleteness.

[BibT_eX]

[DOI]

Comput. J., July, 2023

Eager Equality for Rational Number Arithmetic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2023

A Complete Finite Equational Axiomatisation of the Fracterm Calculus for Common Meadows.

[BibT_eX]

[DOI]

CoRR, 2023

Local Histories of Computing.

[BibT_eX]

[DOI]

John Vivian Tucker

Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

Teaching History of Computing.

[BibT_eX]

[DOI]

John Vivian Tucker

Proceedings of the 2023 Conference on United Kingdom & Ireland Computing Education Research, 2023

2022

Partial arithmetical data types of rational numbers and their equational specification.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2022

A model of systems with modes and mode transitions.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2022

Which Arithmetical Data Types Admit Fracterm Flattening?

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2022

The dynamics of belief: continuously monitoring and visualising complex systems.

[BibT_eX]

[DOI]

CoRR, 2022

Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational Theory.

[BibT_eX]

[DOI]

Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2020

The Wheel of Rational Numbers as an Abstract Data Type.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2020

2018

Classifying the Computational Power of Stochastic Physical Oracles.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2018

Analogue-digital systems and the modular decomposition of physical behaviour.

[BibT_eX]

[DOI]

CoRR, 2018

An Algebraic Theory for Data Linkage.

[BibT_eX]

[DOI]

Liang-Ting Chen

Markus Roggenbach

Proceedings of the Recent Trends in Algebraic Development Techniques, 2018

2017

Computations with oracles that measure vanishing quantities.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

Surveillance and identity: conceptual framework and formal models.

[BibT_eX]

[DOI]

J. Cybersecur., 2017

Monitoring and Intervention: Concepts and Formal Models.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Theorising Monitoring: Algebraic Models of Web Monitoring in Organisations.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2016

2014

Three Forms of Physical Measurement and their Computability.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2014

Editor's Note.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2014

A Natural Computation Model of Positive Relativisation.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2014

An analogue-Digital Church-Turing Thesis.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Formalising Surveillance and Identity.

[BibT_eX]

[DOI]

CoRR, 2014

On the Role of Identity in Surveillance.

[BibT_eX]

[DOI]

CoRR, 2014

Analogue-digital systems with modes of operation.

[BibT_eX]

[DOI]

CoRR, 2014

Computability of Operators on Continuous and Discrete Time Streams.

[BibT_eX]

[DOI]

Comput., 2014

2013

Oracles that measure thresholds: the Turing machine and the broken balance.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

Viewing Cybercommunities through the Lens of Modernity: The Case of Second Life.

[BibT_eX]

[DOI]

Kevin Haines

Int. J. Virtual Communities Soc. Netw., 2013

The data type of spatial objects.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2013

On the Power of Threshold Measurements as Oracles.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2013

Services2Cloud: A Framework for Revenue Analysis of Software-as-a-Service Provisioning.

[BibT_eX]

[DOI]

Proceedings of the IEEE 5th International Conference on Cloud Computing Technology and Science, 2013

2012

The impact of models of a physical oracle on computational power.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

Algebraic Specifications of Computing as a Service with Applications to Cost Analysis.

[BibT_eX]

[DOI]

Proceedings of the IEEE Fifth International Conference on Utility and Cloud Computing, 2012

2011

Continuity of operators on continuous and discrete time streams.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Stability of representations of effective partial algebras.

[BibT_eX]

[DOI]

Math. Log. Q., 2011

2010

Physical Oracles: The Turing Machine and the Wheatstone Bridge.

[BibT_eX]

[DOI]

Stud Logica, 2010

Limits to measurement in experiments governed by algorithms.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2010

2009

Meadows and the equational specification of division.

[BibT_eX]

[DOI]

Yoram Hirshfeld

Theor. Comput. Sci., 2009

Physical Experiments as Oracles.

[BibT_eX]

Bull. EATCS, 2009

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

[BibT_eX]

[DOI]

B. C. Thompson

Appl. Math. Comput., 2009

Computations via Newtonian and relativistic kinematic systems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

2008

Division Safe Calculation in Totalised Fields.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Stability for Effective Algebras.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

Oracles and Advice as Measurements.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computing, 7th International Conference, 2008

On the Complexity of Measurement in Classical Physics.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

Programming Experimental Procedures for Newtonian Kinematic Machines.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

Fields, Meadows and Abstract Data Types.

[BibT_eX]

[DOI]

Yoram Hirshfeld

Proceedings of the Pillars of Computer Science, 2008

2007

Computability of analog networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Can Newtonian systems, bounded in space, time, mass and energy compute all functions?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

The rational numbers as an abstract data type.

[BibT_eX]

[DOI]

J. ACM, 2007

2006

Embedding infinitely parallel computation in Newtonian kinematics.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2006

Elementary Algebraic Specifications of the Rational Complex Numbers.

[BibT_eX]

[DOI]

Proceedings of the Algebra, Meaning, and Computation, 2006

2005

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

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 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

Automatic program translation - a third way.

[BibT_eX]

[DOI]

David P. Clark

Min Chen

Proceedings of the Sixth IEEE International Symposium on Multimedia Software Engineering, 2004

2003

The algebraic structure of interfaces.

[BibT_eX]

[DOI]

D. Ll. L. Rees

Karen Stephenson

Sci. Comput. Program., 2003

Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology.

[BibT_eX]

[DOI]

Int. J. Bifurc. Chaos, 2003

Computable and continuous partial homomorphisms on metric partial algebras.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2003

Visualising Cardiac Anatomy Using Constructive Volume Geometry.

[BibT_eX]

[DOI]

Proceedings of the Functional Imaging and Modeling of the Heart, 2003

2002

Abstract computability and algebraic specification.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2002

Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Abstract Computability, Algebraic Specification and Initiality

[BibT_eX]

[DOI]

CoRR, 2001

2000

Constructive Volume Geometry.

[BibT_eX]

[DOI]

Min Chen

Comput. Graph. Forum, 2000

Constructive Representations of Volumetric Environments.

[BibT_eX]

[DOI]

Min Chen

Adrian Leu

Proceedings of the Volume Graphics, 2000

1999

Computation by 'While' Programs on Topological Partial Algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Concrete Models of Computation for Topological Algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Computable Rings and Fields.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computability Theory, 1999

1998

Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms.

[BibT_eX]

[DOI]

M. J. Poole

Arun V. Holden

Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

Streams, Stream Transformers and Domain Representations.

[BibT_eX]

[DOI]

Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

1996

Algebraic Models of Microprocessors: Architecture and Organisation.

[BibT_eX]

[DOI]

Neal A. Harman

Acta Informatica, 1996

1995

Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras.

[BibT_eX]

[DOI]

J. ACM, 1995

A Data Type Variety of Stack Algebras.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

1993

Algebraic Models and the Correctness of Microprocessors.

[BibT_eX]

[DOI]

Neal A. Harman

Proceedings of the Correct Hardware Design and Verification Methods, 1993

1992

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

[BibT_eX]

[DOI]

J. Log. Program., 1992

Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sematics: Foundations and Applications, 1992

Theory of Computation over Stream Algebras, and its Applications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991

Algebraic and Fixed Point Equations over Inverse Limits of Algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Projections of Semicomputable Relations on Abstract Data Tzpes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 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

The concurrent assignment representation of synchronous systems.

[BibT_eX]

[DOI]

Andrew Richard Martin

Parallel Comput., 1989

Horn Programs and Semicomputable Relations on Abstract Structures.

[BibT_eX]

[DOI]

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

1988

Complete Local Rings as Domains.

[BibT_eX]

[DOI]

J. Symb. Log., 1988

The Scope and Limits of Synchronous Concurrent Computation.

[BibT_eX]

[DOI]

Karl Meinke

Proceedings of the Concurrency 88: International Conference on Concurrency, 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

1987

Algebraic Specifications of Computable and Semicomputable Data Types.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1985

Top-Down Design and the Algebra of Communicating Processes.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1985

1984

Hoare's Logic for Programming Languages with two Data Types.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

The Axiomatic Semantics of Programs Based on Hoare's Logic.

[BibT_eX]

[DOI]

Acta Informatica, 1984

Process Algebra with Asynchronous Communication Mechanisms.

[BibT_eX]

[DOI]

Jan Willem Klop

Proceedings of the Seminar on Concurrency, 1984

1983

Hoare's Logic and Peano's Arithmetic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Algebraic Tools for System Construction.

[BibT_eX]

[DOI]

Jan Willem Klop

Proceedings of the Logics of Programs, 1983

1982

The Completeness of the Algebraic Specification Methods for Computable Data Types

[BibT_eX]

[DOI]

Inf. Control., September, 1982

Floyds Principle, Correctness Theories and Program Equivalence.

[BibT_eX]

[DOI]

Jerzy Tiuryn

Theor. Comput. Sci., 1982

Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Expressiveness and the Completeness of Hoare's Logic.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

Two Theorems About the Completeness of Hoare's Logic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

Complexity Theory and the Operational Structure of Algebraic Programming Systems.

[BibT_eX]

[DOI]

Peter R. J. Asveld

Acta Informatica, 1982

1981

On the Power of Algebraic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

The Refinement of Specifications and the Stabiliy of Hoare's Logic.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

Algebraically Specified Programming Systems and Hoare's Logic.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1981

1980

Computability and the Algebra of Fields: Some Affine Constructions.

[BibT_eX]

[DOI]

J. Symb. Log., 1980

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

On the adequacy of finite equational methods for data type specification.

[BibT_eX]

[DOI]