Sabina Rossi

Matteo Sottana

Proceedings of the Quantitative Evaluation of Systems - 15th International Conference, 2018

Information Flow Security for Stochastic Processes.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Engineering - 15th European Workshop, 2018

2017

Power control in saturated fork-join queueing systems.

[BibT_eX]

[DOI]

Perform. Evaluation, 2017

Fair workload distribution for multi-server systems with pulling strategies.

[BibT_eX]

[DOI]

Perform. Evaluation, 2017

On the relations between Markov chain lumpability and reversibility.

[BibT_eX]

[DOI]

Acta Informatica, 2017

Aggregation and Truncation of Reversible Markov Chains Modulo State Renaming.

[BibT_eX]

[DOI]

Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2017

2016

Connectivity and energy-aware preorders for mobile ad-hoc networks.

[BibT_eX]

[DOI]

Telecommun. Syst., 2016

Priority-based bandwidth allocation in wireless sensor networks.

[BibT_eX]

[DOI]

EAI Endorsed Trans. Wirel. Spectr., 2016

Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic.

[BibT_eX]

[DOI]

Comput. Networks, 2016

Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations.

[BibT_eX]

[DOI]

Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Product-Forms for Probabilistic Input/Output Automata.

[BibT_eX]

[DOI]

Filippo Cavallin

Proceedings of the 24th IEEE International Symposium on Modeling, 2016

Performance evaluation of AQM techniques with heterogeneous traffic.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE Annual Consumer Communications & Networking Conference, 2016

Applying Reversibility Theory for the Performance Evaluation of Reversible Computations.

[BibT_eX]

[DOI]

Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2016

2015

On Discrete Time Reversibility modulo State Renaming and its Applications.

[BibT_eX]

[DOI]

EAI Endorsed Trans. Self Adapt. Syst., 2015

Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses.

[BibT_eX]

[DOI]

Proceedings of the Quantitative Evaluation of Systems, 12th International Conference, 2015

A Product-Form Model for the Analysis of Systems with Aging Objects.

[BibT_eX]

[DOI]

Filippo Cavallin

Proceedings of the 23rd IEEE International Symposium on Modeling, 2015

Quantitative Analysis of Concurrent Reversible Computations.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

2014

Model checking adaptive service compositions.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2014

Behavioural equivalences and interference metrics for mobile ad-hoc networks.

[BibT_eX]

[DOI]

Perform. Evaluation, 2014

On the Relations between Lumpability and Reversibility.

[BibT_eX]

[DOI]

Proceedings of the IEEE 22nd International Symposium on Modelling, 2014

2013

A process calculus for energy-aware multicast communications of mobile ad hoc networks.

[BibT_eX]

[DOI]

Wirel. Commun. Mob. Comput., 2013

Contextual lumpability.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM International Conference on Modeling, 2013

Autoreversibility: Exploiting Symmetries in Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE 21st International Symposium on Modelling, 2013

Performance Analysis and Formal Verification of Cognitive Wireless Networks.

[BibT_eX]

[DOI]

Gian-Luca Dei Rossi

Proceedings of the Computer Performance Engineering - 10th European Workshop, 2013

2012

Automatic energy-aware performance analysis of Mobile Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the IFIP Wireless Days Conference 2012, Ireland, November 21-23, 2012, 2012

Interference-Sensitive Preorders for MANETs.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Evaluating resistance to jamming and casual interception in mobile wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM International Conference on Modeling, 2012

2011

A framework for throughput and energy efficiency in mobile ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the IFIP Wireless Days Conference 2011, 2011

A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Analytical and Stochastic Modeling Techniques and Applications, 2011

2010

Sender- and receiver-centered interference in wireless ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 3rd IFIP Wireless Days Conference 2010, 2010

A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2010

Model Checking Adaptive Multilevel Service Compositions.

[BibT_eX]

[DOI]

Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010

2009

Compliance Preorders for Web Services.

[BibT_eX]

[DOI]

Proceedings of the Web Services and Formal Methods, 6th International Workshop, 2009

Information flow security for service compositions.

[BibT_eX]

[DOI]

Damiano Macedonio

Proceedings of the International Conference on Ultra Modern Telecommunications, 2009

2008

A Theory of Adaptable Contract-Based Service Composition.

[BibT_eX]

[DOI]

Proceedings of the SYNASC 2008, 2008

PicNIc - Pi-calculus non-interference checker.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008

2007

Compositional information flow security for concurrent programs.

[BibT_eX]

[DOI]

J. Comput. Secur., 2007

Controlling information release in the pi-calculus.

[BibT_eX]

[DOI]

Silvia Crafa

Inf. Comput., 2007

Action Refinement in Process Algebra and Security Issues.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

Static vs Dynamic Typing for Access Control in Pi-Calculus.

[BibT_eX]

[DOI]

Damiano Macedonio

Proceedings of the Advances in Computer Science, 2007

2006

Information flow security in dynamic contexts.

[BibT_eX]

[DOI]

Riccardo Focardi

J. Comput. Secur., 2006

P-congruences as non-interference for the pi-calculus.

[BibT_eX]

[DOI]

Silvia Crafa

Proceedings of the 2006 ACM workshop on Formal methods in security engineering, 2006

2005

Non-interference proof techniques for the analysis of cryptographic protocols.

[BibT_eX]

[DOI]

J. Comput. Secur., 2005

Information flow in secure contexts.

[BibT_eX]

[DOI]

J. Comput. Secur., 2005

A Theory of Noninterference for the pi-Calculus.

[BibT_eX]

[DOI]

Silvia Crafa

Proceedings of the Trustworthy Global Computing, International Symposium, 2005

Bridging Language-Based and Process Calculi Security.

[BibT_eX]

[DOI]

Riccardo Focardi

Andrei Sabelfeld

Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004

Termination of simply moded logic programs with dynamic scheduling.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2004

Verifying persistent security properties.

[BibT_eX]

[DOI]

Comput. Lang. Syst. Struct., 2004

CoPS - Checker of Persistent Security.

[BibT_eX]

[DOI]

Enrico Pivato

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Unwinding Conditions for Security in Imperative Languages.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Declarative Semantics of Input Consuming Logic Programs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003

Unwinding in Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

Bisimulation and Unwinding for Verifying Possibilistic Security Properties.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2003

Refinement Operators and Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Information Flow Security and Recursive Systems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Context-Sensitive Equivalences for Non-interference Based Protocol Analysis.

[BibT_eX]

[DOI]

Ambra Ceccato

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Secure Contexts for Confidential Data.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

2002

Sequence-based abstract interpretation of Prolog.

[BibT_eX]

[DOI]

Pascal Van Hentenryck

Theory Pract. Log. Program., 2002

Properties of input-consuming derivations.

[BibT_eX]

[DOI]

Sandro Etalle

Theory Pract. Log. Program., 2002

On modular termination proofs of general logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2002

Proofs Methods for Bisimulation Based Information Flow Security.

[BibT_eX]

[DOI]

Riccardo Focardi

Proceedings of the Verification, 2002

A Proof System for Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Transforming Processes to Check and Ensure Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2002

2001

Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations.

[BibT_eX]

[DOI]

Agostino Cortesi

Proceedings of the Declarative Programming, 2001

Termination of Well-Typed Logic Programs.

[BibT_eX]

[DOI]

Nicoletta Cocco

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.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2001

Reexecution-Based Analysis of Logic Programs with Delay Declarations.

[BibT_eX]

[DOI]

Agostino Cortesi

Proceedings of the Perspectives of System Informatics, 2001

2000

Semantics of well-moded input-consuming logic programs.

[BibT_eX]

[DOI]

Sandro Etalle

Comput. Lang., 2000

Semantics of Input-Consuming Logic Programs.

[BibT_eX]

[DOI]

Sandro Etalle

Proceedings of the Computational Logic, 2000

1999

Automated Verification of Prolog Programs.

[BibT_eX]

[DOI]

J. Log. Program., 1999

1998

Specialising Logic Programs with Respect to Call?Post Specifications.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997

Automated Verification of Behavioural Properties of Prolog Programs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 1997

Automated Behavioural Verification of Prolog Programs.

[BibT_eX]

Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996

Specification-Based Automatic Verification of Prolog Programs.

[BibT_eX]

[DOI]

Agostino Cortesi

Proceedings of the Logic Programming Synthesis and Transformation, 1996

1995

Entending the FOLON Environment for Automatically Deriving Totally Correct Prolog Procedures from Logic Descriptions.

[BibT_eX]

Proceedings of the 7th Workshop on Logic Programming Environments, 1995

1994

An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut.

[BibT_eX]

Pascal Van Hentenryck

Proceedings of the Logic Programming, 1994

An Abstract Interpretation Framework for (almost) Full Prolog.

[BibT_eX]

Pascal Van Hentenryck

Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993

Static Analysis of Prolog with Cut.

[BibT_eX]

Gilberto Filé