The origins of structural operational semantics
From MaRDI portal
Publication:1878710
DOI10.1016/J.JLAP.2004.03.009zbMATH Open1072.68063OpenAlexW2007809070MaRDI QIDQ1878710FDOQ1878710
Authors: 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.03.009
Recommendations
History of computer science (68-03) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- LCF considered as a programming language
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus of communicating systems
- Handbook of process algebra
- Title not available (Why is that?)
- Countable nondeterminism and random assignment
- Title not available (Why is that?)
- Formal verification of parallel programs
- Title not available (Why is that?)
- Monadic Elementary Formal Systems
- The \(\pi\)-calculus: A theory of mobile processes
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Title not available (Why is that?)
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Correspondence between ALGOL 60 and Church's Lambda-notation
- The Mechanical Evaluation of Expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- The next 700 programming languages
- Title not available (Why is that?)
- Proving Properties of Programs by Structural Induction
- Title not available (Why is that?)
- Random-Access Stored-Program Machines, an Approach to Programming Languages
- Title not available (Why is that?)
- The Vienna development method: The meta-language
- Title not available (Why is that?)
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- On the power of list iteration
- A mathematical semantics for a nondeterministic typed lambda-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On describing the behavior and implementation of distributed systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Justification of a Proof System for Communicating Sequential Processes
- Formal Semantics of Programming Languages: VDL
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Model for Control Structures for Artificial Intelligence Programming Languages
- Title not available (Why is that?)
Cited In (56)
- The rewriting logic semantics project: a progress report
- Process calculi for biological processes
- Processes with local and global liveness requirements
- Axiomatizing weak ready simulation semantics over BCCSP
- The equational theory of weak complete simulation semantics over BCCSP
- A Modular Equational Generalization Algorithm
- Bi-inductive structural semantics
- Hierarchical design rewriting with Maude
- Bisimulation and coinduction enhancements: a historical perspective
- Inter-deriving semantic artifacts for object-oriented programming
- Splitting atoms safely
- From outermost reduction semantics to abstract machine
- rCOS: defining meanings of component-based software architectures
- Bialgebraic methods in structural operational semantics (invited talk)
- Structural operational semantics through context-dependent behaviour
- Measurable stochastics for Brane calculus
- SOS formats and meta-theory: 20 years after
- A connector algebra for P/T nets interactions
- Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
- Tiles for Reo
- Formalizing operational semantic specifications in logic
- Reasoning about modular datatypes with Mendler induction
- Revisiting sequential composition in process calculi
- A core calculus for correlation in orchestration languages
- Title not available (Why is that?)
- Automating soundness proofs
- Notions of bisimulation and congruence formats for SOS with data
- A brief history of process algebra
- Syntactic logical relations for polymorphic and recursive types
- Probabilistic model of software approximate correctness
- A Rewriting Logic Approach to Type Inference
- Compositional verification of asynchronous concurrent systems using CADP
- Exploring conditional rewriting logic computations
- Structural Operational Semantics for Weighted Transition Systems
- A Type System for Usage of Software Components
- CSP with Hierarchical State
- From reduction-based to reduction-free normalization
- Algebra and logic for resource-based systems modelling
- Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back
- Bio-PEPAd: a non-Markovian extension of Bio-PEPA
- Algebra unifies operational calculi
- Structural operational semantics with first-order logic
- Reactive Systems, Barbed Semantics, and the Mobile Ambients
- A semantic framework for proof evidence
- A congruence rule format with universal quantification
- Bi-inductive structural semantics (extended abstract)
- Automata, Languages and Programming
- Processes with infinite liveness requirements
- Inspecting rewriting logic computations (in a parametric and stepwise way)
- A Theory Agenda for Component-Based Design
- iRho: an imperative rewriting calculus
- Equivalence checking 40 years after: a review of bisimulation tools
- Programming language semantics: It’s easy as 1,2,3
- Better automata through process algebra
- On the expressiveness of mixed choice sessions
- Linking formal methods in software development. A reflection on the development of rCOS
Uses Software
This page was built for publication: The origins of structural operational semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878710)
