default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSabina Rossi
Person information
- affiliation: University Ca' Foscari, Venice, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[e2]Arnaud Devos
, András Horváth, Sabina Rossi:
Analytical and Stochastic Modelling Techniques and Applications - 28th International Conference, ASMTA 2024, Venice, Italy, June 14, 2024, Proceedings. Lecture Notes in Computer Science 14826, Springer 2025, ISBN 978-3-031-70752-0 [contents]- 2024
- [j41]Carla Piazza, Sabina Rossi, Daria Smuseva:
Efficient Algorithm for Proportional Lumpability and Its Application to Selfish Mining in Public Blockchains. Algorithms 17(4): 159 (2024) - [j40]Dalila Ressi, Riccardo Romanello, Carla Piazza, Sabina Rossi:
AI-enhanced blockchain technology: A review of advancements and opportunities. J. Netw. Comput. Appl. 225: 103858 (2024) - [j39]Dalila Ressi, Riccardo Romanello, Sabina Rossi, Carla Piazza:
Compressing neural networks via formal methods. Neural Networks 178: 106411 (2024) - [j38]Ivan Malakhov, Andrea Marin, Sabina Rossi, Daniel Sadoc Menasché:
Confirmed or Dropped? Reliability Analysis of Transactions in PoW Blockchains. IEEE Trans. Netw. Sci. Eng. 11(4): 3276-3288 (2024) - [j37]Diletta Olliaro, Giuliano Casale, Andrea Marin, Sabina Rossi:
A Product-form Network for Systems with Job Stealing Policies. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(2): 6:1-6:26 (2024) - [c82]Samia Guesmi, Carla Piazza, Sabina Rossi:
Noninterference Analysis for Smart Contracts: Would you Bet on it? DLT 2024 - [i8]Massimo Bartoletti, Lorenzo Benetollo, Michele Bugliesi, Silvia Crafa, Giacomo Dal Sasso, Roberto Pettinau, Andrea Pinna, Mattia Piras, Sabina Rossi, Stefano Salis, Alvise Spanò, Viacheslav Tkachenko, Roberto Tonelli, Roberto Zunino:
Smart Contract Languages: a comparative analysis. CoRR abs/2404.04129 (2024) - [i7]Dalila Ressi, Alvise Spanò, Lorenzo Benetollo, Carla Piazza, Michele Bugliesi, Sabina Rossi:
Vulnerability Detection in Ethereum Smart Contracts via Machine Learning: A Qualitative Analysis. CoRR abs/2407.18639 (2024) - 2023
- [j36]Ivan Malakhov, Andrea Marin, Sabina Rossi:
Analysis of the confirmation time in proof-of-work blockchains. Future Gener. Comput. Syst. 147: 275-291 (2023) - [j35]Andrea Marin, Sabina Rossi, Diletta Olliaro:
A product-form network for systems with job stealing policies. SIGMETRICS Perform. Evaluation Rev. 50(4): 2-4 (2023) - [c81]Lorenzo Benetollo, Michele Bugliesi, Silvia Crafa, Sabina Rossi, Alvise Spanò:
ALGOMOVE - A Move Embedding for Algorand. Blockchain 2023: 62-67 - [c80]Daria Smuseva, Ivan Malakhov, Andrea Marin, Sabina Rossi:
Crisis of Trust: Analyzing the Verifier's Dilemma in Ethereum's Proof-of-Stake Blockchain. Blockchain 2023: 332-339 - [c79]Marco Bernardo, Sabina Rossi:
Reverse Bisimilarity vs. Forward Bisimilarity. FoSSaCS 2023: 265-284 - [c78]Marco Bernardo, Ivan Lanese, Andrea Marin, Claudio Antares Mezzina, Sabina Rossi, Claudio Sacerdoti Coen:
Causal Reversibility Implies Time Reversibility. QEST 2023: 270-287 - [c77]Daria Smuseva, Andrea Marin, Sabina Rossi:
Selfish Mining in Public Blockchains: A Quantitative Analysis. VALUETOOLS 2023: 18-32 - [i6]Andrea Esposito, Alessandro Aldini, Marco Bernardo, Sabina Rossi:
Noninterference Analysis of Reversible Systems: An Approach Based on Branching Bisimilarity. CoRR abs/2311.15670 (2023) - 2022
- [j34]Ivan Malakhov, Andrea Marin, Sabina Rossi, Daria Smuseva:
On the Use of Proof-of-Work in Permissioned Blockchains: Security and Fairness. IEEE Access 10: 1305-1316 (2022) - [j33]Andrea Marin, Carla Piazza, Sabina Rossi:
Proportional lumpability and proportional bisimilarity. Acta Informatica 59(2-3): 211-244 (2022) - [c76]Dalila Ressi, Riccardo Romanello, Carla Piazza, Sabina Rossi:
Neural Networks Reduction via Lumping. AI*IA 2022: 75-90 - [c75]Daria Smuseva, Ivan Malakhov, Andrea Marin, Aad van Moorsel, Sabina Rossi:
Verifier's Dilemma in Ethereum Blockchain: A Quantitative Analysis. QEST 2022: 317-336 - [i5]Dalila Ressi, Riccardo Romanello, Sabina Rossi, Carla Piazza:
Neural Networks Reduction via Lumping. CoRR abs/2209.07475 (2022) - 2021
- [j32]Jane Hillston, Andrea Marin, Carla Piazza, Sabina Rossi:
Persistent Stochastic Non-Interference. Fundam. Informaticae 181(1): 1-35 (2021) - [j31]Andrea Marin, Carla Piazza, Sabina Rossi:
D_PSNI: Delimited persistent stochastic non-interference. Theor. Comput. Sci. 884: 116-135 (2021) - [c74]Ivan Malakhov, Carlo Gaetan, Andrea Marin, Sabina Rossi:
Workload Prediction in BTC Blockchain and Application to the Confirmation Time Estimation. EPEW 2021: 3-21 - [c73]Carla Piazza, Sabina Rossi:
Reasoning About Proportional Lumpability. QEST 2021: 372-390 - 2020
- [j30]Andrea Marin, Sabina Rossi, Carlo Zen:
Size-based scheduling for TCP flows: Implementation and performance evaluation. Comput. Networks 183: 107574 (2020) - [j29]Andrea Marin, Giuliano Casale, Dorina C. Petriu, Sabina Rossi:
Guest editor's forewords: Special issue on Valuetools 2017. Perform. Evaluation 137 (2020) - [j28]B. Maryam Elahi, Andrea Marin, Sabina Rossi, Carey Williamson:
Frequency scaling in multilevel queues. Perform. Evaluation 143: 102140 (2020) - [j27]B. Maryam Elahi, Andrea Marin, Sabina Rossi, Carey Williamson:
Frequency scaling in multilevel queues. SIGMETRICS Perform. Evaluation Rev. 48(3): 97-98 (2020) - [j26]Andrea Marin, Sabina Rossi, Matteo Sottana:
Dynamic Resource Allocation in Fork-Join Queues. ACM Trans. Model. Perform. Evaluation Comput. Syst. 5(1): 3:1-3:28 (2020) - [c72]Ivan Malakhov, Andrea Marin, Sabina Rossi, Daria Smuseva:
Fair Work Distribution on Permissioned Blockchains: a Mobile Window Based Approach. Blockchain 2020: 436-441 - [c71]Andrea Marin, Sabina Rossi, Carlo Zen:
A Matlab Toolkit for the Analysis of Two-Level Processor Sharing Queues. QEST 2020: 144-147 - [c70]Andrea Marin, Sabina Rossi, Carey Williamson:
Speed scaling in fork-join queues: a comparative study. VALUETOOLS 2020: 80-87
2010 – 2019
- 2019
- [j25]Armir Bujari, Andrea Marin, Claudio E. Palazzi, Sabina Rossi:
Smart-RED: A Novel Congestion Control Mechanism for High Throughput and Low Queuing Delay. Wirel. Commun. Mob. Comput. 2019: 6941248:1-6941248:10 (2019) - [c69]Andrea Marin, Carla Piazza, Sabina Rossi:
A Process Algebra for (Delimited) Persistent Stochastic Non-Interference. CILC 2019 - [c68]Andrea Marin, Sabina Rossi:
A Queueing Model that Works Only on the Biggest Jobs. EPEW 2019: 118-132 - [c67]Andrea Marin, Carla Piazza, Sabina Rossi:
Proportional Lumpability. FORMATS 2019: 265-281 - [c66]Andrea Marin, Sabina Rossi, Matteo Sottana, Carlo Zen:
Theoretical and Experimental Evaluation of the Two-Level Processor Sharing Discipline for TCP Flows. MASCOTS 2019: 94-106 - [c65]Andrea Marin, Carla Piazza, Sabina Rossi:
A Process Algebra for (Delimited) Persistent Stochastic Non-Interference. QEST 2019: 222-238 - [c64]Jane Hillston, Andrea Marin, Carla Piazza, Sabina Rossi:
Delimited Persistent Stochastic Non-Interference. VALUETOOLS 2019: 135-142 - 2018
- [j24]Giacomo Alzetta, Andrea Marin, Carla Piazza, Sabina Rossi:
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses. Inf. Comput. 260: 99-125 (2018) - [j23]Andrea Marin, Sabina Rossi, Dario Burato, Andrea Sina, Matteo Sottana:
A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs. ACM Trans. Model. Comput. Simul. 28(2): 13:1-13:23 (2018) - [c63]Jane Hillston, Andrea Marin, Carla Piazza, Sabina Rossi:
Information Flow Security for Stochastic Processes. EPEW 2018: 142-156 - [c62]Andrea Marin, Sabina Rossi, Matteo Sottana:
Biased Processor Sharing in Fork-Join Queues. QEST 2018: 273-288 - [c61]Jane Hillston, Carla Piazza, Sabina Rossi:
Persistent Stochastic Non-Interference. EXPRESS/SOS 2018: 53-68 - 2017
- [j22]Andrea Marin, Sabina Rossi:
On the relations between Markov chain lumpability and reversibility. Acta Informatica 54(5): 447-485 (2017) - [j21]Andrea Marin, Sabina Rossi:
Fair workload distribution for multi-server systems with pulling strategies. Perform. Evaluation 113: 26-41 (2017) - [j20]Andrea Marin, Sabina Rossi:
Power control in saturated fork-join queueing systems. Perform. Evaluation 116: 101-118 (2017) - [c60]Andrea Marin, Sabina Rossi:
Aggregation and Truncation of Reversible Markov Chains Modulo State Renaming. ASMTA 2017: 152-165 - [e1]Andrea Marin, Benny Van Houdt, Giuliano Casale, Dorina C. Petriu, Sabina Rossi:
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2017, Venice, Italy, December 05-07, 2017. ACM 2017 [contents] - 2016
- [j19]Armir Bujari, Andrea Marin, Claudio E. Palazzi, Sabina Rossi:
Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic. Comput. Networks 108: 160-170 (2016) - [j18]Andrea Marin, Sabina Rossi:
Priority-based bandwidth allocation in wireless sensor networks. EAI Endorsed Trans. Wirel. Spectr. 2(10): e3 (2016) - [j17]Lucia Gallina, Andrea Marin, Sabina Rossi:
Connectivity and energy-aware preorders for mobile ad-hoc networks. Telecommun. Syst. 63(2): 307-333 (2016) - [c59]Simonetta Balsamo, Filippo Cavallin, Andrea Marin, Sabina Rossi:
Applying Reversibility Theory for the Performance Evaluation of Reversible Computations. ASMTA 2016: 45-59 - [c58]Andrea Marin, Sabina Rossi, Armir Bujari, Claudio E. Palazzi:
Performance evaluation of AQM techniques with heterogeneous traffic. CCNC 2016: 194-199 - [c57]Filippo Cavallin, Andrea Marin, Sabina Rossi:
Product-Forms for Probabilistic Input/Output Automata. MASCOTS 2016: 361-366 - [c56]Andrea Marin, Sabina Rossi:
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations. QEST 2016: 123-138 - [c55]Sabina Rossi, Andrea Marin:
Fair workload distribution for multi-server systems with pulling strategies. VALUETOOLS 2016 - 2015
- [j16]Sabina Rossi, Andrea Marin:
On Discrete Time Reversibility modulo State Renaming and its Applications. EAI Endorsed Trans. Self Adapt. Syst. 1(3): e2 (2015) - [c54]Andrea Marin, Sabina Rossi:
Quantitative Analysis of Concurrent Reversible Computations. FORMATS 2015: 206-221 - [c53]Filippo Cavallin, Andrea Marin, Sabina Rossi:
A Product-Form Model for the Analysis of Systems with Aging Objects. MASCOTS 2015: 136-145 - [c52]Andrea Marin, Sabina Rossi:
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses. QEST 2015: 160-175 - 2014
- [j15]Michele Bugliesi, Lucia Gallina, Sardaouna Hamadou, Andrea Marin, Sabina Rossi:
Behavioural equivalences and interference metrics for mobile ad-hoc networks. Perform. Evaluation 73: 41-72 (2014) - [j14]Michele Bugliesi, Andrea Marin, Sabina Rossi:
Model checking adaptive service compositions. Sci. Comput. Program. 94: 289-306 (2014) - [c51]Andrea Marin, Sabina Rossi:
On the Relations between Lumpability and Reversibility. MASCOTS 2014: 427-432 - [c50]Sabina Rossi, Andrea Marin:
On Discrete Time Reversibility modulo State Renaming and its Applications. VALUETOOLS 2014 - 2013
- [j13]Lucia Gallina, Sabina Rossi:
A process calculus for energy-aware multicast communications of mobile ad hoc networks. Wirel. Commun. Mob. Comput. 13(3): 296-312 (2013) - [c49]Gian-Luca Dei Rossi, Lucia Gallina, Sabina Rossi:
Performance Analysis and Formal Verification of Cognitive Wireless Networks. EPEW 2013: 236-250 - [c48]Andrea Marin, Sabina Rossi:
Autoreversibility: Exploiting Symmetries in Markov Chains. MASCOTS 2013: 151-160 - [c47]Lucia Gallina, Andrea Marin, Sabina Rossi, Tingting Han, Marta Z. Kwiatkowska:
A process algebraic framework for estimating the energy consumption in ad-hoc wireless sensor networks. MSWiM 2013: 255-262 - [c46]Jane Hillston, Andrea Marin, Sabina Rossi, Carla Piazza:
Contextual lumpability. VALUETOOLS 2013: 194-203 - 2012
- [c45]Lucia Gallina, Gian-Luca Dei Rossi, Andrea Marin, Sabina Rossi:
Evaluating resistance to jamming and casual interception in mobile wireless networks. MSWiM 2012: 151-158 - [c44]Michele Bugliesi, Lucia Gallina, Andrea Marin, Sabina Rossi, Sardaouna Hamadou:
Interference-Sensitive Preorders for MANETs. QEST 2012: 189-198 - [c43]Lucia Gallina, Tingting Han, Marta Z. Kwiatkowska, Andrea Marin, Sabina Rossi, Alvise Spanò:
Automatic energy-aware performance analysis of Mobile Ad-Hoc Networks. Wireless Days 2012: 1-6 - 2011
- [c42]Lucia Gallina, Sardaouna Hamadou, Andrea Marin, Sabina Rossi:
A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks. ASMTA 2011: 316-330 - [c41]Lucia Gallina, Sardaouna Hamadou, Andrea Marin, Sabina Rossi:
A framework for throughput and energy efficiency in mobile ad hoc networks. Wireless Days 2011: 1-6 - 2010
- [c40]Sabina Rossi:
Model Checking Adaptive Multilevel Service Compositions. FACS 2010: 106-124 - [c39]Lucia Gallina, Sabina Rossi:
A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks. IFIP TCS 2010: 20-31 - [c38]Lucia Gallina, Sabina Rossi:
Sender- and receiver-centered interference in wireless ad hoc networks. Wireless Days 2010: 1-5
2000 – 2009
- 2009
- [c37]Sabina Rossi, Damiano Macedonio:
Information flow security for service compositions. ICUMT 2009: 1-8 - [c36]Michele Bugliesi, Damiano Macedonio, Luca Pino, Sabina Rossi:
Compliance Preorders for Web Services. WS-FM 2009: 76-91 - 2008
- [c35]Silvia Crafa, Matteo Mio, Marino Miculan, Carla Piazza, Sabina Rossi:
PicNIc - Pi-calculus non-interference checker. ACSD 2008: 33-38 - [c34]Giovanni Bernardi, Michele Bugliesi, Damiano Macedonio, Sabina Rossi:
A Theory of Adaptable Contract-Based Service Composition. SYNASC 2008: 327-334 - 2007
- [j12]Silvia Crafa, Sabina Rossi:
Controlling information release in the pi-calculus. Inf. Comput. 205(8): 1235-1273 (2007) - [j11]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Compositional information flow security for concurrent programs. J. Comput. Secur. 15(3): 373-416 (2007) - [c33]Michele Bugliesi, Damiano Macedonio, Sabina Rossi:
Static vs Dynamic Typing for Access Control in Pi-Calculus. ASIAN 2007: 282-296 - [c32]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Action Refinement in Process Algebra and Security Issues. LOPSTR 2007: 201-217 - 2006
- [j10]Riccardo Focardi, Sabina Rossi:
Information flow security in dynamic contexts. J. Comput. Secur. 14(1): 65-110 (2006) - [c31]Silvia Crafa, Sabina Rossi:
P-congruences as non-interference for the pi-calculus. FMSE 2006: 13-22 - 2005
- [j9]Michele Bugliesi, Sabina Rossi:
Non-interference proof techniques for the analysis of cryptographic protocols. J. Comput. Secur. 13(1): 87-113 (2005) - [j8]Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Information flow in secure contexts. J. Comput. Secur. 13(3): 391-422 (2005) - [c30]Riccardo Focardi, Sabina Rossi, Andrei Sabelfeld:
Bridging Language-Based and Process Calculi Security. FoSSaCS 2005: 299-315 - [c29]Silvia Crafa, Sabina Rossi:
A Theory of Noninterference for the pi-Calculus. TGC 2005: 2-18 - 2004
- [j7]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Verifying persistent security properties. Comput. Lang. Syst. Struct. 30(3-4): 231-258 (2004) - [j6]Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
Termination of simply moded logic programs with dynamic scheduling. ACM Trans. Comput. Log. 5(3): 470-507 (2004) - [c28]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Modelling Downgrading in Information Flow Security. CSFW 2004: 187- - [c27]Annalisa Bossi, Carla Piazza, Sabina Rossi:
Unwinding Conditions for Security in Imperative Languages. LOPSTR 2004: 85-100 - [c26]Carla Piazza, Enrico Pivato, Sabina Rossi:
CoPS - Checker of Persistent Security. TACAS 2004: 144-152 - [p1]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
Declarative Semantics of Input Consuming Logic Programs. Program Development in Computational Logic 2004: 90-114 - 2003
- [c25]Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Secure Contexts for Confidential Data. CSFW 2003: 14-28 - [c24]Michele Bugliesi, Ambra Ceccato, Sabina Rossi:
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis. FCT 2003: 364-375 - [c23]Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Information Flow Security and Recursive Systems. ICTCS 2003: 369-382 - [c22]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Refinement Operators and Information Flow Security. SEFM 2003: 44-53 - [c21]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Bisimulation and Unwinding for Verifying Possibilistic Security Properties. VMCAI 2003: 223-237 - [c20]Annalisa Bossi, Riccardo Focardi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Unwinding in Information Flow Security. MEFISTO 2003: 127-154 - 2002
- [j5]Baudouin Le Charlier, Sabina Rossi, Pascal Van Hentenryck:
Sequence-based abstract interpretation of Prolog. Theory Pract. Log. Program. 2(1): 25-84 (2002) - [j4]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of input-consuming derivations. Theory Pract. Log. Program. 2(2): 125-154 (2002) - [j3]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
On modular termination proofs of general logic programs. Theory Pract. Log. Program. 2(3): 263-291 (2002) - [c19]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
Transforming Processes to Check and Ensure Information Flow Security. AMAST 2002: 271-286 - [c18]Riccardo Focardi, Sabina Rossi:
Information Flow Security in Dynamic Contexts. CSFW 2002: 307-319 - [c17]Annalisa Bossi, Riccardo Focardi, Carla Piazza, Sabina Rossi:
A Proof System for Information Flow Security. LOPSTR 2002: 199-218 - [c16]Riccardo Focardi, Carla Piazza, Sabina Rossi:
Proofs Methods for Bisimulation Based Information Flow Security. VMCAI 2002: 16-31 - 2001
- [c15]Agostino Cortesi, Baudouin Le Charlier, Sabina Rossi:
Reexecution-Based Analysis of Logic Programs with Delay Declarations. Ershov Memorial Conference 2001: 395-405 - [c14]Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. ESOP 2001: 402-416 - [c13]Annalisa Bossi, Nicoletta Cocco, Sabina Rossi:
Termination of Well-Typed Logic Programs. PPDP 2001: 73-81 - [c12]Agostino Cortesi, Sabina Rossi, Baudouin Le Charlier:
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations. APPIA-GULP-PRODE 2001: 29-44 - [i4]Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling. CoRR cs.LO/0101022 (2001) - [i3]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of Input-Consuming Derivations. CoRR cs.PL/0101023 (2001) - 2000
- [j2]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Semantics of well-moded input-consuming logic programs. Comput. Lang. 26(1): 1-25 (2000) - [c11]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Semantics of Input-Consuming Logic Programs. Computational Logic 2000: 194-208 - [i2]Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
On Modular Termination Proofs of General Logic Programs. CoRR cs.LO/0005018 (2000) - [i1]Baudouin Le Charlier, Sabina Rossi, Pascal Van Hentenryck:
Sequence-Based Abstract Interpretation of Prolog. CoRR cs.LO/0010028 (2000)
1990 – 1999
- 1999
- [j1]Baudouin Le Charlier, Christophe Leclère, Sabina Rossi, Agostino Cortesi:
Automated Verification of Prolog Programs. J. Log. Program. 39(1-3): 3-42 (1999) - [c10]Annalisa Bossi, Sandro Etalle, Sabina Rossi:
Properties of Input-Consuming Derivations. Verification of Logic Programs@ICLP 1999: 102-124 - 1998
- [c9]Annalisa Bossi, Sabina Rossi:
Specialising Logic Programs with Respect to Call?Post Specifications. LOPSTR 1998: 159-178 - 1997
- [c8]Baudouin Le Charlier, Christophe Leclère, Sabina Rossi, Agostino Cortesi:
Automated Behavioural Verification of Prolog Programs. APPIA-GULP-PRODE 1997: 189-200 - [c7]Baudouin Le Charlier, Christophe Leclère, Sabina Rossi, Agostino Cortesi:
Automated Verification of Behavioural Properties of Prolog Programs. ASIAN 1997: 225-238 - 1996
- [c6]Agostino Cortesi, Baudouin Le Charlier, Sabina Rossi:
Specification-Based Automatic Verification of Prolog Programs. LOPSTR 1996: 38-57 - 1995
- [c5]Baudouin Le Charlier, Sabina Rossi:
Entending the FOLON Environment for Automatically Deriving Totally Correct Prolog Procedures from Logic Descriptions. LPE 1995 - 1994
- [c4]Baudouin Le Charlier, Sabina Rossi, Pascal Van Hentenryck:
An Abstract Interpretation Framework for (almost) Full Prolog. GULP-PRODE (1) 1994: 92-106 - [c3]Baudouin Le Charlier, Sabina Rossi, Pascal Van Hentenryck:
An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut. ILPS 1994: 157-171 - 1993
- [c2]Gilberto Filé, Sabina Rossi:
Static Analysis of Prolog with Cut. GULP 1993: 325-340 - [c1]Gilberto Filé, Sabina Rossi:
Static Analysis of Prolog with Cut. LPAR 1993: 134-145
Coauthor Index
[j38] [j37] [j36] [j35] [c80] [c78] [c77] [j34] [j33] [c75] [j32] [j31] [c74] [j30] [j29] [j28] [j27] [j26] [c72] [c71] [c70] [j25] [c69] [c68] [c67] [c66] [c65] [c64] [j24] [j23] [c63] [c62] [j22] [j21] [j20] [c60] [e1] [j19] [j18] [j17] [c59] [c58] [c57] [c56] [c55] [j16] [c54] [c53] [c52] [j15] [j14] [c51] [c50] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
