default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVaughan R. Pratt
Person information
- affiliation: Stanford University, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j24]Peter Höfner, Carroll Morgan, Vaughan R. Pratt:
Preface. Acta Informatica 57(3-5): 305-311 (2020)- [j23]Vaughan R. Pratt:
My time with Rob. Acta Informatica 57(3-5): 321-322 (2020)
2010 – 2019
- 2017
- [c63]Vaughan R. Pratt:
Dynamic Logic: A Personal Perspective. DALI@TABLEAUX 2017: 153-170 - 2012
- [i1]Vaughan R. Pratt:
A combinatorial analysis of the average time for open-address hash coding insertion. CoRR abs/1208.5956 (2012) - 2011
- [c62]Vaughan R. Pratt:
Linear Process Algebra. ICDCIT 2011: 92-111 - [c61]Jesse Levinson, Jake Askeland, Jan Becker, Jennifer Dolson, David Held, Sören Kammel, J. Zico Kolter, Dirk Langer, Oliver Pink, Vaughan R. Pratt, Michael Sokolsky, Ganymed Stanek, David Michael Stavens, Alex Teichman, Moritz Werling, Sebastian Thrun:
Towards fully autonomous driving: Systems and algorithms. Intelligent Vehicles Symposium 2011: 163-168 - 2010
- [j22]Vaughan R. Pratt:
Communes via Yoneda, from an Elementary Perspective. Fundam. Informaticae 103(1-4): 203-218 (2010)
2000 – 2009
- 2006
- [j21]Sebastian Thrun, Michael Montemerlo, Hendrik Dahlkamp, David Stavens, Andrei Aron, James Diebel, Philip W. Fong
, John Gale, Morgan Halpenny, Gabriel Hoffmann, Kenny Lau, Celia M. Oakley, Mark Palatucci, Vaughan R. Pratt, Pascal Stang, Sven Strohband, Cedric Dupont, Lars-Erik Jendrossek, Christian Koelen, Charles Markey, Carlo Rummel, Joe van Niekerk, Eric Jensen, Philippe Alessandrini, Gary R. Bradski, Bob Davies, Scott Ettinger, Adrian Kaehler, Ara V. Nefian, Pamela Mahoney:
Stanley: The robot that won the DARPA Grand Challenge. J. Field Robotics 23(9): 661-692 (2006) - 2003
- [j20]Vaughan R. Pratt:
Transition And Cancellation In Concurrency And Branching Time. Math. Struct. Comput. Sci. 13(4): 485-529 (2003) - [j19]Vaughan R. Pratt:
Chu spaces as a semantic bridge between linear logic and mathematics. Theor. Comput. Sci. 294(3): 439-471 (2003) - [c60]Vaughan R. Pratt:
Comonoids in chu: a large cartesian closed sibling of topological spaces. CMCS 2003: 273-284 - 2002
- [j18]Dusko Pavlovic, Vaughan R. Pratt:
The continuum as a final coalgebra. Theor. Comput. Sci. 280(1-2): 105-122 (2002) - [c59]Vaughan R. Pratt:
Event-State Duality: The Enriched Case. CONCUR 2002: 41-56 - 2001
- [j17]Rohit Parikh, Laxmi Parida, Vaughan R. Pratt:
Sock Sorting: An Example of a Vague Algorithm. Log. J. IGPL 9(5): 687-692 (2001) - [c58]Vaughan R. Pratt:
Software Geography: Physical and Economic Aspects. SOFSEM 2001: 336-346 - 2000
- [j16]Vaughan R. Pratt:
Higher dimensional automata revisited. Math. Struct. Comput. Sci. 10(4): 525-548 (2000) - [j15]Donald E. Knuth, Vaughan R. Pratt, O. P. Lossers:
The Real Numbers, Algebraically: 10689. Am. Math. Mon. 107(8): 755 (2000)
1990 – 1999
- 1999
- [j14]Vaughan R. Pratt:
Chu Spaces from the Representational Viewpoint. Ann. Pure Appl. Log. 96(1-3): 319-333 (1999) - [c57]Greg DeFouw, Vaughan R. Pratt:
The Matchbox: A Small Wearable Platform. ISWC 1999: 172-175 - [c56]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-243 - [c55]Dusko Pavlovic, Vaughan R. Pratt:
On coalgebra of real numbers. CMCS 1999: 103-117 - 1997
- [c54]Vaughan R. Pratt:
Types as processes, via Chu spaces. EXPRESS 1997: 227-247 - [c53]Vaughan R. Pratt:
Towards full completeness of the linear logic of Chu spaces. MFPS 1997: 308-325 - 1996
- [j13]Vaughan R. Pratt:
Concurrency Concepts - An Ongoing Search. ACM Comput. Surv. 28(4es): 54 (1996) - [j12]Vaughan R. Pratt, Jerzy Tiuryn:
Satisfiability of Inequalities in a Poset. Fundam. Informaticae 28(1-2): 165-182 (1996) - [c52]Gordon D. Plotkin, Vaughan R. Pratt:
Teams can see pomsets. Partial Order Methods in Verification 1996: 117-128 - [c51]Vaughan R. Pratt:
Broadening the denotational semantics of linear logic. Linear Logic Tokyo Meeting 1996: 155-166 - [e1]Doron A. Peled, Vaughan R. Pratt, Gerard J. Holzmann:
Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, July 24-26, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 29, DIMACS/AMS 1996, ISBN 978-0-8218-0579-4 [contents] - 1995
- [c50]Vaughan R. Pratt:
The Stone Gamut: A Coordinatization of Mathematics. LICS 1995: 444-454 - [c49]Vaughan R. Pratt:
Anatomy of the Pentium Bug. TAPSOFT 1995: 97-107 - [c48]Vaughan R. Pratt:
Rational Mechanisms and Natural Mathematics. TAPSOFT 1995: 108-122 - [p1]Vaughan R. Pratt:
Chu Spaces and Their Interpretation as Concurrent Objects. Computer Science Today 1995: 392-405 - 1994
- [c47]Vaughan R. Pratt:
Time and Information in Sequential and Concurrent Computation. Theory and Practice of Parallel Programming 1994: 1-24 - 1993
- [c46]Vineet Gupta, Vaughan R. Pratt:
Gages Accept Concurrent Behavior. FOCS 1993: 62-71 - [c45]Vaughan R. Pratt:
The Second Calculus of Binary Relations. MFCS 1993: 142-155 - 1992
- [c44]Vaughan R. Pratt:
The Duality of TIme and Information. CONCUR 1992: 237-253 - [c43]Vaughan R. Pratt:
Arithmetic + Logic + Geometry = Concurrency. LATIN 1992: 430-447 - [c42]Vaughan R. Pratt:
Origins of the Calculus of Binary Relations. LICS 1992: 248-254 - 1991
- [j11]Ross Casley, Roger F. Crew, José Meseguer, Vaughan R. Pratt:
Temporal Structures. Math. Struct. Comput. Sci. 1(2): 179-213 (1991) - [j10]Vaughan R. Pratt:
Dynamic algebras: Examples, constructions, applications. Stud Logica 50(3-4): 571-605 (1991) - [c41]Vaughan R. Pratt:
Event Spaces and their Linear Logic. AMAST 1991: 3-25 - [c40]Vaughan R. Pratt:
Modeling Concurrency with Geometry. POPL 1991: 311-322 - 1990
- [c39]Vaughan R. Pratt:
Action Logic and Pure Induction. JELIA 1990: 97-120
1980 – 1989
- 1989
- [c38]Ross Casley, Roger F. Crew, José Meseguer, Vaughan R. Pratt:
Temporal Structures. Category Theory and Computer Science 1989: 21-51 - 1988
- [c37]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
- [c36]Haim Gaifman, Vaughan R. Pratt:
Partial Order Models of Concurrency and the Computation of Functions. LICS 1987: 72-85 - [c35]Sheue-Ling Lien, Michael Shantz, Vaughan R. Pratt:
Adaptive forward differencing for rendering curves and surfaces. SIGGRAPH 1987: 111-118 - [c34]Vaughan R. Pratt:
Direct least-squares fitting of algebraic surfaces. SIGGRAPH 1987: 145-152 - 1986
- [j9]Vaughan R. Pratt:
Modeling concurrency with partial orders. Int. J. Parallel Program. 15(1): 33-71 (1986) - 1985
- [c33]Vaughan R. Pratt:
Some Constructions for Order-Theoretic Models of Concurrency. Logic of Programs 1985: 269-283 - [c32]Vaughan R. Pratt:
Techniques for conic splines. SIGGRAPH 1985: 151-160 - [c31]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
- [j8]Vaughan R. Pratt:
Standards and Performance Issues in the Workstation Market. IEEE Computer Graphics and Applications 4(4): 71-76 (1984) - [c30]Vaughan R. Pratt:
Standards and Performance Issues in the Workstation Market. COMPCON 1984: 142-147 - [c29]Vaughan R. Pratt:
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial. Seminar on Concurrency 1984: 180-196 - 1983
- [c28]Vaughan R. Pratt:
Two-way Channel with Disconnect. The Analysis of Concurrent Systems 1983: 110-111 - [c27]Vaughan R. Pratt:
Five Paradigm Shifts in Language Design and their Realization in Viron, a Dataflow Programming Environment. POPL 1983: 1-9 - 1982
- [c26]Vaughan R. Pratt:
On the Composition of Processes. POPL 1982: 213-223 - 1981
- [j7]Michael Rodeh, Vaughan R. Pratt, Shimon Even:
Linear Algorithm for Data Compression via String Matching. J. ACM 28(1): 16-24 (1981) - [c25]Vaughan R. Pratt:
A Decidable mu-Calculus: Preliminary Report. FOCS 1981: 421-427 - [c24]Vaughan R. Pratt:
Using Graphs to Understand PDL. Logic of Programs 1981: 387-396 - [c23]Vaughan R. Pratt:
Program Logic Without Binding is Decidable. POPL 1981: 159-163 - 1980
- [j6]Vaughan R. Pratt:
A Near-Optimal Method for Reasoning about Action. J. Comput. Syst. Sci. 20(2): 231-254 (1980) - [c22]Vaughan R. Pratt:
On Specifying Verifiers. POPL 1980: 106-116 - [c21]Vaughan R. Pratt:
Dynamic Algebras and the Nature of Induction. STOC 1980: 22-28
1970 – 1979
- 1979
- [c20]Alan J. Perlis, William H. Burge, Joel Moses, Vaughan R. Pratt:
APL and LISP - should they be combined, and if so how? APL 1979: 278 - [c19]Vaughan R. Pratt:
Models of Program Logics. FOCS 1979: 115-122 - [c18]Vaughan R. Pratt:
Axioms or Algorithms. MFCS 1979: 160-169 - [c17]Vaughan R. Pratt:
Process Logic. POPL 1979: 93-100 - 1978
- [c16]David Harel, Vaughan R. Pratt:
Nondeterminism in Logics of Programs. POPL 1978: 203-213 - [c15]Vaughan R. Pratt:
A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report. STOC 1978: 326-337 - 1977
- [j5]Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt:
Fast Pattern Matching in Strings. SIAM J. Comput. 6(2): 323-350 (1977) - [c14]Steven D. Litvintchouk, Vaughan R. Pratt:
A Proof-Checker for Dynamic Logic. IJCAI 1977: 552-558 - [c13]Vaughan R. Pratt:
The Competence/Performance Dichotomy in Programming. POPL 1977: 194-200 - [c12]David Harel, Albert R. Meyer, Vaughan R. Pratt:
Computability and Completeness in Logics of Programs (Preliminary Report). STOC 1977: 261-268 - 1976
- [j4]Vaughan R. Pratt, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. J. Comput. Syst. Sci. 12(2): 198-221 (1976) - [c11]Ronald L. Rivest, Vaughan R. Pratt:
The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report. FOCS 1976: 1-8 - [c10]Vaughan R. Pratt:
Semantical Considerations on Floyd-Hoare Logic. FOCS 1976: 109-121 - 1975
- [j3]Vaughan R. Pratt:
Every Prime has a Succinct Certificate. SIAM J. Comput. 4(3): 214-220 (1975) - [j2]Vaughan R. Pratt:
The Power of Negative Thinking in Multiplying Boolean Matrices. SIAM J. Comput. 4(3): 326-330 (1975) - [c9]Vaughan R. Pratt:
The Effect of Basis on Size of Boolean Expressions. FOCS 1975: 119-121 - 1974
- [c8]Vaughan R. Pratt:
The Power of Negative Thinking in Multiplying Boolean Matrices. STOC 1974: 80-83 - [c7]Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. STOC 1974: 122-134 - 1973
- [j1]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) - [c6]Vaughan R. Pratt, Foong Frances Yao:
On Lower Bounds for Computing the i-th Largest Element. SWAT 1973: 70-81 - [c5]Vaughan R. Pratt:
A Linguistics Oriented Programming Language. IJCAI 1973: 372-382 - [c4]Vaughan R. Pratt:
Top Down Operator Precedence. POPL 1973: 41-51 - [c3]Vaughan R. Pratt:
Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues. STOC 1973: 268-277 - 1972
- [b1]Vaughan R. Pratt:
Shellsort and Sorting Networks. Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York 1972, ISBN 0-8240-4406-1 - [c2]Vaughan R. Pratt:
An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File. Complexity of Computer Computations 1972: 111-118 - [c1]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
Linear Time Bounds for Median Computations. STOC 1972: 119-124
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
