Pages that link to "Item:Q2851059"

The following pages link to An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0 (Q2851059):

Displaying 13 items.

• Verifiable abstractions for contract-oriented systems (Q347375) (← links)
• The rewriting logic semantics project: a progress report (Q393080) (← links)
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
• The rewriting logic semantics project (Q877024) (← links)
• A rewriting logic approach to operational semantics (Q1012130) (← links)
• Trace and testing equivalence on asynchronous processes (Q1854499) (← links)
• Twenty years of rewriting logic (Q1931904) (← links)
• Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
• Semantic foundations for generalized rewrite theories (Q2503334) (← links)
• Coding mobile synchronizing Petri nets into rewriting logic (Q2864520) (← links)
• The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
• Session-based concurrency in Maude: executable semantics and type checking (Q6156938) (← links)
• Executable Semantics and Type Checking for Session-Based Concurrency in Maude (Q6487298) (← links)