Transition system specifications with negative premises
Theoretical Computer Science
Handbook of logic in computer science (vol. 4)
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
A conservative look at operational semantics with variable binding
Information and Computation
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
A timed LOTOS supporting a dense time domain and including new timed operators
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A General Conservative Extension Theorem in Process Algebra
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Rule formats for determinism and idempotence
Science of Computer Programming
| Hi-index | 0.00 |
In this paper, we give novel and more liberal notions of operational and equational conservativity for language extensions. We motivate these notions by showing their practical application in existing formalisms. Based on our notions, we formulate and prove meta-theorems that establish conservative extensions for languages defined using Structural Operational Semantics (SOS).