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