References

  1. P. A. Abdulla (2010): Forcing Monotonicity in Parameterized Verification: From Multisets to Words. In: Proceedings of SOFSEM '10. Springer-Verlag, pp. 1–15, doi:10.1007/978-3-642-11266-9_1.
  2. P. A. Abdulla, K. Cerans, B. Jonsson & Y.-K. Tsay (1996): General Decidability Theorems for Infinite-State Systems. In: Proc. of LICS, pp. 313–321, doi:10.1109/LICS.1996.561359.
  3. P. A. Abdulla, N. B. Henda, G. Delzanno & A. Rezine (2008): Handling Parameterized Systems with Non-atomic Global Conditions. In: Proc. of VMCAI, LNCS 4905, pp. 22–36, doi:10.1007/978-3-540-78163-9_7.
  4. P. A. Abdulla & B. Jonsson (1993): Verifying Programs with Unreliable Channels. In: LICS, pp. 160–170, doi:10.1109/LICS.1993.287591.
  5. P. A. Abdulla & A. Nylén (2001): Timed Petri nets and BQOs. In: ICATPN, pp. 53–70, doi:10.1007/3-540-45740-2_5.
  6. P.A. Abdulla, M. Atto, J. Cederberg & R. Ji (2009): Automatic Verification of Dynamic Data-Dependent Programs. In: ATVA, LNCS, doi:10.1007/978-3-642-04761-9_16.
  7. P.A. Abdulla, A. Bouajjani, J. Cederberg, F. Haziza & A. Rezine (2008): Monotonic Abstraction for Programs with Dynamic Memory Heaps. In: CAV, pp. 341–354, doi:10.1007/978-3-540-70545-1_33.
  8. P.A. Abdulla, G. Delzanno, N.B. Henda & A. Rezine (2007): Regular Model Checking Without Transducers. In: TACAS, LNCS 4424, pp. 721–736, doi:10.1007/978-3-540-71209-1_56.
  9. P.A. Abdulla, G. Delzanno & A. Rezine (2007): Parameterized Verification of Infinite-State Processes with Global Conditions. In: CAV, LNCS, pp. 145–157, doi:10.1007/978-3-540-73368-3_17.
  10. P.A. Abdulla, G. Delzanno & A. Rezine (2008): Monotonic Abstraction in Parameterized Verification. In: RP, ENTCS.
  11. F. Alberti, A. Armando & S. Ranise (2011): ASASP: Automated Symbolic Analysis of Security Policies. In: CADE, pp. 26–33, doi:10.1007/978-3-642-22438-6_4.
  12. F. Alberti, A. Armando & S. Ranise (2011): Efficient symbolic automated analysis of administrative attribute-based RBAC-policies. In: ASIACCS, pp. 165–175, doi:10.1145/1966913.1966935.
  13. F. Alberti, R. Bruttomesso, S. Ghilardi, S. Ranise & N. Sharygina (2012): Lazy Abstraction with Interpolants for Arrays. In: LPAR, pp. 46–61, doi:10.1007/978-3-642-28717-6_7.
  14. F. Alberti, R. Bruttomesso, S. Ghilardi, S. Ranise & N. Sharygina (2012): SAFARI: SMT-Based Abstraction for Arrays with Interpolants. In: CAV, doi:10.1007/978-3-642-31424-7_49.
  15. F. Alberti, R. Bruttomesso, S. Ghilardi, S. Ranise & N. Sharygina (2014): An extension of Lazy Abstraction with Interpolation for programs with arrays. Formal Methods in System Design 45(1), pp. 63–109, doi:10.1007/s10703-014-0209-9.
  16. F. Alberti, S. Ghilardi, E. Pagani, S. Ranise & G. P. Rossi (2010): Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study. In: DISC, pp. 392–394, doi:10.1007/978-3-642-15763-9_36.
  17. F. Alberti, S. Ghilardi, E. Pagani, S. Ranise & G.P. Rossi (2012): Universal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories. JSAT 8(1/2), pp. 29–61.
  18. F. Alberti, S. Ghilardi & N. Sharygina (2013): Definability of Accelerated Relations in a Theory of Arrays and Its Applications. In: FroCoS, pp. 23–39, doi:10.1007/978-3-642-40885-4_3.
  19. F. Alberti, S. Ghilardi & N. Sharygina (2014): Decision Procedures for Flat Array Properties. In: TACAS, pp. 15–30, doi:10.1007/978-3-642-54862-8_2.
  20. F. Alberti, S. Ghilardi & N. Sharygina (2014): A framework for the verification of parameterized infinite-state systems. In: CILC. CEUR.
  21. M. Bozga, C. Girlea & R. Iosif (2009): Iterating octagons. In: TACAS, LNCS, pp. 337–351, doi:10.1007/978-3-642-00768-2_29.
  22. M. Bozga, R. Iosif & F. Konecny (2010): Fast Acceleration of Ultimately Periodic Relations. In: CAV, LNCS, doi:10.1007/978-3-642-14295-6_23.
  23. M. Bozga, R. Iosif & Y. Lakhnech (2009): Flat parametric counter automata. Fundamenta Informaticae 91, pp. 275–303, doi:10.3233/FI-2009-0044.
  24. A.R. Bradley & Z. Manna (2007): Calculus of computation: decision procedures with applications to verification. Springer, doi:10.1007/978-3-540-74113-8.
  25. A.R. Bradley, Z. Manna & H.B. Sipma (2006): What's Decidable About Arrays?. In: VMCAI, pp. 427–442, doi:10.1007/11609773_28.
  26. R. Bruttomesso, A. Carioni, S. Ghilardi & S. Ranise (2012): Automated Analysis of Parametric Timing-Based Mutual Exclusion Algorithms. In: NASA Formal Methods, pp. 279–294, doi:10.1007/978-3-642-28891-3_28.
  27. H. Comon & Y. Jurski (1998): Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. In: CAV, LNCS 1427. Springer, pp. 268–279, doi:10.1007/BFb0028751.
  28. S. Conchon, A. Goel, S. Krstić, A. Mebsout & F. Zaïdi (2012): Cubicle: a Parallel SMT-based Model-Checker fro Parameterized Systems. In: Proc. of CAV, LNCS, doi:10.1007/978-3-642-31424-7_55.
  29. S. Conchon, A. Goel, S. Krstić, A. Mebsout & F. Zaïdi (2013): Invariants for Finite Instances and Beyond. In: Proc. of FMCAD.
  30. G. Delzanno (2000): Automatic verification of parameterized cache coherence protocols. In: Proc. of CAV, LNCS 1855, doi:10.1007/10722167_8.
  31. E.A. Emerson & K.S. Namjoshi (1998): On model checking for non-deterministic infinite-state systems. In: LICS, pp. 70–80, doi:10.1109/LICS.1998.705644.
  32. J. Esparza, A. Finkel & R. Mayr (1999): On the Verification of Broadcast Protocols. In: Proc. of LICS. IEEE Computer Society, pp. 352–359, doi:10.1109/LICS.1999.782630.
  33. A. Finkel & J. Leroux (2002): How to compose Presburger-accelerations: Applications to broadcast protocols. In: FST TCS ’02. Springer, pp. 145–156, doi:10.1007/3-540-36206-1_14.
  34. S. Ghilardi, E. Nicolini, S. Ranise & D. Zucchelli (2008): Towards SMT Model Checking of Array-Based Systems. In: IJCAR, pp. 67–82, doi:10.1007/978-3-540-71070-7_6.
  35. S. Ghilardi & S. Ranise (2010): Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis. LMCS 6(4), doi:10.2168/LMCS-6(4:10)2010.
  36. R. Jhala & K.L. McMillan (2007): Array Abstractions from Proofs. In: CAV, pp. 193–206, doi:10.1007/978-3-540-73368-3_23.
  37. Nancy A. Lynch (1996): Distributed Algorithms. Morgan Kaufmann.
  38. K.L. McMillan (2006): Lazy Abstraction with Interpolants. In: CAV, pp. 123–136, doi:10.1007/11817963_14.
  39. S. Toueg & T. D. Chandra (1990): Time and Message Efficient Reliable Broadcast. In: Proc. 4th Int. Workshop on Distributed Algorithms, LNCS, pp. 289––303, doi:10.1007/3-540-54099-7_20.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org