The following pages link to Mads Dam (Q931114):
Displaying 27 items.
- Decentralized detection of global threshold crossings using aggregation trees (Q931116) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Proving properties of dynamic process networks (Q1383156) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Model checking mobile processes (Q1817220) (← links)
- On the secure implementation of security protocols (Q1887732) (← links)
- Hoare-style logic for unstructured programs (Q2038040) (← links)
- Formal verification of integrity-preserving countermeasures against cache storage side-channels (Q2324198) (← links)
- Provably correct runtime monitoring (Q2390029) (← links)
- An Epistemic Predicate CTL* for Finite Control π-Processes (Q2825420) (← links)
- Machine Assisted Proof of ARMv7 Instruction Level Isolation Properties (Q2938055) (← links)
- A Data Symmetry Reduction Technique for Temporal-epistemic Logic (Q3648692) (← links)
- (Q3718127) (← links)
- (Q4256653) (← links)
- Process-Algebraic Interpretations of Positive Linear and Relevant Logics (Q4323010) (← links)
- (Q4417874) (← links)
- (Q4417890) (← links)
- (Q4440827) (← links)
- On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
- (Q4511273) (← links)
- -Calculus with Explicit Points and Approximations (Q4542238) (← links)
- (Q4994127) (← links)
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- Reasoning about higher-order processes (Q5096732) (← links)
- Decidability and proof systems for language-based noninterference relations (Q5348913) (← links)
- Security monitor inlining and certification for multithreaded Java (Q5740632) (← links)
