Sabina Rossi
According to our database1, Sabina Rossi
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
On csauthors.net:
Bibliography
2017
Fair workload distribution for multi-server systems with pulling strategies.
Perform. Eval., 2017
On the relations between Markov chain lumpability and reversibility.
Acta Inf., 2017
Aggregation and Truncation of Reversible Markov Chains Modulo State Renaming.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2017
2016
Connectivity and energy-aware preorders for mobile ad-hoc networks.
Telecommunication Systems, 2016
Priority-based bandwidth allocation in wireless sensor networks.
EAI Endorsed Trans. Wireless Spectrum, 2016
Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic.
Computer Networks, 2016
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016
Product-Forms for Probabilistic Input/Output Automata.
Proceedings of the 24th IEEE International Symposium on Modeling, 2016
Performance evaluation of AQM techniques with heterogeneous traffic.
Proceedings of the 13th IEEE Annual Consumer Communications & Networking Conference, 2016
Applying Reversibility Theory for the Performance Evaluation of Reversible Computations.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2016
2015
On Discrete Time Reversibility modulo State Renaming and its Applications.
EAI Endorsed Trans. Self-Adaptive Systems, 2015
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses.
Proceedings of the Quantitative Evaluation of Systems, 12th International Conference, 2015
A Product-Form Model for the Analysis of Systems with Aging Objects.
Proceedings of the 23rd IEEE International Symposium on Modeling, 2015
Quantitative Analysis of Concurrent Reversible Computations.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015
2014
Model checking adaptive service compositions.
Sci. Comput. Program., 2014
Behavioural equivalences and interference metrics for mobile ad-hoc networks.
Perform. Eval., 2014
On Discrete Time Reversibility modulo State Renaming and its Applications.
Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, 2014
On the Relations between Lumpability and Reversibility.
Proceedings of the IEEE 22nd International Symposium on Modelling, 2014
2013
A process calculus for energy-aware multicast communications of mobile ad hoc networks.
Wireless Communications and Mobile Computing, 2013
Contextual lumpability.
Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, 2013
A process algebraic framework for estimating the energy consumption in ad-hoc wireless sensor networks.
Proceedings of the 16th ACM International Conference on Modeling, 2013
Autoreversibility: Exploiting Symmetries in Markov Chains.
Proceedings of the 2013 IEEE 21st International Symposium on Modelling, 2013
Performance Analysis and Formal Verification of Cognitive Wireless Networks.
Proceedings of the Computer Performance Engineering - 10th European Workshop, 2013
2012
Automatic energy-aware performance analysis of Mobile Ad-Hoc Networks.
Proceedings of the IFIP Wireless Days Conference 2012, Ireland, November 21-23, 2012, 2012
Interference-Sensitive Preorders for MANETs.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012
Evaluating resistance to jamming and casual interception in mobile wireless networks.
Proceedings of the 15th ACM International Conference on Modeling, 2012
2011
A framework for throughput and energy efficiency in mobile ad hoc networks.
Proceedings of the IFIP Wireless Days Conference 2011, 2011
A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks.
Proceedings of the Analytical and Stochastic Modeling Techniques and Applications, 2011
2010
Sender- and receiver-centered interference in wireless ad hoc networks.
Proceedings of the 3rd IFIP Wireless Days Conference 2010, 2010
A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks.
Proceedings of the Theoretical Computer Science, 2010
Model Checking Adaptive Multilevel Service Compositions.
Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010
2009
Compliance Preorders for Web Services.
Proceedings of the Web Services and Formal Methods, 6th International Workshop, 2009
Information flow security for service compositions.
Proceedings of the International Conference on Ultra Modern Telecommunications, 2009
2008
A Theory of Adaptable Contract-Based Service Composition.
Proceedings of the SYNASC 2008, 2008
PicNIc - Pi-calculus non-interference checker.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008
2007
Compositional information flow security for concurrent programs.
Journal of Computer Security, 2007
Controlling information release in the pi-calculus.
Inf. Comput., 2007
Action Refinement in Process Algebra and Security Issues.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007
Static vs Dynamic Typing for Access Control in Pi-Calculus.
Proceedings of the Advances in Computer Science, 2007
2006
Information flow security in dynamic contexts.
Journal of Computer Security, 2006
P-congruences as non-interference for the pi-calculus.
Proceedings of the 2006 ACM workshop on Formal methods in security engineering, 2006
2005
Non-interference proof techniques for the analysis of cryptographic protocols.
Journal of Computer Security, 2005
Information flow in secure contexts.
Journal of Computer Security, 2005
A Theory of Noninterference for the pi-Calculus.
Proceedings of the Trustworthy Global Computing, International Symposium, 2005
Bridging Language-Based and Process Calculi Security.
Proceedings of the Foundations of Software Science and Computational Structures, 2005
2004
Termination of simply moded logic programs with dynamic scheduling.
ACM Trans. Comput. Log., 2004
Unwinding in Information Flow Security.
Electr. Notes Theor. Comput. Sci., 2004
Verifying persistent security properties.
Computer Languages, Systems & Structures, 2004
CoPS - Checker of Persistent Security.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004
Unwinding Conditions for Security in Imperative Languages.
Proceedings of the Logic Based Program Synthesis and Transformation, 2004
Declarative Semantics of Input Consuming Logic Programs.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004
Modelling Downgrading in Information Flow Security.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004
2003
Bisimulation and Unwinding for Verifying Possibilistic Security Properties.
Proceedings of the Verification, 2003
Refinement Operators and Information Flow Security.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003
Information Flow Security and Recursive Systems.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
Secure Contexts for Confidential Data.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003
2002
Sequence-based abstract interpretation of Prolog.
TPLP, 2002
Properties of input-consuming derivations.
TPLP, 2002
On modular termination proofs of general logic programs.
TPLP, 2002
Proofs Methods for Bisimulation Based Information Flow Security.
Proceedings of the Verification, 2002
A Proof System for Information Flow Security.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002
Information Flow Security in Dynamic Contexts.
Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 2002
Transforming Processes to Check and Ensure Information Flow Security.
Proceedings of the Algebraic Methodology and Software Technology, 2002
2001
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations.
Electr. Notes Theor. Comput. Sci., 2001
Properties of Input-Consuming Derivations
CoRR, 2001
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
CoRR, 2001
Termination of Well-Typed Logic Programs.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling.
Proceedings of the Programming Languages and Systems, 2001
Reexecution-Based Analysis of Logic Programs with Delay Declarations.
Proceedings of the Perspectives of System Informatics, 2001
2000
Sequence-Based Abstract Interpretation of Prolog
CoRR, 2000
On Modular Termination Proofs of General Logic Programs
CoRR, 2000
Semantics of well-moded input-consuming logic programs.
Comput. Lang., 2000
Semantics of Input-Consuming Logic Programs.
Proceedings of the Computational Logic, 2000
1999
Properties of Input-Consuming Derivations.
Electr. Notes Theor. Comput. Sci., 1999
Automated Verification of Prolog Programs.
J. Log. Program., 1999
1998
Specialising Logic Programs with Respect to Call?Post Specifications.
Proceedings of the Logic Programming Synthesis and Transformation, 1998
1997
Automated Verification of Behavioural Properties of Prolog Programs.
Proceedings of the Advances in Computing Science, 1997
Automated Behavioural Verification of Prolog Programs.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997
1996
Specification-Based Automatic Verification of Prolog Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1996
1995
Entending the FOLON Environment for Automatically Deriving Totally Correct Prolog Procedures from Logic Descriptions.
Proceedings of the 7th Workshop on Logic Programming Environments, 1995
1994
An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut.
Proceedings of the Logic Programming, 1994
An Abstract Interpretation Framework for (almost) Full Prolog.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994
1993
Static Analysis of Prolog with Cut.
Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993
Static Analysis of Prolog with Cut.
Proceedings of the 8th Italian Conference on Logic Programming, 1993