Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
The power of the future perfect in program logics
Information and Control
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Bounded nondeterminism and the approximation induction principle in process algebra
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Merge and termination in process algebra
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Three partition refinement algorithms
SIAM Journal on Computing
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
The expressive power of parallelism
Future Generation Computer Systems - Parallel computing
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Bisimulation through probabilistic testing
Information and Computation
Research topics in functional programming
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Structured operational semantics and bisimulation as a congruence
Information and Computation
A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
Transition system specifications with negative premises
Theoretical Computer Science
Turning SOS rules into equations
Information and Computation
The algebra of timed processes, ATP: theory and application
Information and Computation
Journal of the ACM (JACM)
A theory of higher order communicating systems
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Structural operational semantics for weak bisimulations
Theoretical Computer Science
Communication and concurrency
Proving congruence of bisimulation in functional programming languages
Information and Computation
Ntyft/ntyxt rules reduce to ntree rules
Information and Computation
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
CPO models for compact GSOS languages
Information and Computation
Bisimulation for higher-order process calculi
Information and Computation
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A conservative look at operational semantics with variable binding
Information and Computation
Rooted branching bisimulation as a congruence
Journal of Computer and System Sciences
Finite axiom systems for testing preorder and De Simone process languages
Theoretical Computer Science
LETOS — a lightweight execution tool for operational semantics
Software—Practice & Experience
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional SOS and beyond: a coalgebraic view of open systems
Theoretical Computer Science
A causal semantics for CCS via rewriting logic
Theoretical Computer Science
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Fundamenta Informaticae
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Simulation of SOS Definitions with Term Rewriting Systems
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
The Tyft/Tyxt Format Reduces to Tree Rules
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Building Tools for LOTOS Symbolic Semantics in Maude
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Front-End Generator for Verification Tools
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Generalized Bisimulation in Relational Specifications
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Formats of Ordered SOS Rules with Silent Actions
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Process Calculi, from Theory to Practice: Verification Tools
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
CONCUR '94 Proceedings of the Concurrency Theory
Axiomatisations of Weak Equivalences for De Simone Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical Methods of Specification and Synthesis of Software Systems '85
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Expressive Results for Process Algebras
Proceedings of the REX Workshop on Sematics: Foundations and Applications
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Full Abstraction in Structural Operational Semantics (Extended Abstract)
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Using SOS Definitions in Term Rewriting Proofs
Proceedings of the first First International Workshop on Larch
Towards a Lambda-Calculus for Concurrent and Communicating Systems
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Metatheory of the $\pi$-Calculus
Metatheory of the $\'pi$-Calculus
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
A format for semantic equivalence comparison
Theoretical Computer Science
Theoretical Computer Science - Special issue: Computational systems biology
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
SOS for higher order processes
CONCUR 2005 - Concurrency Theory
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
Exploiting Labels in Structural Operational Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
From Bialgebraic Semantics to Congruence Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Prototyping SOS Meta-theory in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A syntactic commutativity format for SOS
Information Processing Letters
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Mapping modular SOS to rewriting logic
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Rule formats for non interference
ESOP'03 Proceedings of the 12th European conference on Programming
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Reversing algebraic process calculi
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Orthogonal extensions in structural operational semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Probabilistic congruence for semistochastic generative processes
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On cool congruence formats for weak bisimulations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak parametric failure equivalences and their congruence formats
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Notion of Glue Expressiveness for Component-Based Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Implicit Propagation in Structural Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rule Format for Unit Elements
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
On Rule Formats for Zero and Unit Elements
Electronic Notes in Theoretical Computer Science (ENTCS)
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Rule formats for distributivity
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
Transforming SOS specifications to linear processes
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Rule formats for determinism and idempotence
Science of Computer Programming
Probabilistic transition system specification: congruence and full abstraction of bisimulation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for distributivity
Theoretical Computer Science
Modular bisimulation theory for computations and values
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Modular semantics for transition system specifications with negative premises
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 5.23 |
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981]. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS's) several authors syntactically restricted the format of rules and showed several useful properties about the semantics induced by any TSS adhering to the format. This has resulted in a line of research proposing several syntactical rule formats and associated meta-theorems. Properties that are guaranteed by such rule formats range from well-definedness of the operational semantics and compositionality of behavioral equivalences to security-, time- and probability-related issues. In this paper, we provide an overview of SOS rule formats and meta-theorems formulated around them.