Cliff B. Jones
According to our database^{1},
Cliff B. Jones
authored at least 129 papers
between 1971 and 2018.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1995, "A longstanding originator and promoter of formal and rigorous methods for software design and construction, especially the Vienna Development Method (VDM).".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at viaf.org

at orcid.org

at id.loc.gov

at dnb.info

at isni.org

at dl.acm.org
On csauthors.net:
Bibliography
2018
Concurrency: Handling Interference Formally.
Proceedings of the Symposium on RealTime and Hybrid Systems, 2018
2017
The Turing Guide  By Jack Copeland, Jonathan Bowen, Mark Sprevak, Robin Wilson and others Oxford University Press, Oxford, UK, 26 January 2017, xv+576 pp, 246 × 189 mm, ISBN: 9780198747826 (Hardback, $75.00), ISBN: 9780198747833 (Paperback, $19.99).
Formal Asp. Comput., 2017
General Lessons from a Rely/Guarantee Development.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017
Challenges for Formal Semantic Description: Responses from the Main Approaches.
Proceedings of the Engineering Trustworthy Software Systems  Third International School, 2017
A Guide to Rely/Guarantee Thinking.
Proceedings of the Engineering Trustworthy Software Systems  Third International School, 2017
Turing's 1949 Paper in Context.
Proceedings of the Unveiling Dynamics and Complexity, 2017
2016
Possible values: Exploring a concept for concurrency.
J. Log. Algebr. Meth. Program., 2016
Lessons from DEPLOYment.
CoRR, 2016
Possible values: exploring a concept for concurrency.
CoRR, 2016
2015
Editorial.
Formal Asp. Comput., 2015
Balancing expressiveness in formal approaches to concurrency.
Formal Asp. Comput., 2015
In memoriam: Professor Heinz Zemanek (19202014).
Formal Asp. Comput., 2015
Reasoning about Separation Using Abstraction and Reification.
Proceedings of the Software Engineering and Formal Methods  13th International Conference, 2015
2014
Special issue on Automated Verification of Critical Systems (AVoCS'11).
Sci. Comput. Program., 2014
Revising basic theorem proving algorithms to cope with the logic of partial functions.
Sci. Comput. Program., 2014
Editorial.
Formal Asp. Comput., 2014
Editorial.
Formal Asp. Comput., 2014
A Model for Capturing and Replaying Proof Strategies.
Proceedings of the Verified Software: Theories, Tools and Experiments, 2014
Can a system learn from interactive proofs?
Proceedings of the HOWARD60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday, 2014
2013
Comparing Degrees of NonDeterminism in Expression Evaluation.
Comput. J., 2013
Expressiveness of Notations for Reasoning about Concurrency.
Proceedings of the 2013 18th International Conference on Engineering of Complex Computer Systems, 2013
Ours Is to Reason Why.
Proceedings of the Theories of Programming and Formal Methods, 2013
Experience of Deployment in the Automotive Industry.
Proceedings of the Industrial Deployment of System Engineering Methods, 2013
2012
John McCarthy (19272011).
Formal Asp. Comput., 2012
AI meets Formal Software Development (Dagstuhl Seminar 12271).
Dagstuhl Reports, 2012
Abstraction as a Unifying Link for Formal Approaches to Concurrency.
Proceedings of the Software Engineering and Formal Methods  10th International Conference, 2012
A Semantic Analysis of Logics That Cope with Partial Terms.
Proceedings of the Abstract State Machines, Alloy, B, VDM, and Z, 2012
2011
Semantic Models for a Logic of Partial Functions.
Int. J. Software and Informatics, 2011
Elucidating concurrent algorithms via layers of abstraction and reification.
Formal Asp. Comput., 2011
Preface.
ECEASST, 2011
2010
Abstractions Before Proofs.
Proceedings of the 6th International Verification Workshop, 2010
Insight, Inspiration and Collaboration.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010
The Role of Auxiliary Variables in the Formal Development of Concurrent Programs.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010
2008
The connection between two ways of reasoning about partial functions.
Inf. Process. Lett., 2008
Editorial.
Formal Asp. Comput., 2008
Valediction.
Formal Asp. Comput., 2008
Reasoning about programs via operational semantics: requirements for a support system.
Autom. Softw. Eng., 2008
Reflections on, and Predictions for, Support Systems for the Development of Programs.
Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE 2008), 2008
Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification.
Proceedings of the Abstract State Machines, B and Z, First International Conference, 2008
2007
Splitting atoms safely.
Theor. Comput. Sci., 2007
A Structural Proof of the Soundness of Rely/guarantee Rules.
J. Log. Comput., 2007
Atomicity: A Unifying Concept in Computer Science.
J. UCS, 2007
Editorial.
Formal Asp. Comput., 2007
What Can the picalculus Tell Us About the Mondex Purse System?
Proceedings of the 12th International Conference on Engineering of Complex Computer Systems (ICECCS 2007), 2007
Deriving Specifications for Systems That Are Connected to the Physical World.
Proceedings of the Formal Methods and Hybrid RealTime Systems, 2007
Understanding Programming Language Concepts Via Operational Semantics.
Proceedings of the Domain Modeling and the Duration Calculus, 2007
2006
The DIRC Project as the Context of this Book.
Proceedings of the Trust in Technology: A SocioTechnical Perspective, 2006
An Approach to Splitting Atoms Safely: Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2006
Reasoning About Partial Functions in the Formal Development of Programs.
Electr. Notes Theor. Comput. Sci., 2006
Verified Software: A Grand Challenge.
IEEE Computer, 2006
Formal Modelling of Dynamic Coalitions, with an Application in Chemical Engineering.
Proceedings of the Leveraging Applications of Formal Methods, 2006
Roadmap for enhanced languages and methods to aid verification.
Proceedings of the Generative Programming and Component Engineering, 2006
06121 Abstracts Collection  Atomicity: A Unifying Concept in Computer Science.
Proceedings of the Atomicity: A Unifying Concept in Computer Science, 19.03.  24.03.2006, 2006
06121 Executive Summary  Atomicity: A Unifying Concept in Computer Science.
Proceedings of the Atomicity: A Unifying Concept in Computer Science, 19.03.  24.03.2006, 2006
Structure for dependability  computerbased systems from an interdisciplinary perspective.
Springer, ISBN: 9781846281105, 2006
2005
The atomic manifesto: a story in four quarks.
Operating Systems Review, 2005
The atomic manifesto: a story in four quarks.
SIGMOD Record, 2005
The Atomic Manifesto.
J. UCS, 2005
Investigating Atomicity and Observability.
J. UCS, 2005
Atomicity in System Design and Execution (Proceedings of DagstuhlSeminar 04181) J.UCS Special Issue.
J. UCS, 2005
Specification Before Satisfaction: The Case for Research into Obtaining the Right Specification  Extended Abstract.
Proceedings of the ZB 2005: Formal Specification and Development in Z and B, 2005
Some Interdisciplinary Observations about Getting the "Right" Specification.
Proceedings of the Verified Software: Theories, 2005
2004
Editorial.
Formal Asp. Comput., 2004
Online First Publication.
Formal Asp. Comput., 2004
Editorial.
Formal Asp. Comput., 2004
The Atomic Manifesto: a Story in Four Quarks.
Proceedings of the Atomicity in System Design and Execution, 25.04.  30.04.2004, 2004
2003
Operational semantics: Concepts and their expression.
Inf. Process. Lett., 2003
The Early Search for Tractable Ways of Reasoning about Programs.
IEEE Annals of the History of Computing, 2003
Determining the Specification of a Control System from That of Its Environment.
Proceedings of the FME 2003: Formal Methods, 2003
2002
Editorial.
Formal Asp. Comput., 2002
A Formal Basis for Some Dependability Notions.
Proceedings of the Formal Methods at the Crossroads. From Panacea to Foundational Support, 2002
Editorial message: special track on interdisciplinary approaches to the design of dependable computer systems.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002
Structured Handling of Online Interface Upgrades in Integrating Dependable Systems of Systems.
Proceedings of the Scientific Engineering for Distributed Java Applications, 2002
A Structured Approach to Handling OnLine Interface Upgrades.
Proceedings of the 26th International Computer Software and Applications Conference (COMPSAC 2002), 2002
2001
The Transition from VDL to VDM.
J. UCS, 2001
An Iterative Displacement Method for Conflict Resolution in Map Generalization.
Algorithmica, 2001
Thinking Tools for the Future of Computing Science.
Proceedings of the Informatics  10 Years Back. 10 Years Ahead., 2001
2000
Editorial.
Formal Asp. Comput., 2000
Formal Methods and Dependability.
Proceedings of the Mathematics of Program Construction, 5th International Conference, 2000
Haptic Interface Control  Design Issues and Experiments with a Planar Device.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000
Enhancing the tractability of rely/guarantee specifications in the development of interfering operations.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000
1999
Scientific Decisions which Characterize VDM.
Proceedings of the FM'99  Formal Methods, 1999
1998
Some Mistakes I Have and What I Have Learned from Them.
FASE, 1998
1997
Whither Formal Methods: A Plea to Investigate New Applications.
Proceedings of the First IEEE International Conference on Formal Engineering Methods, 1997
1996
Accommodating Interference in the Formal Design of Concurrent ObjectBased Programs.
Formal Methods in System Design, 1996
Formal Methods Light.
ACM Comput. Surv., 1996
An Invitation to Formal Methods.
IEEE Computer, 1996
Some Practical Problems and Their Influence on Semantics.
Proceedings of the Programming Languages and Systems, 1996
1995
Partial Functions and Logics: A Warning.
Inf. Process. Lett., 1995
Fixing the semantics of some concurrent objectoriented concepts.
Electr. Notes Theor. Comput. Sci., 1995
Granularity and the development of concurrent programs.
Electr. Notes Theor. Comput. Sci., 1995
NonInterference Properties of a Concurrent ObjectBased Language: Proofs Based on an Operational Semantics.
Object Orientation with Parallelism and Persistence, 1995
1994
A Typed Logic of Partial Functions Reconstructed Classically.
Acta Inf., 1994
1993
Constraining Inference in an ObjectBased Design Model.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993
Reasoning about Interference in an ObjectBased Design Method.
Proceedings of the FME '93: IndustrialStrength Formal Methods, 1993
A piCalculus Semantics for an ObjectBased Design Notation.
Proceedings of the CONCUR '93, 1993
1991
Mural  a formal development support system.
Springer, ISBN: 354019651X, 1991
Systematic software development using VDM (2. ed.).
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 9780138807337, 1991
1990
Interference Revisited.
Proceedings of the Z User Workshop, 1990
Modularizing the Formal Description of a Database System.
Proceedings of the VDM '90, 1990
1989
Position Statement for the Panel on Foundations of Software Engineering.
IFIP Congress, 1989
1988
Theorem proving and software engineering.
Software Engineering Journal, 1988
MUFFIN: A User Interface Design Experiment for a Theorem Proving Assistant.
Proceedings of the VDM '88, 1988
A Support System for Formal Reasoning: Requirements and Status.
Proceedings of the VDM '88, 1988
1987
VDM Proof Obligations and their Justification.
Proceedings of the VDM '87, VDM  A Formal Method at Work, 1987
1986
Software Development Based on Formal Methods.
Proceedings of the Software Development and Ada, 1986
Systematic software development using VDM.
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 9780138807252, 1986
1985
The Role of Proof Obligations in Software Design.
Proceedings of the Mathematical Foundations of Software Development, 1985
MDB: A GraphLike Persistent Database.
Proceedings of the Data Types and Persistence, 1985
1984
A Significance Rule for MultiplePrecision Arithmetic.
ACM Trans. Math. Softw., 1984
An Early Program Proof by Alan Turing.
IEEE Annals of the History of Computing, 1984
A Logic Covering Undefinedness in Program Proofs.
Acta Inf., 1984
On the Formal Definition of a PL/I Subset (Selected parts).
Proceedings of the Programming Languages and Their Definition  Hans Bekic (19361982), 1984
1983
Tentative Steps Toward a Development Method for Interfering Programs.
ACM Trans. Program. Lang. Syst., 1983
Specification and Design of (Parallel) Programs.
IFIP Congress, 1983
1981
Developing methods for computer programs including a notion of interference.
PhD thesis, 1981
An efficient coding system for long source sequences.
IEEE Trans. Information Theory, 1981
Specification as a Design Base (Extended Abstract).
Proceedings of the Trends in Information Processing Systems, 1981
1980
Towards More Formal Specifictations.
Proceedings of the Software Engineering, 1980
1979
Constructing a Theory of a Data Structure as an Aid to Program Development.
Acta Inf., 1979
Models of Programming Language Concepts.
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979
1978
Denotational Semantics of GOTO: An Exit Formulation and Its Relation to Continuations.
Proceedings of the Vienna Development Method: The MetaLanguage, 1978
The METALanguage: A Reference Manual.
Proceedings of the Vienna Development Method: The MetaLanguage, 1978
A Formal Definition of Algol 60 as Described in the 1975 Modified Report.
Proceedings of the Vienna Development Method: The MetaLanguage, 1978
1977
Program Specifications and Formal Development.
Proceedings of the International Computing Symposium 1977, 1977
1974
Formal Definition in Program Development.
Proceedings of the Programming Methodology, 4th Informatik Symposium, 1974
1971
Proving correctness of implementation techniques.
Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971
A RunTime Mechanism for Referencing Variables.
Inf. Process. Lett., 1971
A New Approach to the 'Hidden Line' Problem.
Comput. J., 1971