Run your research: On the effectiveness of lightweight mechanization

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

Volumn , Issue , 2012, Pages 285-296

  Klein, Casey ^a   Clements, John ^b   Dimoulas, Christos ^c   Eastlund, Carl ^c   Felleisen, Matthias ^c   Flatt, Matthew ^d   McCarthy, Jay A ^e   Rafkind, Jon ^d   Tobin Hochstadt, Sam ^c   Findler, Robert Bruce ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

^b CALIFORNIA POLYTECHNIC STATE UNIVERSITY   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

^d UNIVERSITY OF UTAH   (United States)

^e BRIGHAM YOUNG UNIVERSITY   (United States)

Author keywords

Lightweight semantics engineering

Indexed keywords

DOMAIN SPECIFIC LANGUAGES; FORMAL MODEL; LANGUAGE DESIGN; LANGUAGE TOOLS; PROGRAM ANALYSIS; SEMANTIC MODEL; WORK-FLOWS;

COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; MECHANIZATION; PROBLEM ORIENTED LANGUAGES; SEMANTICS;

MACHINERY;

EID: 84857829551     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2103656.2103691     Document Type: Conference Paper

References (57)

1. Andrea Arcuri and Lionel C. Briand. A practical guide for using statistical tests to assess randomized algorithms in software engineering. In Proc. Intl. Conf. Soft. Eng., pp. 1-10, 2011.
2. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, GeoffreyWashburn, StephanieWeirich, and Steve Zdancewic. Mechanized metatheory for the masses: the POPLMark Challenge. In Proc. Intl. Conf. Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science volume 3603, pp. 50-65, 2005. (Pubitemid 41450137)
3. Chandrasekhar Boyapati, Sarfraz Khurshid, and Darko Marinov. Korat: automated testing based on Java predicates. In Proc. Intl. Symp. Soft. Testing and Analysis, pp. 123-133, 2002.
4. Avik Chaudhuri. A concurrent ML library in Concurrent Haskell. In Proc. ACM Intl. Conf. Functional Programming, pp. 269-280, 2009.
5. James Cheney and Alberto Momigliano. Mechanized metatheory modelchecking. In Proc. Intl. Conf. Principles and Practice of Declarative Programming, pp. 75-86, 2007.
6. James Cheney and Christian Urban. aProlog: a logic programming language with names, binding, and a-equivalence. In Proc. Intl. Conf. Logic Programming, Lecture Notes in Computer Science volume 3132, pp. 269-283, 2004.
7. Koen Claessen and John Hughes. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proc. ACM Intl. Conf. Functional Programming, pp. 268-279, 2000. (Pubitemid 32024728)
8. Manuel Clavel, Francisco Durán, Steven Eker, Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and Carolyn Talcott. Maude 2.0 system. In Proc. Intl. Conf. Rewriting Techniques and Applications, Lecture Notes in Computer Science volume 2706, pp. 76-87, 2003.
9. John Clements, Matthew Flatt, and Matthias Felleisen. Modeling an algebraic stepper. In Proc. Euro. Symp. Programming, pp. 320-334, 2001. (Pubitemid 33256367)
10. Thierry Despeyroux. Executable specification of static semantics. In Proc. Intl. Symp. Semantics of Data Types, Lecture Notes in Computer Science volume 173, pp. 215-233, 1984.
11. Thierry Despeyroux. Typol: a formalism to implement natural semantics. INRIA, Research Report No. 94, 1988.
12. Atze Dijkstra and S. Doaitse Swierstra. Ruler: programming Type rules. In Proc. Intl. Symp. Functional and Logic Programming, Lecture Notes in Computer Science volume 3945, pp. 30-46, 2006. (Pubitemid 44029258)
13. Matthew B. Dwyer, Suzette Person, and Sebastian G. Elbaum. Controlling factors in evaluating path-sensitive error detection techniques. In Proc. ACM Symp. Foundations of Soft. Eng., pp. 92-104, 2006. (Pubitemid 47129388)
14. Chucky Ellison and Grigore Rosu. An Executable Formal Semantics of C with Applications. University of Illinois, http://hdl.handle.net/2142/25816, 2011.
15. Matthias Felleisen, Robert Bruce Findler, and Matthew Flatt. Semantics Engineering with PLT Redex. MIT Press, 2010.
16. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Proc. ACM Intl. Conf. Functional Programming, pp. 237-247, 1993.
17. Matthew Flatt, Gang Yu, Robert Bruce Findler, and Matthias Felleisen. Adding delimited and composable control to a production programming environment. In Proc. ACM Intl. Conf. Functional Programming, pp. 165-176, 2007. (Pubitemid 351203757)
18. Anthony Fox. Formal specification and verification of ARM6. In Proc. Intl. Conf. Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science volume 2758, pp. 25-40, 2003.
19. Anthony Fox and Magnus O. Myreen. A trustworthy monadic formalization of the ARMv7 instruction set architecture. In Proc. Intl. Conf. Interactive Theorem Proving, Lecture Notes in Computer Science volume 6172, pp. 243-258, 2010.
20. Murdoch J. Gabbay and Andrew M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13(3-5), pp. 341-363, 2002. (Pubitemid 41204157)
21. Kenneth V. Hanford. Automatic generation of test cases. IBM Systems Journal 9(4), pp. 244-257, 1970.
22. David S. Hardin, Eric W. Smith, and William D. Young. A robust machine code proof framework for highly secure applications. In Proc. Intl. Wksp. ACL2 Theorem Prover and its Applications, pp. 11-20, 2006. (Pubitemid 47485569)
23. John Hughes. Generalizing monads to arrows. Science of Computer Programming 37(1-3), pp. 67-111, 2000.
24. Daniel Jackson. Alloy: a lightweight object modelling notation. ACM Trans. Software Enginering and Methodology 11(2), pp. 256-290, 2002. (Pubitemid 44159313)
25. Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent Haskell. In Proc. ACM Symp. Principles of Programming Languages, pp. 295-308, 1996.
26. Casey Klein and Robert Bruce Findler. Randomized testing in PLT Redex. In Proc. Scheme and Functional Programming, pp. 26-36, 2009.
27. Casey Klein, Matthew Flatt, and Robert Bruce Findler. The Racket virtual machine and randomized testing. 2010. http://plt.eecs.northwestern.edu/racket- machine/
28. Matthew R. Lakin. An Executable Meta-Language for Inductive Definitions with Binders. PhD dissertation, University of Cambridge, 2010.
29. Hai Liu, Eric Cheng, and Paul Hudak. Causal commutative arrows and their optimization. In Proc. ACM Intl. Conf. Functional Programming, pp. 35-46, 2009.
30. Hai Liu, Eric Cheng, and Paul Hudak. Causal commutative arrows. J. Functional Programming 21(4-5), pp. 467-496, 2011.
31. Jacob Matthews and Robert Bruce Findler. An operational semantics for R5RS Scheme. In Proc. Scheme and Functional Programming, pp. 157-165, 2005.
32. Jacob Matthews, Robert Bruce Findler, Matthew Flatt, and Matthias Felleisen. A visual environment for developing context-sensitive term rewriting systems. In Proc. Intl. Conf. Rewriting Techniques and Applications, Lecture Notes in Computer Science volume 3091, pp. 301-311, 2004. (Pubitemid 39742246)
33. Jay McCarthy. Automatically RESTful web applications: marking modular serializable continuations. In Proc. ACM Intl. Conf. Functional Programming, pp. 299-309, 2009.
34. Jan Midtgaard and Thomas P. Jensen. Control-flow analysis of function calls and returns by abstract interpretation. In Proc. ACM Intl. Conf. Functional Programming, pp. 287-298, 2009.
35. Jan Midtgaard and Thomas P. Jensen. Control-flow analysis of function calls and returns by abstract interpretation. Information and Computation, 2012. http://www.cs.au.dk/~jmi/ANF-CFA
36. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL-A Proof Assistant for Higher-Order Logic. Springer Verlag, 2011.
37. Ulf Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD dissertation, Chalmers University of Technology, 2007.
38. Greg Pettyjohn, John Clements, Joe Marshall, Shriram Krishnamurthi, and Matthias Felleisen. Continuations from generalized stack inspection. In Proc. ACM Intl. Conf. Functional Programming, pp. 216-227, 2005. (Pubitemid 43907047)
39. Frank Pfenning and Carsten Schürmann. System description: Twelf-a meta-logical framework for deductive systems. In Proc. Intl. Conf. Automated Deduction, pp. 202-206, 1999.
40. Gordon D. Plotkin. Call-by-name, call-by-value, and the l-calculus. Theoretical Computer Science 1(2), pp. 125-159, 1975.
41. François Pottier. An overview of Caml. In Proc. ACM SIGPLAN ML Wksp., Electronic Notes in Theoretical Computer Science volume 148, pp. 27-52, 2005.
42. John H. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
43. Tiark Rompf, Ingo Maier, and Martin Odersky. Implementing first-class polymorphic delimited continuations by a type-directed selective CPStransform. In Proc. ACM Intl. Conf. Functional Programming, pp. 317-328, 2009.
44. Grigore Rosu and Traian Florin Serbanuta. An Overview of the K Semantic Framework. J. Logic and Algebraic Programming 79(6), pp. 397-434, 2010.
45. Susmit Sarkar, Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Tom Ridge, Thomas Braibant, Magnus O. Myreen, and Jade Alglave. The semantics of x86-CC multiprocessor machine code. In Proc. ACM Symp. Principles of Programming Languages, pp. 379-391, 2009.
46. Tom Schrijvers, Simon Peyton Jones, Martin Sulzmann, and Dimitrios Vytiniotis. Complete and decidable type inference for GADTs. In Proc. ACM Intl. Conf. Functional Programming, pp. 341-352, 2009.
47. Neil Sculthorpe. Towards Safe and Efficient Functional Reactive Programming. Ph.D. dissertation, University of Nottingham, 2011.
48. Neil Sculthorpe and Henrik Nilsson. Safe functional reactive programming through dependent types. In Proc. ACM Intl. Conf. Functional Programming, pp. 23-34, 2009.
49. Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Gilles Peskine, Thomas Ridge, Susmit Sarkar, and Rok Strniša. Ott: effective tool support for the working semanticist. J. Functional Programming 20(1), pp. 71-122, 2010.
50. Konrad Slind and Michael Norrish. A brief overview of HOL4. In Proc. Intl. Conf. Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science volume 5170, pp. 28-32, 2008.
51. Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton van Straaten, Richard Kelsey, William Clinger, Jonathan Rees, Robert Bruce Findler, and Jacob Matthews. Revised [6] report on the algorithmic language Scheme. Cambridge University Press, 2007.
52. Nikhil Swamy, Michael Hicks, and Gavin M. Bierman. A Theory of typed coercions and its applications. In Proc. ACM Intl. Conf. Functional Programming, pp. 329-340, 2009.
53. Delphine Terrasse. Encoding natural semantics in Coq. In Proc. Intl. Conf. Algebraic Methodology and Software Technology, Lecture Notes in Computer Science volume 936, pp. 230-244, 1995.
54. The Coq Development Team. The Coq Proof Assistant Reference Manual. Version 8.3, 2010. http://coq.inria.fr/
55. Sam Tobin-Hochstadt and Matthias Felleisen. The design and implementation of Typed Scheme. In Proc. ACM Symp. Principles of Programming Languages, pp. 395-406, 2008.
56. Neal S. Young, John P.A. Ioannidis, and Omar Al-Ubaydli. Why Current Publication Practices May Distort Science. PLoS Med 5(10), pp. 1418-1422, 2008.
57. Lukasz Ziarek, KC Sivaramakrishnan, and Suresh Jagannathan. Partial memoization of concurrency and communication. In Proc. ACM Intl. Conf. Functional Programming, pp. 161-172, 2009.