The following pages link to Sabina Rossi (Q832088):
Displayed 41 items.
- Reasoning about proportional lumpability (Q832089) (← links)
- Dynamic control of the join-queue lengths in saturated fork-join stations (Q1693123) (← links)
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses (Q1753998) (← links)
- Aggregation and truncation of reversible Markov chains modulo state renaming (Q1798140) (← links)
- Verifying persistent security properties (Q1886452) (← links)
- \textit{D\_PSNI}: delimited persistent stochastic non-interference (Q2049988) (← links)
- A Matlab toolkit for the analysis of two-level processor sharing queues (Q2056987) (← links)
- Proportional lumpability and proportional bisimilarity (Q2139185) (← links)
- Proportional lumpability (Q2176708) (← links)
- Controlling information release in the \(\pi\)-calculus (Q2643083) (← links)
- Semantics of well-moded input-consuming logic programs (Q2745732) (← links)
- (Q2763687) (← links)
- (Q2767054) (← links)
- Quantitative Analysis of Concurrent Reversible Computations (Q2945596) (← links)
- Transforming Processes to Check and Ensure Information Flow Security* (Q2996149) (← links)
- A Proof System for Information Flow Security (Q3079920) (← links)
- A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks (Q3163870) (← links)
- (Q3384915) (← links)
- (Q4282511) (← links)
- (Q4414391) (← links)
- Sequence-based abstract interpretation of Prolog (Q4452611) (← links)
- Properties of Input-Consuming Derivations (Q4452613) (← links)
- On modular termination proofs of general logic programs (Q4452617) (← links)
- (Q4475098) (← links)
- (Q4499239) (← links)
- Applying Reversibility Theory for the Performance Evaluation of Reversible Computations (Q4571082) (← links)
- Automated verification of Prolog programs (Q4700385) (← links)
- (Q4736985) (← links)
- Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations (Q4923517) (← links)
- Persistent Stochastic Non-Interference (Q5158656) (← links)
- Termination of simply moded logic programs with dynamic scheduling (Q5277705) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308397) (← links)
- Trustworthy Global Computing (Q5394792) (← links)
- Unwinding Conditions for Security in Imperative Languages (Q5458796) (← links)
- Action Refinement in Process Algebra and Security Issues (Q5504602) (← links)
- Foundations of Software Science and Computational Structures (Q5705885) (← links)
- Program Development in Computational Logic (Q5712545) (← links)
- Theoretical Computer Science (Q5897373) (← links)
- Fundamentals of Computation Theory (Q5900812) (← links)
- Reverse bisimilarity vs. forward bisimilarity (Q6091197) (← links)
- Biased Processor Sharing in Fork-Join Queues (Q6104814) (← links)