Travelled to:1 × France
1 × Germany
1 × India
1 × Italy
1 × Poland
1 × Serbia
1 × Spain
2 × Australia
2 × USA
4 × United Kingdom
Collaborated with:S.Ghilardi R.Bruttomesso A.Armando F.Alberti E.Nicolini D.Zucchelli C.G.Zarba D.Déharbe N.Sharygina A.T.Truong L.Viganò M.Rusinowitch L.Compagna M.P.Bonacina M.Bozzano A.Cimatti T.A.Junttila P.v.Rossum R.Sebastiani
Talks about:theori (6) procedur (4) decis (4) base (4) interpol (3) system (3) rewrit (3) modulo (3) model (3) array (3)
Person: Silvio Ranise
DBLP: Ranise:Silvio
Contributed to:
2015
2012
2012
2012
2011
20112010200820072006
200620052003
20012001Wrote 15 papers:
- SAC-2015-RaniseTV #analysis #automation #constraints #policy
- Automated analysis of RBAC policies with temporal constraints and static role hierarchies (SR, ATT, LV), pp. 2177–2184.
- CAV-2012-AlbertiBGRS #abstraction #array #named #smt
- SAFARI: SMT-Based Abstraction for Arrays with Interpolants (FA, RB, SG, SR, NS), pp. 679–685.
- IJCAR-2012-BruttomessoGR #composition #quantifier
- From Strong Amalgamability to Modularity of Quantifier-Free Interpolation (RB, SG, SR), pp. 118–133.
- SMT-2012-AlbertiBGRS #library #modulo theories #reachability
- Reachability Modulo Theory Library (FA, RB, SG, SR, NS), pp. 67–76.
- CADE-2011-AlbertiAR #analysis #automation #named #policy #security
- ASASP: Automated Symbolic Analysis of Security Policies (FA, AA, SR), pp. 26–33.
- RTA-2011-BruttomessoGR #array #formal method #quantifier
- Rewriting-based Quantifier-free Interpolation for a Theory of Arrays (RB, SG, SR), pp. 171–186.
- IJCAR-2010-GhilardiR #model checking #modulo theories #named
- MCMT: A Model Checker Modulo Theories (SG, SR), pp. 22–29.
- IJCAR-2008-GhilardiNRZ #model checking #smt #towards
- Towards SMT Model Checking of Array-Based Systems (SG, EN, SR, DZ), pp. 67–82.
- CADE-2007-GhilardiNRZ #infinity #model checking #satisfiability
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (SG, EN, SR, DZ), pp. 362–378.
- IJCAR-2006-BonacinaGNRZ #decidability
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures (MPB, SG, EN, SR, DZ), pp. 513–527.
- SEFM-2006-RaniseZ #formal method
- A Theory of Singly-Linked Lists and its Extensible Decision Procedure (SR, CGZ), pp. 206–215.
- CAV-2005-BozzanoBCJRRS #modulo theories #performance #satisfiability
- Efficient Satisfiability Modulo Theories via Delayed Theory Combination (MB, RB, AC, TAJ, SR, PvR, RS), pp. 335–349.
- SEFM-2003-DeharbeR #debugging #proving #theorem proving #verification
- Light-Weight Theorem Proving for Debugging and Verifying Units of Code (DD, SR), pp. 220–228.
- CSL-2001-ArmandoRR
- Uniform Derivation of Decision Procedures by Superposition (AA, SR, MR), pp. 513–527.
- IJCAR-2001-ArmandoCR
- System Description: RDL : Rewrite and Decision Procedure Laboratory (AA, LC, SR), pp. 663–669.