**From:** Jordan Dimov (*jdimov@cis.clarion.edu*)

**Date:** Fri Apr 27 2001 - 15:38:59 MDT

**Next message:**Samantha Atkins: "Re: Extreme programming"**Previous message:**Jordan Dimov: "RE: Computational reflection"**Maybe in reply to:**Mitchell Porter: "Computational reflection"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

I thought Pattie's article was pretty cool. Here's what ACM's DL search

engine came up with when I did a search for articles related to ``Concepts

and Experiments in Computational Reflection''. Let me know in private if

you need anything.

1) The correct definition of finite elasticity: corrigendum to identification of unions; Tatsuya Motoki, Takeshi Shinohara and Keith Wright; Proceedings of the fourth annual workshop on Computational learning theory, 1991, Page 375 [ Find Related Articles ] 100

2) Dynamic sets and their application in VDM; Shaoying Liu and John A. McDermid; Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice–1993, 1993, Pages 187 - 192 [ Find Related Articles ] 100

3) Language learning in dependence on the space of hypotheses; Steffen Lange and Thomas Zeugmann; Proceedings of the sixth annual ACM conference on Computational learning theory, 1993, Pages 127 - 136 [ Find Related Articles ] 100

4) Constructing queries from tokens; Amihai Motro; Proceedings of the conference on Management of data, 1986, Pages 120 - 131 [ Find Related Articles ] 100

5) The representation of recursive languages and its impact on the efficiency of learning; Steffen Lange; Proceedings of the seventh annual ACM conference on Computational learning theory, 1994, Pages 256 - 267 [ Find Related Articles ] 100

6) Generative networkload models for a single server environment; S. V. Raghavan, D. Vasukiammaiyar and Gunter Haring; Proceedings of the 1994 conference on Measurement and modeling of computer systems, 1994, Pages 118 - 127 [ Find Related Articles ] 100

7) Approximating grammar probabilities: solution of a conjecture; R. Chaudhuri and A. N. V. Rao; J. ACM 33, 4 (Oct. 1986), Pages 702 - 705 [ Find Related Articles ] 100

8) Real time validation of man-in-the-loop simulations; William C. Hopkinson and José A. Sepúlveda; Proceedings of the 1995 conference on Winter simulation conference, 1995, Pages 1250 - 1256 [ Find Related Articles ] 100

9) The benefits of relaxing punctuality; Rajeev Alur, Tomás Feder and Thomas A. Henzinger; J. ACM 43, 1 (Jan. 1996), Pages 116 - 146 [ Find Related Articles ] 100

10) Branching time and abstraction in bisimulation semantics; Rob J. van Gabbeek and W. Peter Weijland; J. ACM 43, 3 (May. 1996), Pages 555 - 600 [ Find Related Articles ] 100

11) A methodology of parsing mathematical notation for mathematical computation; Yanjie Zhao, Tetsuya Sakurai, Hiroshi Sugiura and Tatsuo Torii; Proceedings of the 1996 international symposium on Symbolic and algebraic computation, 1996, Pages 292 - 300 [ Find Related Articles ] 100

12) Elementary formal systems, intrinsic complexity, and procrastination; Sanjay Jain and Arun Sharma; Proceedings of the ninth annual conference on Computational learning theory, 1996, Pages 181 - 192 [ Find Related Articles ] 100

13) Angluin's theorem for indexed families of r.e. sets and applications; Dick de Jongh and Makoto Kanazawa; Proceedings of the ninth annual conference on Computational learning theory, 1996, Pages 193 - 204 [ Find Related Articles ] 100

14) A formal basis for architectural connection; Robert Allen and David Garlan; ACM Trans. Softw. Eng. Methodol. 6, 3 (Jul. 1997), Pages 213 - 249 [ Find Related Articles ] 100

15) A collection of tools for making automata theory and formal languages come alive; Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider, Magdalena Procopiuc, Octavian Procopiuc, Jason R. Salemme and Edwin Tsang; Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education, 1997, Pages 15 - 19 [ Find Related Articles ] 100

16) Explanation closure as a knowledge representation tool for automated story generation ; Damon Stewart and R. Raymond Lang; Proceedings of the 36th annual conference on Southeast regional conference, 1998, Pages 332 - 336 [ Find Related Articles ] 100

17) Conjunctive constraint mapping for data translation ; Chen-Chuan K. Chang and Hector Garcia-Molina; Proceedings of the third ACM Conference on Digital libraries, 1998, Pages 49 - 58 [ Find Related Articles ] 100

18) Learnability of a subclass of extended pattern languages ; Andrew R. Mitchell; proceedings of the eleventh annual conference on Computational learning theory, 1998, Pages 64 - 71 [ Find Related Articles ] 100

19) Learning one-variable pattern languages in linear average time ; Rüdiger Reischuk and Thomas Zeugmann; proceedings of the eleventh annual conference on Computational learning theory, 1998, Pages 198 - 208 [ Find Related Articles ] 100

20) Errata a formal basis for architectural connection; Robert Allen and David Garlan; ACM Trans. Softw. Eng. Methodol. 7, 3 (Jul. 1998), Pages 333 - 334 [ Find Related Articles ] 100

21) VisA: towards a students' green card to automata theory and formal languages; Markus Holzer and Muriel Quenzer; The proceedings of the third Australasian conference on Computer science education, 1998, Page 67 [ Find Related Articles ] 100

22) Blending Object-Z and Timed CSP: an introduction to TCOZ; Brendan Mahony and Jin Song Dong; Proceedings of the 1998 international conference on Software engineering, 1998, Pages 95 - 104 [ Find Related Articles ] 100

23) Random-Access Stored-Program Machines, an Approach to Programming Languages; Calvin C. Elgot and Abraham Robinson; J. ACM 11, 4 (Oct. 1964), Pages 365 - 399 [ Find Related Articles ] 100

24) The Immortality Problem for Post Normal Systems; Philip K. Hooper; J. ACM 13, 4 (Oct. 1966), Pages 594 - 599 [ Find Related Articles ] 100

25) Relations Between Time and Tape Complexities; John E. Hopcroft and Jeffrey D. Ullman; J. ACM 15, 3 (Jul. 1968), Pages 414 - 427 [ Find Related Articles ] 100

26) Nested Stack Automata; Alfred V. Aho; J. ACM 16, 3 (Jul. 1969), Pages 383 - 406 [ Find Related Articles ] 100

27) A Grammatical Characterization of One-Way Nondeterministic Stack Languages; Michael A. Harrison and Mario Schkolnick; J. ACM 18, 2 (Apr. 1971), Pages 148 - 172 [ Find Related Articles ] 100

28) Multitape AFA; Seymour Ginsburg and Sheila Greibach; J. ACM 19, 2 (Apr. 1972), Pages 193 - 221 [ Find Related Articles ] 100

29) The Halting Problem for Probabilistic Context-Free Generators; Clarence A. Ellis; J. ACM 19, 3 (Jul. 1972), Pages 396 - 399 [ Find Related Articles ] 100

30) An axiomatic approach to code optimization for expressions; James C. Beatty; J. ACM 19, 4 (Oct. 1972), Pages 613 - 640 [ Find Related Articles ] 100

31) Errata: An axiomatic approach to code optimization for Expressions; James C. Beatty; J. ACM 20, 1 (Jan. 1973), Page 188 [ Find Related Articles ] 100

32) Erratum: An axiomatic approach to code optimization for expressions; James C. Beatty; J. ACM 20, 3 (Jul. 1973), Page 538 [ Find Related Articles ] 100

33) Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars; M. D. Mickunas, R. L. Lancaster and V. B. Schneider; J. ACM 23, 3 (Jul. 1976), Pages 511 - 533 [ Find Related Articles ] 100

34) Proof, Completeness, Transcendentals, and Sampling; Philip J. Davis; J. ACM 24, 2 (Apr. 1977), Pages 298 - 310 [ Find Related Articles ] 100

35) Even Simple Programs Are Hard To Analyze; Neil D. Jones and Steven S. Muchnick; J. ACM 24, 2 (Apr. 1977), Pages 338 - 350 [ Find Related Articles ] 100

36) On Equivalence and Containment Problems for Formal Languages; Harry B. Hunt and Daniel J. Rosenkrantz; J. ACM 24, 3 (Jul. 1977), Pages 387 - 396 [ Find Related Articles ] 100

37) Word Problems Solvable in Logspace; Richard J. Lipton and Yechezkel Zalcstein; J. ACM 24, 3 (Jul. 1977), Pages 522 - 526 [ Find Related Articles ] 100

38) Some Properties of Predicate Transformers; C. A. R. Hoare; J. ACM 25, 3 (Jul. 1978), Pages 461 - 480 [ Find Related Articles ] 100

39) Stack Machines and Classes of Nonnested Macro Languages; Joost Engelfriet, Erik Meineche Schmidt and Jan van Leeuwen; J. ACM 27, 1 (Jan. 1980), Pages 96 - 117 [ Find Related Articles ] 100

40) Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages; J. Engelfriet and G. Rozenberg; J. ACM 27, 3 (Jul. 1980), Pages 499 - 518 [ Find Related Articles ] 100

41) Conjunctional type assignment in programming languages; R. Ghosh-Roy and Frank Jensen; Proceedings of the 1988 ACM sixteenth annual conference on Computer science, 1988, Pages 475 - 482 [ Find Related Articles ] 100

42) On designing a language for exclusive use in a syntax directed programming environment; Donald J. Bagert; Proceedings of the 1988 ACM sixteenth annual conference on Computer science, 1988, Page 682 [ Find Related Articles ] 100

43) Hardware/software synthesis of formal specifications in codesign of embedded systems; Vincenza Carchiolo, Michele Malgeri and Guiseppe Mangioni; ACM Trans. Des. Autom. Electron. Syst. 5, 3 (Jul. 2000), Pages 399 - 432 [ Find Related Articles ] 100

44) Program developments: formal explanations of implementations; David S. Wile; Commun. ACM 26, 11 (Nov. 1983), Pages 902 - 911 [ Find Related Articles ] 100

45) The equivalence of reducing transition languages and deterministic languages; Mario Schkolnick; Commun. ACM 17, 9 (Sep. 1974), Pages 517 - 520 [ Find Related Articles ] 100

46) MSO definable string transductions and two-way finite-state transducers; Joost Engelfriet and Hendrik Jan Hoogeboom; ACM Trans. Comput. Logic 2, 2 (Apr. 2001), Pages 216 - 254 [ Find Related Articles ] 100

47) Delegation is inheritance; Lynn Andrea Stein; Conference proceedings on Object-oriented programming systems, languages and applications, 1987, Pages 138 - 146 [ Find Related Articles ] 100

48) Metaclasses are first class: The ObjVlisp Model; Pierre Cointe; Conference proceedings on Object-oriented programming systems, languages and applications, 1987, Pages 156 - 162 [ Find Related Articles ] 100

49) Dimensions of object-based language design; Peter Wegner; Conference proceedings on Object-oriented programming systems, languages and applications, 1987, Pages 168 - 182 [ Find Related Articles ] 100

50) A law-based approach to object-oriented programming; Naftaly H. Minsky and David Rozenshtein; Conference proceedings on Object-oriented programming systems, languages and applications, 1987, Pages 482 - 493 [ Find Related Articles ] 100

51) Specification of time dependencies and synthesis of concurrent processes; P. Ladkin; Proceedings of the 9th International Conference on Software Engineering, 1987, Pages 106 - 115 [ Find Related Articles ] 100

52) SEGRAS--a formal and semigraphical language combining Petri nets and abstract data types for the specification of distributed systems; B. Krämer; Proceedings of the 9th International Conference on Software Engineering, 1987, Pages 116 - 125 [ Find Related Articles ] 100

53) Church-Rosser Thue systems and formal languages; Robert McNaughton, Paliath Narendran and Friedrich Otto; J. ACM 35, 2 (Apr. 1988), Pages 324 - 344 [ Find Related Articles ] 100

54) Graph attribution as a specification paradigm; Bowen Alpern, Alan Carle, Barry Rosen, Peter Sweeney and Kenneth Zadeck; Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical software development environments, 1988, Pages 121 - 129 [ Find Related Articles ] 100

55) A core course in computer theory: design and implementation issues; D. J. Bagert; Proceedings of the twentieth SIGCSE technical symposium on Computer science education, 1989, Pages 161 - 164 [ Find Related Articles ] 100

56) Tools to support formal methods; S. Patel, R. A. Orr, M. T. Norris and D. W. Bustard; Proceedings of the 11th international conference on Software engineering, 1989, Pages 123 - 132 [ Find Related Articles ] 100

57) Modular specification of incremental program transformation systems; Alan Carle and Lori Pollock; Proceedings of the 11th international conference on Software engineering, 1989, Pages 178 - 187 [ Find Related Articles ] 100

58) Higher order attribute grammars; H. H. Vogt, S. D. Swierstra and M. F. Kuiper; Proceedings of the SIGPLAN '89 Conference on Programming language design and implementation, 1989, Pages 131 - 145 [ Find Related Articles ] 100

59) Legal procedures as formal conversations: contracting on a performative network; S. K. Dewitz and R. M. Lee; Proceedings of the tenth international conference on Information Systems, 1989, Pages 53 - 65 [ Find Related Articles ] 100

60) On the synthesis of a reactive module; A. Pnueli and R. Rosner; Proceedings of the sixteenth annual ACM symposium on Principles of programming languages, 1989, Pages 179 - 190 [ Find Related Articles ] 100

61) A Formal Method for the Abstract Specification of Software; John McLean; J. ACM 31, 3 (Jul. 1984), Pages 600 - 627 [ Find Related Articles ] 100

62) Reasoning with continuations II: full abstraction for models of control; Dorai Sitaram and Matthias Felleisen; Proceedings of the 1990 ACM conference on LISP and functional programming, 1990, Pages 161 - 175 [ Find Related Articles ] 100

63) Inductive inference from positive data is powerful; Takeshi Shinohara; Proceedings of the third annual workshop on Computational learning theory, 1990, Pages 97 - 110 [ Find Related Articles ] 100

64) The power of vacillation; John Case; Proceedings of the 1988 workshop on Computational learning theory, 1988, Pages 196 - 205 [ Find Related Articles ] 100

65) Polynomial learnability of semilinear sets; Naoki Abe; Proceedings of the second annual workshop on Computational learning theory, 1989, Pages 25 - 40 [ Find Related Articles ] 100

66) Learning simple deterministic languages; Hiroki Ishizaka; Proceedings of the second annual workshop on Computational learning theory, 1989, Pages 162 - 174 [ Find Related Articles ] 100

67) Identification of unions of languages drawn from an identifiable class; Keith Wright; Proceedings of the second annual workshop on Computational learning theory, 1989, Pages 328 - 333 [ Find Related Articles ] 100

68) Automata-driven indexing of Prolog clauses; R. Ramesh, I. V. Ramakrishnan and D. S. Warren; Proceedings of the seventeenth annual ACM symposium on Principles of programming languages, 1990, Pages 281 - 291 [ Find Related Articles ] 100

69) Safe run-time overloading; Francois Rouaix; Proceedings of the seventeenth annual ACM symposium on Principles of programming languages, 1990, Pages 355 - 366 [ Find Related Articles ] 100

70) Strong typing of object-oriented languages revisited; Ole Lehrmann Madsen, Boris Magnusson and Birger Mølier-Pedersen; Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications, 1990, Pages 140 - 150 [ Find Related Articles ] 100

**Next message:**Samantha Atkins: "Re: Extreme programming"**Previous message:**Jordan Dimov: "RE: Computational reflection"**Maybe in reply to:**Mitchell Porter: "Computational reflection"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

*
This archive was generated by hypermail 2.1.5
: Wed Jul 17 2013 - 04:00:36 MDT
*