Ranger: Parallel analysis of alloy models by range partitioning

2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings

Volumn , Issue , 2013, Pages 147-157

  Rosner, Nicolàs ^a   Siddiqui, Junaid H ^b   Aguirre, Nazareno ^c   Khurshid, Sarfraz ^d   Frias, Marcelo F ^e  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b LAHORE UNIVERSITY OF MANAGEMENT SCIENCES   (Pakistan)

^c DEPARTAMENTO DE QUÍMICA   (Argentina)

^d The University of Texas at Austin   (United States)

^e INSTITUTO TECNOLÓGICO DE BUENOS AIRES   (Argentina)

Author keywords

Alloy; Parallel analysis; SAT; Static analysis

Indexed keywords

ALLOY ANALYZERS; ALLOY LANGUAGES; ANALYSIS COSTS; EXPERIMENTAL EVALUATION; FIRST ORDER LOGIC; PARALLEL ANALYSIS; PROPOSITIONAL FORMULAS; SAT;

ALLOYING; SOFTWARE ENGINEERING; STATIC ANALYSIS;

ALLOYS;

EID: 84893525924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2013.6693075     Document Type: Conference Paper

References (40)

1. Abad P., Aguirre N., Bengolea V., Ciolek D., Frias M.F., Galeotti J., Maibaum T., Moscato M., Rosner N., Vissani I., Tight Bounds + Incremental SAT = Better Test Generation under Rich Contracts, in Proceedings of Sixth IEEE International Conference on Software Testing, Verification and Validation (ICST) 2013.
2. Abrial J. R.,. The B-Book: Assigning Programs to Meanings. Cambridge, UK, Cambridge University Press, 1996.
3. Alloy Analyzer, available at http://alloy.mit.edu/alloy/download.html.
4. Biere A., Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010, in Solver description, Special Track 1 (Parallel CNF), SAT-Race 2010, available at http://baldur.iti.uka.de/sat-race-2010/descriptions/solver-1+2+3+6.pdf.
5. Boyapati C., Khurshid S., Marinov D., Korat: automated testing based on Java predicates. ISSTA 2002: 123-133.
6. Cadar C., Dunbar D., and Engler D. R. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proc. 8th Symposium on Operating Systems Design and Implementation (OSDI), pages 209-224, 2008.
7. Chrabakh W., and Wolski R., GrADSAT: A Parallel SAT Solver for the Grid, in UCSB Computer Science Technical Report Number 2003-05.
8. Dennis, G., Chang, F., Jackson, D., Modular Verification of Code with SAT. in ISSTA'06, pp. 109-120, 2006.
9. Dijkstra E. W., A belated proof of self-stabilization, Distributed Computing, Vol. 1, Issue 1, pp.5-6, 1986.
10. Dolby J., Vaziri M., Tip F., Finding Bugs Efficiently with a SAT Solver, in ESEC/FSE'07, pp. 195-204, ACM Press, 2007.
11. Een N., and Sörensson N., An Extensible SAT-Solver. In SAT 2003.
12. Funes D., Siddiqui J. H., and Khurshid S. Ranged model checking. In Proc. Java PathFinder Workshop (JPF), 2012.
13. Galeotti J. P., Rosner N., López Pombo C., Frias M. F., Analysis of invariants for efficient bounded verification. In proceedings of ISSTA 2010, pp. 25-36, 2010.
14. Galeotti J. P., Rosner N., López Pombo C., Frias M. F., TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds. IEEE Transactions on Software Engineering, to appear.
15. Gil L., Flores P., and Silveira L. M., PMSat: a parallel version of MiniSAT, Journal on Satisfiability, Boolean Modeling and Computation 6 (2008) 71-98.
16. Hamadi Y., Jabbour S., and Sais L, ManySAT: a Parallel SAT Solver, International Journal on Satisfiability, Boolean Modeling and Computation (JSAT), Volume 6, Special Issue on Parallel SAT, IOS Press, 2009.
17. IEEE Standard for a High-Performance Serial Bus, available ar http://ieeexplore.ieee.org/servlet/opac?punumber=4659231
18. Jackson, D., Software Abstractions. MIT Press, 2006.
19. Kang E., Jackson D., Formal Modeling and Analysis of a Flash Filesystem in Alloy. in Proceedings of ABZ 2008, LNCS 5238, Springer, 294-308.
20. Kim J. S., and Garlan D., Analyzing Architectural Styles, Journal of Systems and Software, Vol. 83, Issue 7, Elsevier, 1216-1235.
21. Leavens G.T., Baker A.L., and Ruby C. JML: a notation for detailed design. In Behavioral Specifications of Businesses and Systems, Chapter 12, pp. 175-188, Amsterdam, Kluwer, 1999.
22. Leino K. R. M., Mülcer P., Using the Spec# Language, Methodology, and Tools to Write Bug-Free Programs, Manuscript KRML 189, 17 September 2009, Available at http://specsharp.codeplex.com/wikipage?title=Tutorial
23. Marinov D., and Khurshid S. TestEra: A Novel Framework for Automated Testing of Java Programs. In Proc. 16th IEEE Conference on Automated Software Engineering (ASE), 2001.
24. Misailovic S., Milicevic A., Petrovic N., Khurshid S., and Marinov D. Parallel Test Generation and Execution with Korat In Proc. 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE), 2007.
25. Maoz S., Ringert J.O., and Rumpe B. CD2Alloy: Class Diagrams Analysis Using Alloy Revisited. In Proceedings of MODELS 2011, LNCS 6981, Springer, 592-607.
26. Object Management Group. OCL Specification V. 2.3.1. January 1st, 2012. Available at http://www.omg.org/spec/OCL/2.3.1/PDF/.
27. Ohmura K., and Ueda K., c-sat: A Parallel SAT Solver for Clusters, in SAT 2009, LNCS 5585, 2009.
28. Rosner N., Galeotti J. P., Bermúdez S., Marucci Blas G., Perez De Rosso S., Pizzagalli L., Zemín L., and Frias M. F., Parallel Bounded Analysis in Code with Rich Invariants by Refinement of Field Bounds to appear in Proceedings of ISSTA 2013, pp. 23-33, 2013.
29. Rosner N., López Pombo C. G., Aguirre N., Jaoua A., Mili A., and Frias M. F., Parallel Bounded Verification of Alloy Models by TranScoping, in Proceedings of VSTTE 2013, to appear.
30. Shlyakhter I., Generating effective symmetry-breaking predicates for search problems. In Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, June 2001, Boston, MA. Henry Kautz and Bart Selman (eds.), Electronic Notes in Discrete Mathematics, Vol. 9, 2001.
31. Siddiqui J. H., and Khurshid S., PKorat: Parallel generation of structurally complex test inputs. 2nd International Conference on Software Testing, Verification, and Validation (ICST 2009). Denver, CO. Apr 2009.
32. Siddiqui J. H., and Khurshid S. Scaling symbolic execution using ranged analysis. In Proc. 27th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), 2012.
33. Shao D., Gopinath D., Khurshid S., Perry D. E., Optimizing Incremental Scope-Bounded Checking with Data-Flow Analysis. ISSRE 2010: 408-417.
34. Shao D., Khurshid S., Perry D. E., An Incremental Approach to Scope- Bounded Checking Using a Lightweight Formal Method. FM 2009: 757-772.
35. Spivey J. M., The Z Notation: A Reference Manual, 2nd ed. Upper Saddle River, NJ, Prentice Hall, 1992.
36. Stoica I., and Morris R., and Liben-Nowell D., Karge D., and Kaashoek M. F., and Balakrishnan H, Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, IEEE Transactions on Networking, vol. 11, 2003.
37. Torlak E., Jackson, D., Kodkod: A Relational Model Finder. in TACAS '07, LNCS 4425, pp. 632-647.
38. Visser W., Havelund K., Brat G., and Park S. Model checking programs. In Proc. 15th Conference on Automated Software Engineering (ASE), Grenoble, France, 2000.
39. Visser W., Pǎsǎreanu C. S., Pelánek R., Test Input Generation for Java Containers using State Matching, in ISSTA 2006, pp. 37-48, 2006.
40. Zave, P., Compositional binding in network domains. In Proceedings of FM 2006. LNCS 4085, Springer, 332-347.