The following pages link to Power domains (Q1251475):
Displaying 50 items.
- Compositional refinement in agent-based security protocols (Q432140) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Observationally-induced lower and upper powerspace constructions (Q492906) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- Imperative abstractions for functional actions (Q604455) (← links)
- Duality beyond sober spaces: Topological spaces and observation frames (Q671991) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Computable concurrent processes (Q673972) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Power domains and second-order predicates (Q685429) (← links)
- On denotational versus predicative semantics (Q753499) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Port automata and the algebra of concurrent porcesses (Q791319) (← links)
- A denotational semantics for shared-memory parallelism and nondeterminism (Q792754) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Issues in the design of a parallel object-oriented language (Q909434) (← links)
- The Hoare and Symth power domain constructors commute under composition (Q912880) (← links)
- Semantics of types for database objects (Q915443) (← links)
- Step semantics for ``true'' concurrency with recursion (Q916408) (← links)
- The shadow knows: refinement and security in sequential programs (Q923889) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- The connected Vietoris powerlocale (Q1030196) (← links)
- On the Herbrand-Kleene universe for nondeterministic computations (Q1060011) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Structured algebraic specifications: A kernel language (Q1080652) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- Concurrent histories: a basis for observing distributed systems (Q1089787) (← links)
- Specification and top-down design of distributed systems (Q1089790) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
- Applications of compactness in the Smyth powerdomain of streams (Q1107301) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1114959) (← links)
- Hiding in stream semantics of uniform concurrency (Q1120267) (← links)
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1123253) (← links)
- Parameter passing in nondeterministic recursive programs (Q1131833) (← links)
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs (Q1136494) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable (Q1162807) (← links)
- A semantics for complex objects and approximate answers (Q1176289) (← links)
- Using powerdomains to generalize relational databases (Q1183586) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- The mixed powerdomain (Q1199543) (← links)
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning (Q1311405) (← links)
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) (Q1318721) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- Testing equivalences for processes (Q1348526) (← links)
- Linear time and branching time semantics for recursion with merge (Q1348527) (← links)
