Vincoli e preferenze come formalismo unificante per l'analisi di sistemi informatici e la soluzione di problemi reali
Progetto MIUR PRIN 2005 n.2005-015491
A. Dal Palù, J. He, E. Pontelli, and Y. Lu.
A Constraint Logic
Programming approach to associate 1D and 3D structural components
for large protein complexes. International Journal of Data Mining
and Bioinformatics, 1(4), 352-371, 2007.
R. Gentilini, C. Piazza, and A. Policriti.
Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica 50(1):120-158, 2008.
V. Goranko, A. Montanari, P. Sala,
and G. Sciavicco.
A General Tableau Method for Propositional Interval Temporal Logics:
Theory and Implementation
Journal of Applied Logic 4(3):305-330, 2006
(Book Chapter)
Fioravanti F., A. Pettorossi, M. Pproietti.
Automatic Proofs of Protocols via Program Transformation. In:
Monitoring, Security, and Rescue Techniques in Multiagent Systems.
Springer-Verlag-Series: Advances in Soft Computing Dunin-Keplicz, B.;
Jankowski, A.; Skowron, A.; Szczuka, M. (Eds.) 99-116 , 2005.
Gabbrielli M, Meo M.C. A compositional Semantics for CHR. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. ISSN: 1529-3785. in press.
A. Dovier, E. Quintarelli
Applying Model-Checking to solve Queries on Semistructured Data
Computer Languages, Systems & Structures. In Press.
A. Bossi, C. Piazza, S. Rossi
Compositional information flow security for concurrent programs.
Journal of Computer Security, 15(3): 373-416 (2007)
Convegni e Workshop Internazionali
L. Bortolussi. Stochastic Concurrent Constaint Programming. 4th
Int'l Workshop of Quantitative Aspects of Programming Languages,
Wien, 2006.
L. Bortolussi, A. Policriti. Connecting Process Algebras and
Differential Equations for Systems Biology. PASTA 2006, London,
2006.
L. Bortolussi, A. Policriti. Modeling Biological Systems in
Stochastic Concurrent Constraint Programming. WCB06, Nantes, 2006.
A. Bossi, C. Piazza and S. Rossi.
Action Refinement in Process Algebra and Security Issues.
International Symposium on Logic-Based Program Synthesis and
Transformation (LOPSTR'07).
Bresolin D., Goranko V., Montanari A., Sciavicco G., "On
Decidability and Expressiveness of Propositional Interval
Neighborhood Logics". Proceedings of the Symposium on Logical
Foundations of Computer Science (LFCS), LNCS 4514, Springer, New
York, USA, June 2007, pp. 84-99.
D. Bresolin, V. Goranko, A. Montanari, P. Sala (2007). Tableau-based decision procedure for the
logic of proper subinterval structures over dense orderings. In C.
Areces and S. Demri, editors, Proc. of the 5th Int. Workshop on
Methods for Modalities (M4M), pages 335-351, 2007.
Bresolin D., Montanari A., "A Tableau-based Decision Procedure
for Right Propositional Neighborhood Logic". Proceedings of the
International Conference TABLEAUX 2005, Automated Reasoning with
Analytic Tableaux and Related Methods, LNAI 3702, Springer, Koblenz,
Germany, September 2005, pp. 63-77.
Bresolin D., Montanari A., Sala P., "An optimal tableau-based
decision algorithm for Propositional Neighborhood Logic".
Proceedings of the 24th International Symposium on Theoretical
Aspects of Computer Science (STACS), LNCS 4393, Springer, Aachen,
Germany, February 2007, pp. 549-560.
Bresolin D., Goranko V., Montanari A., Sala P., "Tableau Systems
for Logics of Subinterval Structures over Dense Orderings".
Proceedings of the International Conference TABLEAUX 2007, Automated
Reasoning with Analytic Tableaux and Related Methods, LNAI,
Springer, Aix en Provence, France, July 2007.
A. Casagrande, P. Corvaja, C. Piazza, and B. Mishra.
Synchronized Product of Semi-Algebraic O-Minimal Hybrid Automata.
In A. Bemporad, A. Bicchi, and G. Buttazzo eds., Proc. of Hybrid
Systems: Computation and Control (HSCC'07), pages 668--671, vol. 4416,
LNCS, Springer-Verlag, Berlin, 2007.
A. Casagrande, K. Casey, R. Falchi, C. Piazza, B. Ruperti, G.
Vizzotto, and B. Mishra. Translating Time-course Gene Expression
Profiles into Semi-Algebraic Hybrid Automata via Dimensionality Reduction.
In Proc. of Algebraic Biology (AB'07), LNCS 4545 pages 51--65, vol. 4545,
LNCS, Springer-Verlag, Berlin, 2007.
Raffaele Cipriano, Luca Di Gaspero, and Agostino Dovier. Hybrid
Approaches for Rostering: a Case Study in the Integration of
Constraint Programming and Local Search. HM 2006 International
Workshop on Hybrid Metaheuristics. Gran Canaria, 13-15 October 2006.
LNCS 4030, pp. 110-123, 2006.
D'Agostino G., Montanari A., Policriti A., "Extensions of S1S and
the Composition Method". Proceedings of JM'06: 11th Mons Days of
Theoretical Computer Science, Irisa - Rennes, France,
August-September 2006, pp. 165-178.
Dal Lago U., Montanari A., Puppis G., "On the Equivalence of
Automaton-based Representations of Time Granularities". Proceedings
of TIME 2007: 14th International Symposium on Temporal
Representation and Reasoning (TIME), IEEE Computer Society Press,
Alicante, Spain, June 2007.
A. Dal Palù, A. Dovier, E. Pontelli. A New Constraint Solver for
3D Lattices and Its Application to the Protein Folding Problem In
Geoff Sutcliffe, Andrei Voronkov eds, Proc of Logic for Programming,
Artificial Intelligence, and Reasoning: 12th International
Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005.
LNCS Volume 3835 / 2005, pp 48-63.
A. Dal Palù, A. Dovier, E. Pontelli. Enhancing the Computation of
Approximate Solutions of the Protein Structure Determination In
Computational Structural Bioinformatics Workshop, Silicon Valley,
USA, Nov 2--4, 2007 (IEEE)
A.Dal Palù, Enrico Pontelli, Jing He, Yonggang Lu.
A Constraint Logic Programming Approach to 3D Structure Determination of
Large Protein Complexes.
In proceedings of Symposium on Applied Computing (SAC) 2006, April 23-27
Dijon, Bourgogne, France.
Alessandro Dal Palù , Agostino Dovier, and Enrico Pontelli.
Global Constraints for Discrete Lattices
Proceedings of WCB06: Workshop on Constraint Based Methods for Bioinformatics
(associated to CP 2006), Nantes, France, September 2006, pp.55-68.
Alessandro Dal Palù , Agostino Dovier, and Enrico Pontelli.
The Density Constraint.
Proceedings of WCB07: Workshop on
Constraint Based Methods for Bioinformatics (associated to ICLP 2007), Porto, Portugal,
September 2006, pp. 10-19.
De Maria E., Montanari A., Zantoni M., "An automaton-based
approach to the verification of timed workfow schemas". Proceedings
of TIME 2006: 13th International Symposium on Temporal
Representation and Reasoning (TIME), IEEE Computer Society Press,
Budapest, Hungary, June 2006, pp. 87-94.
De Maria E., Montanari A., Zantoni M., "Checking workflow schemas
with time constraints using timed automata (extended abstract)".
Proceedings of OTM Workshops 2005, LNCS 3762, Springer, Agia Napa,
Cyprus, November 2005, pp. 1-2.
De Maria E., Dovier A., Montanari A., and Piazza C.,
"Exploiting Model Checking in Constraint-based Approaches to the Protein Folding."
Proceedings of WCB06: Workshop on Constraint Based Methods for Bioinformatics
(associated to CP 2006), Nantes, France, September 2006, pp.46-54.
De Maria E., Zantoni M., Dovier A., and Policriti A.,
"Module identification using biological constraint." Proceedings of WCB07: Workshop on
Constraint Based Methods for Bioinformatics (associated to ICLP 2007), Porto, Portugal,
September 2006, pp.20-29.
A. Dovier, A. Formisano, E. Pontelli. A comparison of CLP(FD)
and ASP solutions to NP-complete problems. In M. Gabbrielli and G.
gupta eds., Proc of ICLP 2005. LNCS 3668, pp. 67-82. Sitges,
barcelona, October 2005.
A. Dovier, A. Formisano, E. Pontelli. An
Experimental Comparison of Constraint Logic Programming and Answer
Set Programming. AAAI-07 Nectar Paper Tracks at the Twenty-Second
AAAI Conference on Artificial Intelligence (AAAI-07),
July 22-26 in Vancouver, British Columbia, Canada.
A. Dovier, A. Formisano, E. Pontelli. Multivalued
Action Languages with Constraints in CLP(FD) (Draft) In Proc. of
ICLP 2007, LNCS 4670, pp 255-270, Porto, September 2007.
M. Farenzena, A. Fusiello, and A. Dovier. Reconstruction with
Interval Constraints Propagation In Proc. of IEEE Computer Society
Conference on Computer Vision and Pattern Recognition New York, NY:
June 17-22, 2006.
Montanari A., "Propositional Interval Temporal Logics: Some
Promising Paths". Proceedings of TIME 2005: 12th International
Symposium on Temporal Representation and Reasoning (TIME), IEEE
Computer Society Press, Burlington, Vermont, USA, June 2005, pp.
201-203.
Montanari A., Puppis G., "A Contraction Method to Decide MSO
Theories of Deterministic Trees". Proceedings of the 22nd Symposium
on Logic in Computer Science (LICS), IEEE Computer Society Press,
Wroclaw, Poland, July 2007.
Montanari A., Policriti A., Vitacolonna N., "An algorithmic
account of winning strategies in Ehrenfeucht games on labelled
successor structures". Proceedings of the 12th International
Conference on Logic for Programming, Artificial Intelligence and
Reasoning (LPAR 2005), LNAI 3835, Springer, Montego Bay, Jamaica,
December 2005, pp.139-153.
Tacchella P, Gabbrielli G, Meo M.C..
Unfolding in CHR. In: Proceedings of the 9th International
ACM SIGPLAN Conference on Principles and Practice of Declarative Programming. PPDP 2007. Wroclaw, Poland.. July 14-16, 2007. (pp. 179-186). ISBN/ISSN: 978-1-59593-769-8.
Gabbrielli M, Meo M.C., Tacchella P.
A compositional Semantics for CHR with propagation rules.
In: PROC. OF THIRD WORKSHOP ON CONSTRAINT HANDLING RULES (CHR 2006). (pp. 93-107).
Delzanno G, Gabbrielli M, Meo M.C.
A compositional semantics for CHR.
In: PPDP 2005. (pp. 209-217).
S. Bistarelli, P. Peretti, I. Trubitsyna.
Analyzing security scenarios using Defence Trees and Answer Set Programming.
In: 3rd International Workshop on Security and Trust Management. Dresden, Germany, 27 September 2007. Short paper.
S. Bistarelli, P. Peretti, I. Trubitsyna.
Answer Set Optimization for and/or composition of CP-nets: a security scenario.
In: 13th International Conference on Principles and Practice of Constraint Programming. Providence, RI, USA, 23-27 September 2007. Short paper.
S. Bistarelli, F. Fioravanti, P. Peretti.
Using CP-nets as a guide for countermeasure selection .
In: 22nd ACM Symposium on Applied Computing (SAC2007), Track on Computer Security (6th edition). Seoul, South Korea, 11-15 March 2007.
G. Bella, S. Bistarelli, P. Peretti, S. Riccobene.
Augmented Risk Analysis.
In Proc. 2nd International Workshop on Views on Designing Complex Architectures (VODCA 2006), Bertinoro, Italy, 16-17 September 2006. Volume 168, pages 207-220. Electronic Notes in Theoretical Computer Science, 2006.
S. Bistarelli, M. Dall'Aglio, P. Peretti.
Strategic game on defence trees.
In: 4th International Workshop on Formal Aspects in Security and Trust (FAST2006). Hamilton, (ON) Canada, 26-27 August 2006.
S. Bistarelli, F. Fioravanti, P. Peretti.
Defense trees for economic evaluation of security investments
In: 1st International Conference on Availability, Reliability and Security (ARES 2006). Vienna, 20-22 Aprile 2006.
Bistarelli S, Gabbrielli M, Meo M.C, Santini F.
Timed Soft Concurrent Constraint Programs.
Doctoral Program - CP2007. Providence RI, USA. (pp. 151-156). Informal Proceedings of CP2007 Doctoral Program.
Bistarelli S, Montanari U, Rossi F, Santini F.
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming.
In: Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages (QAPL 2007). Quantitative Aspects of Programming Languages 2007. Braga, Portugal. 24-25 March 2007. (vol. Volume 190, Issue 3, pp. 111-127). : Elsevier.
Bistarelli S, Montanari U, Rossi F, Santini F.
Modelling Multicast QoS routing by Using Best-Tree Search in AND-OR Graphs and Soft Constraint Logic Programming.
In: Informal Proceedings, Workshop on Preferences and Soft Constraints. Workshop on Preferences and Soft Constraints - CP206. Nantes, France. (pp. 17-31). Informal Proceedings.
E. De Maria, A. Montanari, M. Zantoni
An automaton-based approach to the verification of timed workflow schemas.
In Proc. of TIME 2006: 13th International Symposium on Temporal Representation and Reasoning (TIME), IEEE Computer Society Press, pp. 87-94.Budapest, Hungary, June 2006.
M. Gavanelli and M. Milano
Cost-based filtering for determining the pareto frontier.
In Ulrich Junker and Werner Kießling, editors, Multidisciplinary Workshop on Advances in Preference Handling, August 2006, Riva del Garda, Italy, in conjunction with ECAI 2006, August 2006
M. S. Pini, F. Rossi, K. B. Venable
Uncertainty in bipolar preference problems
In Proceedings of the 8th International Workshop on Preferences and Soft Constraints, Nantes, France, September 2006.
J. Lang, M. S. Pini, F. Rossi, K. B. Venable and T. Walsh
Winner determination in sequential majority voting.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), AAAI Press, Hyderabad, India, January 2007.
M. S. Pini, F. Rossi, K. B. Venable and T. Walsh
Incompleteness and incomparability in preference aggregation.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), AAAI Press, Hyderabad, India, January 2007.
S. N. Foley, W. Fitzgerald, S. Bistarelli, B. O'Sullivan and M. Ò Foghlù
Enhancing constraints manipulation in semiring-based formalisms
In Proc. IPOM 2006, 6th IEEE International Workshop on IP Operations and Management
Dublin, Ireland, October 2006 - held as part of Manweek 2006.
Parosh Aziz Abdulla and Giorgio Delzanno
On the Coverability Problem for Constrained Multiset Rewriting
In Proceedings of the Fifth International Workshop on Automated Verification of Infinite-State Systems (AVIS'06) Co-located with ETAPS
2006.
Vienna, Austria, April 2006. To appear in Electronic Notes in Theoretical Computer Science.
Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, and Ahmed Rezine
Regular Model Checking without Transducers (On Efficient Verification of Parameterized Systems)
To appear in the Proceedings of the 13th International Conference on Tools and Algorithms for the Constructions and Analysis of Systems, a member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS 2007)
Braga, Portugal, March 2007. Lecture Notes in Computer Science.
Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine
Parameterized Verification of Infinite-state Processes with Global Conditions.
Submitted to the 19th International Conference on Computer Aided Verification, CAV 2007.
Technical Report University of Uppsala, January 2007.
Giorgio Delzanno, Javier Esparza, Jirí Srba
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.
In Proc. of the 4th international symposium on Automated Technology for Verification and Analysis (ATVA 2006)
Beijing, China October 2006. Lecture Notes in Computer Science 4218, pag. 415-429.
Giorgio Delzanno and Roberto Montagna
Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting.
In Proc. of the 3rd Third International Colloquium on Theoretical Aspects of Computing - ICTAC 2006
Tunis, Tunisia, November 2006. Lecture Notes in Computer Science 4281, pag. 302-316.
Giorgio Delzanno and Roberto Montagna
On the Reachability Problem for Fragments of Mobile Ambients with Name Restriction.
In Proc. of the 8th International Workshop on Verification of Infinite-State Systems Infinity 2006, a Satellite Workshop of CONCUR 2006.
Bonn, Germany, August 2006. To appear in Electronic Notes in Theoretical Computer Science.
Giorgio Delzanno and Roberto Montagna
On Reachability and Spatial Reachability for Fragments of BioAmbients.
In Proc. of the 1st workshop on Membrane Computing and Biologically Inspired Process Calculi, MecBIC 2006, A satellite event of ICALP 2006.
S. Servolo, Venice, Italy, July 2006. Electr. Notes Theor. Comput. Sci. 171(2): 69-79 (2007)
Giorgio Delzanno, Sandro Etalle, Maurizio Gabbrielli
Introduction to the Special Issue on Specification Analysis and Verification of Reactive Systems.
TPLP 6(3): 225-226 (2006).
Giorgio Delzanno
Constraint-based Automatic Verification of Abstract Models of Multitreaded Programs
Theory and Practice of Logic Programming 7 (1&2): 67-91 (2007)
Noomene Ben Henda, Ahmed Rezine, Parosh Abdulla and Giorgio Delzanno
Handling Parameterized Systems with Non-Atomic Global Conditions
Proc. VMCAI'08, Verification, Model Checking and Abstract Interpretation
Interpretation, San Francisco, 2008.
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin
Comparing the
Expressive Power of Well-Structured Transition Systems.
In Proc. CSL 2007: 99-114
Giorgio Delzanno, Laurent Van Begin
On the Dynamics of PB Systems
with Volatile Membranes.
Proc. Workshop on Membrane Computing WMC 07: 240-256
Alessandro Armando, Massimo Benerecetti, Dario Carotenuto, Jacopo
Mantovani, Pasquale Spica
The eureka tool for software model checking.
ASE 2007: 541-542, 2007
Alessandro Armando, Massimo Benerecetti, Jacopo Mantovani
Abstraction Refinement of Linear Programs with Arrays.
TACAS 2007: 373-388, 2006
Alessandro Armando, Jacopo Mantovani, Lorenzo Platania
Bounded Model Checking of Software Using SMT Solvers Instead of SAT
Solvers.
SPIN 2006: 146-162, 2006
Alessandro Armando, Massimo Benerecetti, Jacopo Mantovani
Model Checking Linear Programs with Arrays
Electr. Notes Theor. Comput. Sci. 144(3): 79-94 (2006)
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
A Complete
Abstract Interpretation Framework for Coverability Properties of WSTS.
VMCAI 2006: 49-64
Pierre Ganty, Jean-François Raskin, Laurent Van Begin
From Many
Places to Few: Automatic Abstraction Refinement for Petri Nets.
ICATPN 2007: 124-143
Patrick Cousot, Pierre Ganty, Jean-François Raskin
Fixpoint-Guided
Abstraction Refinements.
SAS 2007: 333-348
Convegni italiani
D. Bresolin, A. Montanari, and P. Sala.
A tableau for right propositional neighborhood logic over trees.
In: Proceedings of CILC 2007: Convegno Italiano di Logica Computazionale, Messina, 21-22 goiugno 2007.
R. Cipriano, L. Di Gaspero, and A. Dovier
Hybrid Approaches for Rostering:
A Case Study in the Integration of Constraint Programming and Local Search.
In RCRA2006 Udine, 23 Giugno 2006.
A. Dovier, A. Formisano, and E. Pontelli.
Planning with Action Languages: Perspectives using CLP(FD) and ASP
CILC 2006: Convegno Italiano di Logica Computazionale. 26-27 giugno 2006, Bari.
A. Dovier, A. Formisano, and E. Pontelli.
Multivalued Action Languages with Constraints in CLP(FD) CILC 2007:
Convegno Italiano di Logica Computazionale, Messina, 21-22 Giugno 2007.
G. Rossi, F. Bergenti, E. Panegai.
A Master-Slave Architecture
to Integrate Sets and Finite Domains in Java. CILC06: Convegno
Italiano di Logica Computazionale, Bari, 2006.
Fioravanti F., A. Pettorossi, M. Proietti. Verifying
Infinite State Systems by Specializing Constraint Logic Programs.
Rapporto tecnico n. 657 Febbraio 2007 dell'Istituto di delle Ricerche.