A structural approach to operational semantics
From MaRDI portal
Publication:1878719
DOI10.1016/j.jlap.2004.05.001zbMath1082.68062MaRDI QIDQ1878719
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
68Q55: Semantics in the theory of computing
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Non Expansive ε-Bisimulations, 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, Universal axioms for bisimulations, Graph rewriting for a partial ordering semantics of concurrent constraints programming, A note on the notation of recursion in process algebras, Algèbre de processus et synchronisation, Parametric channels via label expressions in CCS, On guarded recursion, A rewriting logic framework for operational semantics of membrane systems, The rewriting logic semantics project, SOS formats and meta-theory: 20 years after, Splitting atoms safely, Proof systems for satisfiability in Hennessy-Milner logic with recursion, A\(^ 2\)CCS: Atomic actions for CCS, An operational semantics of occam, A partial ordering semantics for CCS, Compositional semantics and behavioral equivalences for P systems, 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, Higher-level synchronising devices in Meije-SCCS, About fair asynchrony, Concurrency and atomicity, Bisimulation through probabilistic testing, Partial specifications and compositional verification, Static semantics, types, and binding time analysis, On the expressive power of finitely typed and universally polymorphic recursive procedures, The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\), A layered semantics for a parallel object-oriented language, An algebraic semantics for structured transition systems and its application to logic programs, 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, A complete modal proof system for HAL: the Herbrand agent language, Composition laws for entropy and temperature in tree-like graphs, On the operational semantics of nondeterminism and divergence, A logical semantics for depth-first Prolog with ground negation, The definition of Extended ML: A gentle introduction, A brief history of process algebra, Compositionality of Hennessy-Milner logic by structural operational semantics, A compositional coalgebraic model of fusion calculus, Selective strictness and parametricity in structural operational semantics, inequationally, Notions of bisimulation and congruence formats for SOS with data, Decidable first-order transition logics for PA-processes, Reversing algebraic process calculi, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, Ugo Montanari and Concurrency Theory, A Rule Format for Associativity
