J. V. Tucker

According to our database1, J. V. Tucker
  • authored at least 88 papers between 1980 and 2017.
  • has a "Dijkstra number"2 of three.



In proceedings 
PhD thesis 



On csauthors.net:


Monitoring and Intervention: Concepts and Formal Models.
CoRR, 2017

Three Forms of Physical Measurement and their Computability.
Rew. Symb. Logic, 2014

Editor's Note.
J. Log. Algebr. Meth. Program., 2014

A Natural Computation Model of Positive Relativisation.
IJUC, 2014

An analogue-Digital Church-Turing Thesis.
Int. J. Found. Comput. Sci., 2014

Formalising Surveillance and Identity.
CoRR, 2014

On the Role of Identity in Surveillance.
CoRR, 2014

Analogue-digital systems with modes of operation.
CoRR, 2014

Computability of Operators on Continuous and Discrete Time Streams.
Computability, 2014

Oracles that measure thresholds: the Turing machine and the broken balance.
J. Log. Comput., 2013

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

The data type of spatial objects.
Formal Asp. Comput., 2013

On the Power of Threshold Measurements as Oracles.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Services2Cloud: A Framework for Revenue Analysis of Software-as-a-Service Provisioning.
Proceedings of the IEEE 5th International Conference on Cloud Computing Technology and Science, 2013

The impact of models of a physical oracle on computational power.
Mathematical Structures in Computer Science, 2012

Algebraic Specifications of Computing as a Service with Applications to Cost Analysis.
Proceedings of the IEEE Fifth International Conference on Utility and Cloud Computing, 2012

Continuity of operators on continuous and discrete time streams.
Theor. Comput. Sci., 2011

Stability of representations of effective partial algebras.
Math. Log. Q., 2011

Limits to measurement in experiments governed by algorithms.
Mathematical Structures in Computer Science, 2010

Meadows and the equational specification of division.
Theor. Comput. Sci., 2009

Physical Experiments as Oracles.
Bulletin of the EATCS, 2009

Limits to measurement in experiments governed by algorithms
CoRR, 2009

Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms.
Applied Mathematics and Computation, 2009

Computations via Newtonian and relativistic kinematic systems.
Applied Mathematics and Computation, 2009

Division Safe Calculation in Totalised Fields.
Theory Comput. Syst., 2008

Stability for Effective Algebras.
Electr. Notes Theor. Comput. Sci., 2008

Oracles and Advice as Measurements.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

On the Complexity of Measurement in Classical Physics.
Proceedings of the Theory and Applications of Models of Computation, 2008

Programming Experimental Procedures for Newtonian Kinematic Machines.
Proceedings of the Logic and Theory of Algorithms, 2008

Fields, Meadows and Abstract Data Types.
Proceedings of the Pillars of Computer Science, 2008

Computability of analog networks.
Theor. Comput. Sci., 2007

Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theor. Comput. Sci., 2007

The rational numbers as an abstract data type.
J. ACM, 2007

Embedding infinitely parallel computation in Newtonian kinematics.
Applied Mathematics and Computation, 2006

Elementary Algebraic Specifications of the Rational Complex Numbers.
Proceedings of the Algebra, Meaning, and Computation, 2006

Computable total functions on metric algebras, universal algebraic specifications and dynamical systems.
J. Log. Algebr. Program., 2005

A Network Model of Analogue Computation over Metric Algebras.
Proceedings of the New Computational Paradigms, 2005

Abstract versus concrete computation on metric partial algebras.
ACM Trans. Comput. Log., 2004

Automatic program translation - a third way.
Proceedings of the Sixth IEEE International Symposium on Multimedia Software Engineering, 2004

The algebraic structure of interfaces.
Sci. Comput. Program., 2003

Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology.
I. J. Bifurcation and Chaos, 2003

Computable and continuous partial homomorphisms on metric partial algebras.
Bulletin of Symbolic Logic, 2003

Visualising Cardiac Anatomy Using Constructive Volume Geometry.
Proceedings of the Functional Imaging and Modeling of the Heart, 2003

Abstract computability and algebraic specification.
ACM Trans. Comput. Log., 2002

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

Abstract Computability, Algebraic Specification and Initiality
CoRR, 2001

Abstract versus Concrete Computation on Metric Partial Algebras
CoRR, 2001

Constructive Volume Geometry.
Comput. Graph. Forum, 2000

Computation by 'While' Programs on Topological Partial Algebras.
Theor. Comput. Sci., 1999

Concrete Models of Computation for Topological Algebras.
Theor. Comput. Sci., 1999

Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms.
Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

Streams, Stream Transformers and Domain Representations.
Proceedings of the Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA, 1998

Algebraic Models of Microprocessors: Architecture and Organisation.
Acta Inf., 1996

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

A Data Type Variety of Stack Algebras.
Ann. Pure Appl. Logic, 1995

Algebraic Models and the Correctness of Microprocessors.
Proceedings of the Correct Hardware Design and Verification Methods, 1993

Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types.
J. Log. Program., 1992

Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms.
Proceedings of the Sematics: Foundations and Applications, 1992

Theory of Computation over Stream Algebras, and its Applications.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Algebraic and Fixed Point Equations over Inverse Limits of Algebras.
Theor. Comput. Sci., 1991

Projections of Semicomputable Relations on Abstract Data Tzpes.
Int. J. Found. Comput. Sci., 1991

Examples of Semicomputable Sets of Real and Complex Numbers.
Proceedings of the Constructivity in Computer Science, 1991

Toward a General Theory of Computation and Specification over Abstract Data Types.
Proceedings of the Advances in Computing and Information, 1990

Provable Computable Functions on Abstract Data Types.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

The concurrent assignment representation of synchronous systems.
Parallel Computing, 1989

Horn Programs and Semicomputable Relations on Abstract Structures.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Complete Local Rings as Domains.
J. Symb. Log., 1988

The Scope and Limits of Synchronous Concurrent Computation.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

Algebraic Specifications of Computable and Semicomputable Data Types.
Theor. Comput. Sci., 1987

The Concurrent Assignment Representation of Synchronous Systems.
Proceedings of the PARLE, 1987

Top-Down Design and the Algebra of Communicating Processes.
Sci. Comput. Program., 1985

Hoare's Logic for Programming Languages with two Data Types.
Theor. Comput. Sci., 1984

The Axiomatic Semantics of Programs Based on Hoare's Logic.
Acta Inf., 1984

Process Algebra with Asynchronous Communication Mechanisms.
Proceedings of the Seminar on Concurrency, 1984

Hoare's Logic and Peano's Arithmetic.
Theor. Comput. Sci., 1983

Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems.
SIAM J. Comput., 1983

Algebraic Tools for System Construction.
Proceedings of the Logics of Programs, 1983

The Completeness of the Algebraic Specification Methods for Computable Data Types
Information and Control, September, 1982

Floyds Principle, Correctness Theories and Program Equivalence.
Theor. Comput. Sci., 1982

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

Expressiveness and the Completeness of Hoare's Logic.
J. Comput. Syst. Sci., 1982

Two Theorems About the Completeness of Hoare's Logic.
Inf. Process. Lett., 1982

Complexity Theory and the Operational Structure of Algebraic Programming Systems.
Acta Inf., 1982

On the Power of Algebraic Specifications.
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.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, May 1981, 1981

Algebraically Specified Programming Systems and Hoare's Logic.
Proceedings of the Automata, 1981

Computability and the Algebra of Fields: Some Affine Constructions.
J. Symb. Log., 1980

A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method.
Proceedings of the Automata, 1980