The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John Staples: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jian Chen, John Staples
    Soft Sorting in Logic Programming. [Citation Graph (0, 0)][DBLP]
    ALPUK, 1992, pp:79-96 [Conf]
  2. H. Becht, John Staples
    Soft Typing of General First-Order Languages. [Citation Graph (0, 0)][DBLP]
    APSEC, 1995, pp:480-488 [Conf]
  3. Lin Zucconi, Greg Royle, Karl Reed, John Staples
    Do Formal Methods Really Work? [Citation Graph (0, 0)][DBLP]
    Australian Software Engineering Conference, 1996, pp:66-0 [Conf]
  4. John Staples
    Verification, Validation and the Future of Software Engineering. [Citation Graph (0, 0)][DBLP]
    Australian Software Engineering Conference, 1996, pp:2- [Conf]
  5. Lin Zucconi, Greg Royle, Karl Reed, John Staples
    Do Formal Methods Really Work? [Citation Graph (0, 0)][DBLP]
    ASYNC, 1996, pp:66-0 [Conf]
  6. Hartmut Ehrig, John Staples
    Church-Rosser properties for graph replacement systems with unique splitting. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1982, pp:82-101 [Conf]
  7. John Staples
    A Graph-Like Lambda Calculus for Which Leftmost-Overmost Reduction is Optimal. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science and Biology, 1978, pp:440-455 [Conf]
  8. John Staples
    Two-level expression representation for faster evaluation. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1982, pp:392-404 [Conf]
  9. John Staples, Peter J. Robinson
    Unification of quantified terms. [Citation Graph (0, 0)][DBLP]
    Graph Reduction, 1986, pp:426-450 [Conf]
  10. Anthony S. K. Cheng, Peter J. Robinson, John Staples
    Higher Level Meta Programming in Qu-Prolog 3: 0. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:285-298 [Conf]
  11. Peter Kearney, John Staples, A. Abbas
    Functional Verification of Hard Real-Time Programs. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:113-119 [Conf]
  12. John Staples, Peter J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, P. C. Wallis
    Qu-Prolog: An Extended Prolog for Meta Level Programming. [Citation Graph (0, 0)][DBLP]
    META, 1988, pp:435-452 [Conf]
  13. Jian Chen, John Staples
    Defining Soft Sortedness by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:362-371 [Conf]
  14. John Staples, Peter J. Robinson, Daniel Hazel
    A Functional Logic for Higher Level Reasoning About Computation. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1994, v:6, n:1, pp:1-38 [Journal]
  15. John Staples, V. L. Nguyen
    A Fixpoint Semantics for Nondeterministic Data Flow [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:411-444 [Journal]
  16. Peter Eades, John Staples
    On Optimal Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:4, pp:369-384 [Journal]
  17. John Staples, Peter J. Robinson
    Structure Sharing for Quantified Terms: Fundamentals. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1990, v:6, n:2, pp:115-145 [Journal]
  18. John Staples, Peter J. Robinson
    Efficient Unification of Quantified Terms. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1988, v:5, n:2, pp:133-149 [Journal]
  19. John Staples
    Combinator Realizability of a Constructive Morse Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:2, pp:226-234 [Journal]
  20. Peter J. Robinson, John Staples
    Formalizing a Hierarchical Structure of Practical Mathematical Reasoning. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1993, v:3, n:1, pp:47-61 [Journal]
  21. Leslie M. Goldschlager, Ralph A. Shaw, John Staples
    The Maximum Flow Problem is Log Space Complete for P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:105-111 [Journal]
  22. C. Barry Jay, John Staples
    Preface: Theoretical Computer Science in Australia and New Zealand. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:169, n:1, pp:1- [Journal]
  23. Peter Kearney, John Staples
    An Extensional Fixed-Point Semantics for Nondeterministic Data Flow. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:91, n:2, pp:129-179 [Journal]
  24. John Staples
    Computation on Graph-Like Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:171-185 [Journal]
  25. John Staples
    Optimal Evaluations of Graph-Like Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:297-316 [Journal]
  26. John Staples
    Speeding up Subtree Replacement Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:39-47 [Journal]
  27. John Staples
    Delaying Unification Algorithms for Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:277-288 [Journal]
  28. John Staples, V. L. Nguyen
    Computing the Behaviour of Asynchronous Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:343-353 [Journal]

Search in 0.037secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002