 | 2003 |
|---|
| 75 |       | Vaughan R. Pratt:
Comonoids in chu: a large cartesian closed sibling of topological spaces.
Electr. Notes Theor. Comput. Sci. 82(1): (2003) |
| 74 |  | Vaughan R. Pratt:
Transition And Cancellation In Concurrency And Branching Time.
Mathematical Structures in Computer Science 13(4): 485-529 (2003) |
| 73 | | Vaughan R. Pratt:
Chu spaces as a semantic bridge between linear logic and mathematics.
Theor. Comput. Sci. 294(3): 439-471 (2003) |
| 2002 |
|---|
| 72 | | Vaughan R. Pratt:
Event-State Duality: The Enriched Case.
CONCUR 2002: 41-56 |
| 71 | | Dusko Pavlovic,
Vaughan R. Pratt:
The continuum as a final coalgebra.
Theor. Comput. Sci. 280(1-2): 105-122 (2002) |
| 2001 |
|---|
| 70 | | Vaughan R. Pratt:
Software Geography: Physical and Economic Aspects.
SOFSEM 2001: 336-346 |
| 69 | | Rohit Parikh,
Laxmi Parida,
Vaughan R. Pratt:
Sock Sorting: An Example of a Vague Algorithm.
Logic Journal of the IGPL 9(5): (2001) |
| 2000 |
|---|
| 68 | | Vaughan R. Pratt:
Higher dimensional automata revisited.
Mathematical Structures in Computer Science 10(4): 525-548 (2000) |
| 1999 |
|---|
| 67 | | Greg DeFouw,
Vaughan R. Pratt:
The Matchbox: A Small Wearable Platform.
ISWC 1999: 172-175 |
| 66 | | Harish Devarajan,
Dominic J. D. Hughes,
Gordon D. Plotkin,
Vaughan R. Pratt:
Full Completeness of the Multiplicative Linear Logic of Chu Spaces.
LICS 1999: 234-242 |
| 65 | | Vaughan R. Pratt:
Chu Spaces from the Representational Viewpoint.
Ann. Pure Appl. Logic 96(1-3): 319-333 (1999) |
| 64 | | Dusko Pavlovic,
Vaughan R. Pratt:
On coalgebra of real numbers.
Electr. Notes Theor. Comput. Sci. 19: (1999) |
| 1997 |
|---|
| 63 | | Vaughan R. Pratt:
Towards full completeness of the linear logic of Chu spaces.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 62 | | Vaughan R. Pratt:
Types as processes, via Chu spaces.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
| 1996 |
|---|
| 61 | | Vaughan R. Pratt:
Concurrency Concepts - An Ongoing Search.
ACM Comput. Surv. 28(4es): 54 (1996) |
| 60 | | Vaughan R. Pratt:
Broadening the denotational semantics of linear logic.
Electr. Notes Theor. Comput. Sci. 3: (1996) |
| 59 | | Vaughan R. Pratt,
Jerzy Tiuryn:
Satisfiability of Inequalities in a Poset.
Fundam. Inform. 28(1-2): 165-182 (1996) |
| 1995 |
|---|
| 58 | | Vaughan R. Pratt:
The Stone Gamut: A Coordinatization of Mathematics
LICS 1995: 444-454 |
| 57 | | Vaughan R. Pratt:
Rational Mechanisms and Natural Mathematics.
TAPSOFT 1995: 108-122 |
| 56 | | Vaughan R. Pratt:
Anatomy of the Pentium Bug.
TAPSOFT 1995: 97-107 |
| 55 | | Vaughan R. Pratt:
Chu Spaces and Their Interpretation as Concurrent Objects.
Computer Science Today 1995: 392-405 |
| 1994 |
|---|
| 54 | | Vaughan R. Pratt:
Time and Information in Sequential and Concurrent Computation.
Theory and Practice of Parallel Programming 1994: 1-24 |
| 1993 |
|---|
| 53 | | Vineet Gupta,
Vaughan R. Pratt:
Gages Accept Concurrent Behavior
FOCS 1993: 62-71 |
| 52 | | Vaughan R. Pratt:
The Second Calculus of Binary Relations.
MFCS 1993: 142-155 |
| 1992 |
|---|
| 51 | | Vaughan R. Pratt:
The Duality of TIme and Information.
CONCUR 1992: 237-253 |
| 50 | | Vaughan R. Pratt:
Arithmetic + Logic + Geometry = Concurrency.
LATIN 1992: 430-447 |
| 49 | | Vaughan R. Pratt:
Origins of the Calculus of Binary Relations
LICS 1992: 248-254 |
| 1991 |
|---|
| 48 | | Vaughan R. Pratt:
Event Spaces and their Linear Logic.
AMAST 1991: 3-25 |
| 47 | | Vaughan R. Pratt:
Modeling Concurrency with Geometry.
POPL 1991: 311-322 |
| 46 | | Ross Casley,
Roger F. Crew,
José Meseguer,
Vaughan R. Pratt:
Temporal Structures.
Mathematical Structures in Computer Science 1(2): 179-213 (1991) |
| 1990 |
|---|
| 45 | | Vaughan R. Pratt:
Action Logic and Pure Induction.
JELIA 1990: 97-120 |
| 1989 |
|---|
| 44 | | Ross Casley,
Roger F. Crew,
José Meseguer,
Vaughan R. Pratt:
Temporal Structures.
Category Theory and Computer Science 1989: 21-51 |
| 1988 |
|---|
| 43 | | Vaughan R. Pratt:
Dynamic algebras as a well-behaved fragment of relation algebras.
Algebraic Logic and Universal Algebra in Computer Science 1988: 77-110 |
| 1987 |
|---|
| 42 | | Haim Gaifman,
Vaughan R. Pratt:
Partial Order Models of Concurrency and the Computation of Functions
LICS 1987: 72-85 |
| 41 | | Sheue-Ling Lien,
Michael Shantz,
Vaughan R. Pratt:
Adaptive forward differencing for rendering curves and surfaces.
SIGGRAPH 1987: 111-118 |
| 40 | | Vaughan R. Pratt:
Direct least-squares fitting of algebraic surfaces.
SIGGRAPH 1987: 145-152 |
| 1985 |
|---|
| 39 | | Vaughan R. Pratt:
Some Constructions for Order-Theoretic Models of Concurrency.
Logic of Programs 1985: 269-283 |
| 38 | | Vaughan R. Pratt:
Techniques for conic splines.
SIGGRAPH 1985: 151-160 |
| 37 | | Charles A. Bigelow,
Philippe Coueignoux,
John Hobby,
Peter Karow,
Vaughan R. Pratt,
Luis Trabb-Pardo,
John E. Warnock:
Font formats (panel session).
SIGGRAPH 1985: 325 |
| 1984 |
|---|
| 36 | | Vaughan R. Pratt:
Standards and Performance Issues in the Workstation Market.
COMPCON 1984: 142-147 |
| 35 | | Vaughan R. Pratt:
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial.
Seminar on Concurrency 1984: 180-196 |
| 1983 |
|---|
| 34 | | Vaughan R. Pratt:
Five Paradigm Shifts in Language Design and their Realization in Viron, a Dataflow Programming Environment.
POPL 1983: 1-9 |
| 33 | | Vaughan R. Pratt:
Two-way Channel with Disconnect.
The Analysis of Concurrent Systems 1983: 110-111 |
| 1982 |
|---|
| 32 | | Vaughan R. Pratt:
On the Composition of Processes.
POPL 1982: 213-223 |
| 1981 |
|---|
| 31 | | Vaughan R. Pratt:
A Decidable mu-Calculus: Preliminary Report
FOCS 1981: 421-427 |
| 30 | | Vaughan R. Pratt:
Using Graphs to Understand PDL.
Logic of Programs 1981: 387-396 |
| 29 | | Vaughan R. Pratt:
Program Logic Without Binding is Decidable.
POPL 1981: 159-163 |
| 28 | | Michael Rodeh,
Vaughan R. Pratt,
Shimon Even:
Linear Algorithm for Data Compression via String Matching.
J. ACM 28(1): 16-24 (1981) |
| 1980 |
|---|
| 27 | | Vaughan R. Pratt:
On Specifying Verifiers.
POPL 1980: 106-116 |
| 26 | | Vaughan R. Pratt:
Dynamic Algebras and the Nature of Induction
STOC 1980: 22-28 |
| 25 | | Vaughan R. Pratt:
A Near-Optimal Method for Reasoning about Action.
J. Comput. Syst. Sci. 20(2): 231-254 (1980) |
| 1979 |
|---|
| 24 | | Vaughan R. Pratt:
Models of Program Logics
FOCS 1979: 115-122 |
| 23 | | Vaughan R. Pratt:
Axioms or Algorithms.
MFCS 1979: 160-169 |
| 22 | | Vaughan R. Pratt:
Process Logic.
POPL 1979: 93-100 |
| 1978 |
|---|
| 21 | | David Harel,
Vaughan R. Pratt:
Nondeterminism in Logics of Programs.
POPL 1978: 203-213 |
| 20 | | Vaughan R. Pratt:
A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report
STOC 1978: 326-337 |
| 1977 |
|---|
| 19 | | Steven D. Litvintchouk,
Vaughan R. Pratt:
A Proof-Checker for Dynamic Logic.
IJCAI 1977: 552-558 |
| 18 | | Vaughan R. Pratt:
The Competence/Performance Dichotomy in Programming.
POPL 1977: 194-200 |
| 17 | | David Harel,
Albert R. Meyer,
Vaughan R. Pratt:
Computability and Completeness in Logics of Programs (Preliminary Report)
STOC 1977: 261-268 |
| 16 | | Donald E. Knuth,
James H. Morris Jr.,
Vaughan R. Pratt:
Fast Pattern Matching in Strings.
SIAM J. Comput. 6(2): 323-350 (1977) |
| 1976 |
|---|
| 15 | | Ronald L. Rivest,
Vaughan R. Pratt:
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report
FOCS 1976: 1-8 |
| 14 | | Vaughan R. Pratt:
Semantical Considerations on Floyd-Hoare Logic
FOCS 1976: 109-121 |
| 13 | | Vaughan R. Pratt,
Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines.
J. Comput. Syst. Sci. 12(2): 198-221 (1976) |
| 1975 |
|---|
| 12 | | Vaughan R. Pratt:
The Effect of Basis on Size of Boolean Expressions
FOCS 1975: 119-121 |
| 11 | | Vaughan R. Pratt:
Every Prime has a Succinct Certificate.
SIAM J. Comput. 4(3): 214-220 (1975) |
| 10 | | Vaughan R. Pratt:
The Power of Negative Thinking in Multiplying Boolean Matrices.
SIAM J. Comput. 4(3): 326-330 (1975) |
| 1974 |
|---|
| 9 | | Vaughan R. Pratt,
Michael O. Rabin,
Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines
STOC 1974: 122-134 |
| 8 | | Vaughan R. Pratt:
The Power of Negative Thinking in Multiplying Boolean Matrices
STOC 1974: 80-83 |
| 1973 |
|---|
| 7 | | Vaughan R. Pratt,
Foong Frances Yao:
On Lower Bounds for Computing the i-th Largest Element
FOCS 1973: 70-81 |
| 6 | | Vaughan R. Pratt:
A Linguistics Oriented Programming Language.
IJCAI 1973: 372-382 |
| 5 | | Vaughan R. Pratt:
Top Down Operator Precedence.
POPL 1973: 41-51 |
| 4 | | Vaughan R. Pratt:
Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues
STOC 1973: 268-277 |
| 3 | | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest,
Robert Endre Tarjan:
Time Bounds for Selection.
J. Comput. Syst. Sci. 7(4): 448-461 (1973) |
| 1972 |
|---|
| 2 | | Vaughan R. Pratt:
Shellsort and Sorting Networks
Garland Publishing, New York 1972 |
| 1 | | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest,
Robert Endre Tarjan:
Linear Time Bounds for Median Computations
STOC 1972: 119-124 |
