Programming with angelic nondeterminism

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 339-351

  Bodik, Rastislav ^a   Chandra, Satish ^a   Galenson, Joel ^b   Kimelman, Doug ^a   Tung, Nicholas ^b   Barman, Shaon ^a   Rodarmor, Casey ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Angelic non determinism; Bounded model checking; Constraints; Refinement; Traces

Indexed keywords

ANGELIC NONDETERMINISM; BACKTRACKING ALGORITHM; BOUNDED MODEL; BOUNDED MODEL CHECKING; DETERMINISTIC PROGRAMS; IMPLEMENTATION STRATEGIES; MODULARIZATIONS; NON-DETERMINISM; PROGRAM DEVELOPMENT; REFINEMENT CALCULI; REGULAR EXPRESSIONS;

COMPUTER SOFTWARE; LINGUISTICS; MATHEMATICAL OPERATORS; MODULAR CONSTRUCTION; OBJECT ORIENTED PROGRAMMING; SPECIFICATIONS;

MODEL CHECKING;

EID: 77950901612     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706339     Document Type: Conference Paper

References (20)

1. J.-R. Abrial. The B Book: Assigning Programs to Meanings. Cambridge Un. Press, Aug. 1996.
2. J.-R. Abrial. Event based sequential program development: Application to constructing a pointer program. In FME, pages 51-74, 2003.
3. R.-J. Back and J. von Wright. Contracts, games, and refinement. Inf. Comput, 156(1-2):25-45, 2000.
4. O. Celiku and J. von Wright. Implementing angelic nondeterminism. In APSEC, pages 176-185. IEEE Computer Society, 2003.
5. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
6. E. W. Dijkstra. A Discipline of Programming. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997.
7. R. W. Floyd. Nondeterministic algorithms. Journal of the ACM, 14(4):636-644, oct 1967.
8. M. F. Frias, C. G. López Pombo, G. A. Baum, N. M. Aguirre, and T. S. E. Maibaum. Reasoning about static and dynamic properties in alloy: A purely relational approach. ACM Trans. Softw. Eng. Methodol., 14(4):478-526, 2005.
9. T. A. Lau, P. Domingos, and D. S. Weld. Learning programs from traces using version space algebra. In K-CAP, pages 36-43, 2003.
10. C. L. McMaster. An analysis of algorithms for the dutch national flag problem. Commun. ACM, 21(10):842-846, 1978.
11. C. Morgan. Programming from Specifications. 1998.
12. C. Morgan and T. Vickers, editors. On the Refinement Calculus. Springer-Verlag, London, 1992.
13. M. Odersky and al. An overview of the scala programming language. Technical Report IC/2004/64, EPFL Lausanne, Switzerland, 2004.
14. M. O. Rabin and D. S. Scott. Finite automata and their decision problems. IBM J. Res. and Develop, 3:114-125, 1959.
15. H. Schorr andW.Waite. An efficient machine independent procedure for garbage collection in various list structures. Communications of the ACM, 10(8):501-506, Aug. 1967.
16. G. Smith and J. Derrick. Abstract specification in object-Z and CSP. In C. George and H. Miao, editors, Formal Methods and Software Engineering, volume 2495 of Lecture Notes in Computer Science, pages 108-119. Springer, Nov. 2002.
17. A. Solar-Lezama, G. Arnold, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Sketching stencils. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, pages 167-178, New York, NY, USA, 2007. ACM.
18. A. Solar-Lezama, L. Tancau, R. Bodik, S. Seshia, and V. Saraswat. Combinatorial sketching for finite programs. SIGPLAN Not., 41(11):404-415, 2006.
19. J. M. Spivey. Understanding Z: a specification language and its formal semantics. Cambridge Un. Press, New York, NY, USA, 1988.
20. N. Ward and I. J. Hayes. Applications of angelic nondeterminism. In P. A. Bailes, editor, Proc. 6th Australian Software Engineering Conference (ASWEC91), pages 391-404. Australian Computer Society, JUL 1991.