Pages that link to "Item:Q884946"
From MaRDI portal
The following pages link to Semantics with applications: an appetizer. (Q884946):
Displaying 16 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- Transfinite semantics in the form of greatest fixpoint (Q843215) (← links)
- Special issue: Applied sementics. Selected papers based on the presentations at the 3r workshop of applied semantics (APPSEM 2005), Frauenchiemsee, Germany, September 12--15, 2005. (Q852483) (← links)
- An abstract contract theory for programs with procedures (Q2044183) (← links)
- Reasoning about iteration and recursion uniformly based on big-step semantics (Q2154025) (← links)
- Temporal reasoning through automatic translation of tock-CSP into timed automata (Q2154047) (← links)
- Planning-based knowing how: a unified approach (Q2238589) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs (Q2891399) (← links)
- (Q2980978) (← links)
- Secure Guarded Commands (Q3297842) (← links)
- Divergences on monads for relational program logics (Q6149935) (← links)
- Fully Abstract and Robust Compilation (Q6488145) (← links)
- Implementing a CTL model checker with \(\mu \mathcal{G}\), a language for programming graph neural networks (Q6535461) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)
- A small-step operational semantics for GP 2 (Q6649538) (← links)
