scientific article; zbMATH DE number 4039251

zbMATH Open0637.68007MaRDI QIDQ3777424FDOQ3777424

Authors: Tony Hoare 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 795666
• A Theory of Communicating Sequential Processes
• scientific article; zbMATH DE number 42752
• scientific article; zbMATH DE number 3903946
• scientific article; zbMATH DE number 4018375

zbMATH Keywords

traceparallel processessequential processesLispinter-process communicationcombination of different devicescomprehension of formal definitionsvariety of events

Mathematics Subject Classification ID

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
• The semantics of the combination of atomized statements and parallel choice
• An algebraic framework for urgency
• The laws of Occam programming
• Branching bisimulation congruence for probabilistic systems
• A class of non-deterministic specifications for supervisory control
• Mitigating covert channels based on analysis of the potential for communication
• Enabling synchronous and asynchronous communications in CSP for SOC
• Slicing techniques for verification re-use
• CSP-CASL -- a new integration of process algebra and algebraic specification
• Responsiveness and stable revivals
• On testing UML statecharts
• Comparing transition systems with independence and asynchronous transition systems
• Modeling Routing Protocols in Adhoc Networks
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems
• The compositional construction of Markov processes. II
• Model Checking LTL Formulae in RAISE with FDR
• On the relationships between notions of simulation-based security
• A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
• Recognizing and learning models of social exchange strategies for the regulation of social interactions in open agent societies
• Refactoring Object-Oriented Specifications with Data and Processes
• Objects and classes in Algol-like languages
• From control law diagrams to Ada via \textsf{Circus}
• Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL}
• A dynamic deontic logic for complex contracts
• Static analysis of IMC
• Coverage metrics for temporal logic model checking
• The pursuit of deadlock freedom
• Lazy behavioral subtyping
• Book review of: Robin Sharp, Principles of protocol design
• The infinite evolution mechanism of \(\epsilon\)-bisimilarity
• Domain science and engineering from computer science to the sciences of informatics. II: Science
• Thread algebra for strategic interleaving
• Question-guided stubborn set methods for state properties
• Title not available (Why is that?)
• A sound and complete reasoning system for asynchronous communication with shared futures
• Formal communication elimination and sequentialization equivalence proofs for distributed system models
• Reasoning about orchestrations of web services using partial correctness
• Model checking RAISE applicative specifications
• Threaded behavior protocols
• Compositionality issues in discrete, continuous, and hybrid systems
• Distributed processes and location failures
• CCS with priority guards
• Totality in arena games
• Communicating processes with value-passing and assignments

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)