A structural approach to operational semantics

DOI10.1016/J.JLAP.2004.05.001zbMath1082.68062OpenAlexW4210639184MaRDI QIDQ1878719

Gordon D. Plotkin

Publication date: 8 September 2004

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.05.001

zbMATH Keywords

syntactic classes

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (only showing first 100 items - show all)

Modelling and analysing neural networks using a hybrid process algebra ⋮ Higher-level synchronising devices in Meije-SCCS ⋮ A UTP approach for rTiMo ⋮ About fair asynchrony ⋮ Mechanizing a process algebra for network protocols ⋮ A syntactic commutativity format for SOS ⋮ On the operational semantics of nondeterminism and divergence ⋮ A rewriting logic framework for operational semantics of membrane systems ⋮ The rewriting logic semantics project ⋮ SOS formats and meta-theory: 20 years after ⋮ Concurrency and atomicity ⋮ Splitting atoms safely ⋮ Structural operational semantics for stochastic and weighted transition systems ⋮ Processes with infinite liveness requirements ⋮ SOS specifications for uniformly continuous operators ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity ⋮ Designing a semantic model for a wide-spectrum language with concurrency ⋮ The rewriting logic semantics project: a progress report ⋮ Reactive Turing machines ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ The definition of Extended ML: A gentle introduction ⋮ Revisiting sequential composition in process calculi ⋮ Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity ⋮ Denotational semantics and its algebraic derivation for an event-driven system-level language ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ Rule formats for determinism and idempotence ⋮ Structural operational semantics through context-dependent behaviour ⋮ Verification of object-oriented programs: a transformational approach ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Proof systems for satisfiability in Hennessy-Milner logic with recursion ⋮ A\(^ 2\)CCS: Atomic actions for CCS ⋮ Formal modeling and validation of a power-efficient grouping protocol for WSNs ⋮ An operational semantics of occam ⋮ A partial ordering semantics for CCS ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Deriving structural labelled transitions for mobile ambients ⋮ Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language ⋮ Compositional semantics and behavioral equivalences for P systems ⋮ A formal library of set relations and its application to synchronous languages ⋮ Bisimulation through probabilistic testing ⋮ Integrating deployment architectures and resource consumption in timed object-oriented models ⋮ Partial specifications and compositional verification ⋮ Static semantics, types, and binding time analysis ⋮ Executable component-based semantics ⋮ On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ Models for concurrency: Towards a classification ⋮ Location equivalence in a parametric setting ⋮ Structural operational semantics for weak bisimulations ⋮ A theory of processes with durational actions ⋮ The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) ⋮ A layered semantics for a parallel object-oriented language ⋮ Content dependent information flow control ⋮ A language-based approach to modelling and analysis of Twitter interactions ⋮ Some undecidable properties of SOS specifications ⋮ From imperative to rule-based graph programs ⋮ Flag-based big-step semantics ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ Universal axioms for bisimulations ⋮ Graph rewriting for a partial ordering semantics of concurrent constraints programming ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Rule formats for distributivity ⋮ A type system for counting instances of software components ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ On the axiomatizability of priority. II ⋮ SOS rule formats for zero and unit elements ⋮ Unguardedness mostly means many solutions ⋮ On cool congruence formats for weak bisimulations ⋮ A semantics for behavior trees using CSP with specification commands ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ On the expressibility of priority ⋮ Quantitative analysis of weighted transition systems ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ Compositional semantics of spiking neural P systems ⋮ An overview of the K semantic framework ⋮ A brief history of process algebra ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ A logical and graphical framework for reaction systems ⋮ Many-sorted hybrid modal languages ⋮ An operational semantics for object-oriented concepts based on the class hierarchy ⋮ Operational semantics with semicommutations ⋮ Semantics and expressiveness of ordered SOS ⋮ Generating priority rewrite systems for OSOS process languages ⋮ (Bi)simulations up-to characterise process semantics ⋮ Bi-inductive structural semantics ⋮ Coinductive big-step operational semantics ⋮ A rewriting logic approach to operational semantics ⋮ A note on the notation of recursion in process algebras ⋮ Operational and denotational semantics for the box algebra ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Concurrency and knowledge-level communication in agent languages ⋮ On the computational power of BlenX ⋮ Algèbre de processus et synchronisation ⋮ Gaining trust by tracing security protocols ⋮ Parametric channels via label expressions in CCS ⋮ A complete modal proof system for HAL: the Herbrand agent language ⋮ On guarded recursion ⋮ Composition laws for entropy and temperature in tree-like graphs

This page was built for publication: A structural approach to operational semantics