Travelled to:
1 × Belgium
1 × Cyprus
1 × Japan
2 × Germany
2 × Portugal
2 × Spain
2 × The Netherlands
2 × USA
3 × Italy
3 × United Kingdom
Collaborated with:
A.Bossi M.Gabbrielli N.Cocco M.Czenko F.v.Raamsdonk R.Corin S.Rossi G.Delzanno J.Mountjoy F.Teusink E.Vriezekolk R.Wieringa A.Saptawijaya M.Bertolino C.Palamidessi E.Marchiori J.Smaus
Talks about:
program (13) logic (7) transform (6) semant (5) protocol (3) termin (3) system (3) secur (3) clp (3) constraint (2)
Person: Sandro Etalle
DBLP: Etalle:Sandro
Facilitated 2 volumes:
Contributed to:
Wrote 21 papers:
- REFSQ-2015-VriezekolkEW #assessment #risk management #validation
- Experimental Validation of a Risk Assessment Method (EV, SE, RW), pp. 1–16.
- LOPSTR-2009-CzenkoE #flexibility #using
- LP with Flexible Grouping and Aggregates Using Modes (MC, SE), pp. 67–81.
- ICLP-2007-CzenkoE #logic programming #trust
- Core TuLiP Logic Programming for Trust Management (MC, SE), pp. 380–394.
- ICLP-2005-CorinSE #analysis #constraints #protocol #security
- PS-LTL for Constraint-Based Security Protocol Analysis (RC, AS, SE), pp. 439–440.
- PDCL-2004-BossiCER #declarative #logic programming #semantics #source code
- Declarative Semantics of Input Consuming Logic Programs (AB, NC, SE, SR), pp. 90–114.
- SAS-2002-CorinE #constraints #protocol #security #verification
- An Improved Constraint-Based System for the Verification of Security Protocols (RC, SE), pp. 326–341.
- ESOP-2001-BossiERS #logic programming #scheduling #semantics #source code #termination
- Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (AB, SE, SR, JGS), pp. 402–416.
- LOPSTR-2001-DelzannoE #debugging #logic programming #protocol #proving #security
- Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols (GD, SE), pp. 76–90.
- CL-2000-BossiER #logic programming #semantics #source code
- Semantics of Input-Consuming Logic Programs (AB, SE, SR), pp. 194–208.
- LOPSTR-2000-EtalleM #functional #lazy evaluation #logic programming
- The lazy functional side of logic programming (SE, JM).
- ICLP-1999-EtalleR #logic programming
- Logic Programming with Requests (SE, FvR), pp. 558–572.
- LOPSTR-1999-BertolinoEP #source code
- The Replacement Operation for CCP Programs (MB, SE, CP), pp. 216–233.
- LOPSTR-1999-BossiCE #source code
- Transformation of Left Terminating Programs (AB, NC, SE), pp. 156–175.
- JICSLP-1998-EtalleR
- Beyond Success and Failure (SE, FvR), pp. 190–205.
- PEPM-1997-EtalleGM #scheduling
- A Transformation System for CLP with Dynamic Scheduling and CCP (SE, MG, EM), pp. 137–150.
- JICSLP-1996-EtalleT #composition #semantics #source code
- A Compositional Semantics for Normal Open Programs (SE, FT), pp. 468–482.
- ICLP-1995-EtalleG #composition #source code
- A Transformation System for Modular CLP Programs (SE, MG), pp. 681–695.
- LOPSTR-1995-BossiCE #order #problem #source code
- Transformation of Left Terminating Programs: the Reordering Problem (AB, NC, SE), pp. 33–45.
- PEPM-1995-EtalleG
- The Replacement Operation for CLP Modules (SE, MG), pp. 168–177.
- LOPSTR-1994-BossiE #semantics #source code
- More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting’s Semantics (AB, SE), pp. 311–331.
- PLILP-1992-BossiCE #on the
- On Safe Folding (AB, NC, SE), pp. 172–186.