scientific article; zbMATH DE number 4039251
From MaRDI portal
Publication:3777424
zbMATH Open0637.68007MaRDI QIDQ3777424FDOQ3777424
Authors: Tony Hoare 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
traceparallel processessequential processesLispinter-process communicationcombination of different devicescomprehension of formal definitionsvariety of events
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)
Cited In (only showing first 100 items - show all)
- A wide-spectrum language for verification of programs on weak memory models
- Automated analysis of mutual exclusion algorithms using CCS
- A theory of stochastic systems. II: Process algebra
- Modelling Divergence in Relational Concurrent Refinement
- Graph rewriting for a partial ordering semantics of concurrent constraints programming
- Deriving graphical representations of process networks from algebraic expressions
- The expressive power of implicit specifications
- Specification techniques for Markov reward models
- Algorithms for task allocation in ants. (A study of temporal polyethism: Theory)
- Adas and the equational theory of if-then-else
- Maurer computers for pipelined instruction processing
- A shared memory algorithm and proof for the generalized alternative construct in CSP
- Using integer programming to verify general safety and liveness properties
- Algebraic specification and proof of a distributed recovery algorithm
- Modular design of real-time systems using hierarchical communicating real-time state machines
- A conservative look at operational semantics with variable binding
- Distributed games
- The music of streams
- Machine structure oriented control code logic
- A general framework for architecture composability
- An operational semantics for object-oriented concepts based on the class hierarchy
- A formal semantics of extended hierarchical state transition matrices using CSP\#
- Derivation of concurrent programs by stepwise scheduling of Event-B models
- On integrating confidentiality and functionality in a formal method
- Introducing extra operations in refinement
- Relational concurrent refinement. III: Traces, partial relations and automata
- Towards verification of computation orchestration
- PVS embedding of cCSP semantic models and their relationship
- Title not available (Why is that?)
- Refinement of actions in a real-time process algebra with a true concurrency model
- Dynamic logic with binders and its application to the development of reactive systems
- Refinement, conformance and inheritance
- Towards systolizing compilation
- Recursive process definitions with the state operator
- The projection of systolic programs
- Property Preserving Refinement for Csp-Casl
- Finite-state analysis of two contract signing protocols
- Specification completion for IOCO
- Deadlock-freeness of hexagonal systolic arrays
- Introduction to the theory of nested transactions
- Specification styles in distributed systems design and verification
- More relational concurrent refinement: traces and partial relations
- External and internal choice with event groups in Event-B
- Deadlock analysis in networks of communicating processes
- Preservation of probabilistic information flow under refinement
- Analysis of security protocols as open systems
- Ensuring liveness properties of distributed systems: open problems
- A complete axiomatic semantics of spawning
- Designing equivalent semantic models for process creation
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- A parallel algorithm for static program slicing
- Computable concurrent processes
- Observing localities
- Resources in process algebra
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Divergence in testing and readiness semantics
- Metric semantics for concurrency
- On implementations and semantics of a concurrent programming language
- A compositional modelling and verification framework for stochastic hybrid systems
- Algebraic and fixed point equations over inverse limits of algebras
- Symmetric electoral systems for ambient calculi
- Operational and denotational semantics for the box algebra
- Specification and verification of database dynamics
- Temporal theories as modularisation units for concurrent system specification
- Causal automata
- LOTOS extended with probabilistic behaviours
- On deciding trace equivalences for processes
- Nondeterminacy and recursion via stacks and games
- Process synchronisation as fusion
- Contexts, refinement and determinism
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Translating between models of concurrency
- Locked discrete event systems: How to model and how to unlock
- Approximate analyzing of labeled transition systems
- Derivation tree analysis for accelerated fixed-point computation
- On the axiomatizability of priority. II
- Changing system interfaces consistently: a new refinement strategy for CSP\(\|\)B
- SOS rule formats for zero and unit elements
- A principled exploration of coordination models
- A criterion for atomicity revisited
- Bisimulation of automata
- Using data-independence in the analysis of intrusion detection systems
- A state-based approach to communicating processes
- Preferential choice and coordination conditions
- Leader election in rings of ambient processes
- P-A logic - a compositional proof system for distributed programs
- Fixed point equations with parameters in the projective model
- An axiomatic treatment of SIMD assignment
- On controllability and normality of discrete event dynamical systems
- Recursion induction for real-time processes
- Bisimulation on speed: Worst-case efficiency
- Nested semantics over finite trees are equationally hard
- Systems specification by basic protocols
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours
- The Value-Passing Calculus
- Incompleteness of relational simulations in the blocking paradigm
- SIMD language design using prescriptive semantics
- An algebraic theory of multiple clocks
- Rule formats for distributivity
- Ordered SOS process languages for branching and eager bisimulations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777424)
