4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
SMoLCS-driven concurrent calculi
The International Joint Conference on theory and practice of software development on TAPSOFT '87
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
Action semantics
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantics for ML concurrency primitives
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enhanced operational semantics
ACM Computing Surveys (CSUR)
Semantics for core Concurrent ML using computation types
Higher order operational techniques in semantics
Proof, language, and interaction
The Definition of Standard ML
Theory and Practice of Action Semantics
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Extensible Denotational Language Specifications
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Process Calculus Based upon Evaluation to Committed Form
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Higher-Order Concurrency
Process and Term Tile Logic
A theory of weak bisimulation for Core CML
Journal of Functional Programming
| Hi-index | 0.00 |
Various logic-based frameworks have been proposed for specifying the operational semantics of programming languages and concurrent systems, including inference systems in the styles advocated by Plotkin and by Kahn, Horn logic, equational specifications, reduction systems for evaluation contexts, rewriting logic, and tile logic. We consider the relationship between these frameworks, and assess their respective merits and drawbacks--especially with regard to the modularity of specifications, which is a crucial feature for scaling up to practical applications. We also report on recent work towards the use of the Maude system (which provides an efficient implementation of rewriting logic) as a meta-tool for operational semantics.