Structuring structural operational semantics
Explore this paper's citation graph
Summary
This thesis enhances the state of the art in this field by offering the following contributions: developing a syntactic format guaranteeing a language construct to be commutative and proposing syntactic rule formats for guaranteeing congruence of strong bisimilarity and higher-order bisimilarities in the setting of higher order processes.
- Type
- article
- Published
- 2005-01-01
- Cited by
- 73
- References
- 225
- Access
- Open access
- OpenAlex
- https://openalex.org/W33940506
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:262342628
Keywords
Operational semantics, Congruence (geometry), Computer science, Bisimulation, Programming language
References
- Separating computation and coordination in the design of parallel and distributed programs
- Preservation of termination for explicit substitution
- On generalised coinduction and probabilistic specification formats: distributive laws in coalgebraic modelling
- Aspects of an integrated neural prediction system
- Specification and analysis of Internet applications
- Structural operational semantics and bounded nondeterminism
- Transition System Specifications with Negative Premises
- The implementation of functional languages on parallel machines with distributed memory
- A Process Algebra for Hybrid Systems
- Cryptology and statecraft in the Dutch Republic
- Discrete-time process algebra
- LETOS – a lightweight execution tool for operational semantics
- Languages for analysis and testing of event sequences
- Choice quantification in process algebra
- Structural congruences and structural operational semantics
- Indoor ultrasonic position estimation using a single base station
- Data synchronization and browsing for home environments
- Context-dependent bisimulation between processes
- Communication and concurrency
- Alea jacta est : verification of probabilistic, real-time and parametric systems
Cited by
- A graph model for a basic process algebra for hybrid systems
- From computability to executability : a process-theoretic view on automata theory
- Verification Techniques for Extensions of Equality Logic
- Analysis and transformation of source code by parsing and rewriting
- Hybrid Techniques for Hybrid Systems
- Modelling and analysis of real-time coordination patterns
- Constructive formal methods and protocol standardization
- Managing requirements evolution : Using reconstructed traceability and requirements views
- Model-based integration and testing of high-tech multi-disciplinary systems
- Security matters : privacy in voting and fairness in digital exchange
- Separation and adaptation of concerns in a shared data space
- Process algebras for hybrid systems : comparison and development
- Formal and Computational Cryptography: Protocols, Hashes and Commitments
- Evolvable Behavior Specifications Using Context-Sensitive Wildcards
- Bohm-Like Trees for Rewriting
- New data structures and algorithms for mobile data
- Clocks, Dice and Processes
- Towards Getting Generic Programming Ready for Prime Time
- IT architecture-based confidentiality risk assessment in networks of organizations
- Revisiting Anomaly-based Network Intrusion Detection Systems
Related papers
- Stepping through Haskell
- Computational aspects of treewidth : Lower bounds and network reliability
- An Assertional Proof System for Multithreaded Java - Theory and Tool Support
- Coalgebraic analysis of probabilistic systems
- Top quality type error Messages
- Analysis and transformation of source code by parsing and rewriting
- Separation and adaptation of concerns in a shared data space
- Experiments in rights control : expression and enforcement
- Compositional verification of hybrid systems using simulation relations