The following pages link to (Q3046721):
Displaying 17 items.
- Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
- Comparing three coordination models: Reo, ARC, and PBRD (Q608351) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Rewriting semantics of meta-objects and composable distributed services (Q2703711) (← links)
- The Maude LTL model checker (Q2851053) (← links)
- A formal framework for interactive agents (Q2864512) (← links)
- Comparing three coordination models: Reo, ARC, and RRD (Q2866318) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- Reflection in concurrent object-oriented languages (Q2906950) (← links)
- Two Decades of Maude (Q2945709) (← links)
- Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints (Q5179210) (← links)
- A White Box Perspective on Behavioural Adaptation (Q5256369) (← links)
- Building correct-by-construction systems with formal patterns (Q6562511) (← links)