Communicating sequential processes
Communicating sequential processes
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
General correctness: a unification of partial and total correctness
Acta Informatica
Free constructions of powerdomains
Proceedings of the international conference on Mathematical foundations of programming semantics
A theory for nondeterminism, parallelism, communication, and concurrency
Theoretical Computer Science
Prespecification in data refinement
Information Processing Letters
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
Understanding Z: a specification language and its formal semantics
Understanding Z: a specification language and its formal semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Software engineering mathematics
Software engineering mathematics
The Hoare and Smyth power domain constructors commute under composition
Journal of Computer and System Sciences
Data refinement by calculation
Acta Informatica
Specification and transformation of programs: a formal approach to software development
Specification and transformation of programs: a formal approach to software development
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Programming from specifications
Programming from specifications
Beauty is our business
Lower and upper power domain constructions commute on all cpos
Information Processing Letters
Data refinement of predicate transformers
Theoretical Computer Science
ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
A practical theory of programming
A practical theory of programming
A logical approach to discrete math
A logical approach to discrete math
The lattice of data refinement
Acta Informatica
An algebraic construction of predicate transformers
Science of Computer Programming - Special issue on mathematics of program construction
Handbook of logic in computer science (vol. 3)
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
ACM Computing Surveys (CSUR)
Algebra of programming
A semantics for imprecise exceptions
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Theories of programming languages
Theories of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate transformer semantics of a higher-order imperative language with record subtyping
Science of Computer Programming
Selected writings on computing: a personal perspective
Selected writings on computing: a personal perspective
A Discipline of Programming
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Data Refinement: Model-Oriented Proof Methods and Their Comparison
Data Refinement: Model-Oriented Proof Methods and Their Comparison
A source of inconsistency in theories of nondeterministic functions
Science of Computer Programming
Linearity in Process Languages
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An Upper Power Domain Construction in Terms of Strongly Compact Sets
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Dijkstras Predicate Transformers & Smyth's Power Domaine
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Logical Specifications for Functional Programs
Proceedings of the Second International Conference on Mathematics of Program Construction
Ideal models for pointwise relational and state-free imperative programming
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A Fully Abstract Game Semantics for Finite Nondeterminism
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Implementing Declarative Parallel Bottom-Avoiding Choice
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
Theoretical Computer Science - Logic, semantics and theory of programming
Functional declarative language design and predicate calculus: a practical approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dual unbounded nondeterminacy, recursion, and fixpoints
Acta Informatica
Electronic Notes in Theoretical Computer Science (ENTCS)
Bidomains and full abstraction for countable nondeterminism
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A lattice-theoretic model for an algebra of communicating sequential processes
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Terms with unbounded demonic and angelic nondeterminacy
Science of Computer Programming
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
Building connections between theories of computing and physical systems
Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software
| Hi-index | 0.00 |
Nondeterminacy is a fundamental notion in computing. We show that it can be described by a general theory that accounts for it in the form in which it occurs in many programming contexts, among them specifications, competing agents, data refinement, abstract interpretation, imperative programming, process algebras, and recursion theory. Underpinning these applications is a theory of nondeterministic functions; we construct such a theory. The theory consists of an algebra with which practitioners can reason about nondeterministic functions, and a denotational model to establish the soundness of the theory. The model is based on the idea of free completely distributive lattices over partially ordered sets. We deduce the important properties of nondeterministic functions.