Cardinality abstraction for declarative networking applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 584-598

  Pérez, Juan Antonio Navarro ^a   Rybalchenko, Andrey ^a   Singh, Atul ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION TECHNIQUES; APPLICATION DATA; BYZANTINE FAULT TOLERANCE; CARDINALITIES; DISTRIBUTED APPLICATIONS; DISTRIBUTED PROGRAMMING; MULTI-SETS; NETWORKING APPLICATIONS; NETWORKING COMMUNITY; PROGRAM STATE; RULE-BASED LANGUAGE; SAFETY PROPERTY; VARIABLE BINDING; VERIFICATION METHOD;

ABSTRACTING; COMPUTER AIDED ANALYSIS; FAULT TOLERANCE; QUALITY ASSURANCE;

NETWORK PROTOCOLS;

EID: 70350244861     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_43     Document Type: Conference Paper

References (43)

1. Arons, T., Pnueli, A., Ruah, S., Xu, J., Zuck, L.D.: Parameterized verification with automatically computed inductive assertions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 221. Springer, Heidelberg (2001)
2. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming (2008)
3. Balaban, I., Pnueli, A., Zuck, L.D.: Invisible safety of distributed protocols. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 528-539. Springer, Heidelberg (2006)
4. Ball, T., Rajamani, S.K.: The Slam project: Debugging system software via static analysis. In: POPL (2002)
5. Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker blast. STTT (2007)
6. Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: A static analyzer for large safety-critical software. In: PLDI (2003)
7. Bogudlov, I., Lev-Ami, T., Reps, T.W., Sagiv, M.: Revamping TVLA: Making parametric shape analysis competitive. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 221-225. Springer, Heidelberg (2007)
8. Braem, C., Charlier, B.L., Modart, S., van Hentenryck, P.: Cardinality analysis of Prolog. In: ILPS (1994)
9. Bruynooghe, M.: A practical framework for the abstract interpretation of logic programs. J. Log. Program. (1991)
10. Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance (1999)
11. Chu, D., Popa, L., Tavakoli, A., Hellerstein, J.M., Levis, P., Shenker, S., Stoica, I.: The design and implementation of a declarative sensor network system. In: SenSys (2007)
12. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
13. Colón, M., Sankaranarayanan, S., Sipma, H.: Linear invariant generation using non-linear constraint solving. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420-432. Springer, Heidelberg (2003)
14. Condie, T., Chu, D., Hellerstein, J.M., Maniatis, P.: Evita raced: metacompilation for declarative networks. In: PVLDB (2008)
15. Condie, T., Gay, D.E., Loo, B.T., et al.: P2: Declarative networking website (2008), http://p2.cs.berkeley.edu/
16. Cook, B., Podelski, A., Rybalchenko, A.: Terminator: Beyond safety. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 415-418. Springer, Heidelberg (2006)
17. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, ACM, New York (1977)
18. Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Log. Program. (1992)
19. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL (1978)
20. German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM (1992)
21. Gobert, F.: Towards Putting Abstract Interpretation of Prolog Into Practice. Ph.D thesis, Université catholique de Louvain (2007)
22. Graf, S., Saïdi, H.: Construction of abstract state graphs with pvs. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)
23. Gulwani, S., Lev-Ami, T., Sagiv, M.: A combination framework for tracking partition sizes. In: POPL (2009)
24. Hermenegildo, M.V., Puebla, G., Bueno, F., López-García, P.: Program development using abstract interpretation (and the Ciao system preprocessor). In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 127-152. Springer, Heidelberg (2003)
25. Killian, C., Anderson, J.W., Braud, R., Jhala, R., Vahadat, A.: Mace: Language support for building distributed systems. In: PLDI (2007)
26. Killian, C.E., Anderson, J.W., Jhala, R., Vahdat, A.: Life, death, and the critical transition: Finding liveness bugs in systems code. In: NSDI (2007)
27. Lalire, G., Argoud, M., Jeannet, B.: The interproc analyzer, http://pop-art.inrialpes.fr/people/bjeannet/bjeannet-forge/interproc/index.html
28. Lamport, L.: The Part-Time Parliament. ACM Transactions on Computer Systems (1998)
29. Loo, B.T., Condie, T., Garofalakis, M., Gay, D.E., Hellerstein, J.M., Maniatis, P., Ramakrishnan, R., Roscoe, T., Stoica, I.: Declarative networking: Language, execution and optimization. In: SIGMOD (2006)
30. Loo, B.T., Condie, T., Hellerstein, J.M., Maniatis, P., Roscoe, T., Stoica, I.: Implementing declarative overlays. In: SIGOPS (2005)
31. Miné, A.: The octagon abstract domain. Higher-Order and Symb. Comp. (2006)
32. Musuvathi, M., Engler, D.R.: Model checking large network protocol implementations. In: NSDI (2004)
33. Musuvathi, M., Park, D.Y.W., Chou, A., Engler, D.R., Dill, D.L.: CMC: A pragmatic approach to model checking real code. In: OSDI (2002)
34. Navarro, J.A., Rybalchenko, A.: Operational semantics for declarative networking. In: PADL (2009)
35. Pnueli, A., Ruah, S., Zuck, L.D.: Automatic deductive verification with invisible invariants. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, p. 82. Springer, Heidelberg (2001)
36. Pnueli, A., Xu, J., Zuck, L.D.: Liveness with (0, 1, infty)-counter abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 107. Springer, Heidelberg (2002)
37. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS (2002)
38. Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst. (2002)
39. Singh, A., Das, T., Maniatis, P., Druschel, P., Roscoe, T.: BFT protocols under fire. In: NSDI (2008)
40. Singh, A., Maniatis, P., Roscoe, T., Druschel, P.: Using queries for distributed monitoring and forensics. In: EuroSys, Leuven, Belgium (2006)
41. Wang, A., Basu, P., Loo, B.T., Sokolsky, O.: Declarative networking verification. In: PADL (2009)
42. Wood, T., Singh, R., Venkataramani, A., Shenoy, P.: ZZ: Cheap Practical BFT Using Virtualization. Technical Report TR14-08, University of Massachusetts (2008)
43. Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., O'Hearn, P.W.: Scalable shape analysis for systems code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 385-398. Springer, Heidelberg (2008)