Vaughan R. Pratt

According to our database1, Vaughan R. Pratt authored at least 84 papers between 1972 and 2017.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1997, "An outstanding computer scientist, with unusually diverse, original and deep accomplishments, like showing primes in NP, inventing dynamic logic, helping start SUN, and solidifying concurrency.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Dynamic Logic: A Personal Perspective.
Proceedings of the Dynamic Logic. New Trends and Applications, 2017

2011
Towards fully autonomous driving: Systems and algorithms.
Proceedings of the IEEE Intelligent Vehicles Symposium (IV), 2011

Linear Process Algebra.
Proceedings of the Distributed Computing and Internet Technology, 2011

2010
Communes via Yoneda, from an Elementary Perspective.
Fundam. Inform., 2010

2006
Stanley: The robot that won the DARPA Grand Challenge.
J. Field Robotics, 2006

2003
Chu spaces as a semantic bridge between linear logic and mathematics.
Theor. Comput. Sci., 2003

Transition And Cancellation In Concurrency And Branching Time.
Mathematical Structures in Computer Science, 2003

Comonoids in chu: a large cartesian closed sibling of topological spaces.
Electr. Notes Theor. Comput. Sci., 2003

2002
The continuum as a final coalgebra.
Theor. Comput. Sci., 2002

Event-State Duality: The Enriched Case.
Proceedings of the CONCUR 2002, 2002

2001
Sock Sorting: An Example of a Vague Algorithm.
Logic Journal of the IGPL, 2001

Software Geography: Physical and Economic Aspects.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

2000
The Real Numbers, Algebraically: 10689.
The American Mathematical Monthly, 2000

Higher dimensional automata revisited.
Mathematical Structures in Computer Science, 2000

1999
On coalgebra of real numbers.
Electr. Notes Theor. Comput. Sci., 1999

Chu Spaces from the Representational Viewpoint.
Ann. Pure Appl. Logic, 1999

Full Completeness of the Multiplicative Linear Logic of Chu Spaces.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

The Matchbox: A Small Wearable Platform.
Proceedings of the Third International Symposium on Wearable Computers (ISWC 1999), 1999

1997
Types as processes, via Chu spaces.
Electr. Notes Theor. Comput. Sci., 1997

Towards full completeness of the linear logic of Chu spaces.
Electr. Notes Theor. Comput. Sci., 1997

1996
Satisfiability of Inequalities in a Poset.
Fundam. Inform., 1996

Broadening the denotational semantics of linear logic.
Electr. Notes Theor. Comput. Sci., 1996

Concurrency Concepts - An Ongoing Search.
ACM Comput. Surv., 1996

Teams can see pomsets.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

1995
Rational Mechanisms and Natural Mathematics.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Anatomy of the Pentium Bug.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

The Stone Gamut: A Coordinatization of Mathematics
Proceedings of the Proceedings, 1995

Chu Spaces and Their Interpretation as Concurrent Objects.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
Time and Information in Sequential and Concurrent Computation.
Proceedings of the Theory and Practice of Parallel Programming, 1994

1993
The Second Calculus of Binary Relations.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Gages Accept Concurrent Behavior
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Origins of the Calculus of Binary Relations
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Arithmetic + Logic + Geometry = Concurrency.
Proceedings of the LATIN '92, 1992

The Duality of TIme and Information.
Proceedings of the CONCUR '92, 1992

1991
Dynamic algebras: Examples, constructions, applications.
Studia Logica, 1991

Modeling Concurrency with Geometry.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

Event Spaces and their Linear Logic.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
Action Logic and Pure Induction.
Proceedings of the Logics in AI, European Workshop, 1990

1989
Temporal Structures.
Proceedings of the Category Theory and Computer Science, 1989

1988
Dynamic algebras as a well-behaved fragment of relation algebras.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1987
Direct least-squares fitting of algebraic surfaces.
Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, 1987

Adaptive forward differencing for rendering curves and surfaces.
Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, 1987

Partial Order Models of Concurrency and the Computation of Functions
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
Modeling concurrency with partial orders.
International Journal of Parallel Programming, 1986

1985
Techniques for conic splines.
Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques, 1985

Font formats (panel session).
Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques, 1985

Some Constructions for Order-Theoretic Models of Concurrency.
Proceedings of the Logics of Programs, 1985

1984
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial.
Proceedings of the Seminar on Concurrency, 1984

Standards and Performance Issues in the Workstation Market.
Proceedings of the COMPCON'84, Digest of Papers, Twenty-Eighth IEEE Computer Society International Conference, San Francisco, California, USA, February 27, 1984

1983
Five Paradigm Shifts in Language Design and their Realization in Viron, a Dataflow Programming Environment.
Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

Two-way Channel with Disconnect.
Proceedings of the Analysis of Concurrent Systems, 1983

1982
On the Composition of Processes.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1981
Linear Algorithm for Data Compression via String Matching.
J. ACM, 1981

Program Logic Without Binding is Decidable.
Proceedings of the Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, 1981

Using Graphs to Understand PDL.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

A Decidable mu-Calculus: Preliminary Report
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
A Near-Optimal Method for Reasoning about Action.
J. Comput. Syst. Sci., 1980

Dynamic Algebras and the Nature of Induction
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

On Specifying Verifiers.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1979
Process Logic.
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

Axioms or Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Models of Program Logics
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

Nondeterminism in Logics of Programs.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

1977
Fast Pattern Matching in Strings.
SIAM J. Comput., 1977

Computability and Completeness in Logics of Programs (Preliminary Report)
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

The Competence/Performance Dichotomy in Programming.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

A Proof-Checker for Dynamic Logic.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

1976
A Characterization of the Power of Vector Machines.
J. Comput. Syst. Sci., 1976

The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

Semantical Considerations on Floyd-Hoare Logic
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
The Power of Negative Thinking in Multiplying Boolean Matrices.
SIAM J. Comput., 1975

Every Prime has a Succinct Certificate.
SIAM J. Comput., 1975

The Effect of Basis on Size of Boolean Expressions
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974
A Characterization of the Power of Vector Machines
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

The Power of Negative Thinking in Multiplying Boolean Matrices
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973
Time Bounds for Selection.
J. Comput. Syst. Sci., 1973

Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Top Down Operator Precedence.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

A Linguistics Oriented Programming Language.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973

On Lower Bounds for Computing the i-th Largest Element
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972
Linear Time Bounds for Median Computations
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File.
Proceedings of a symposium on the Complexity of Computer Computations, 1972

Shellsort and Sorting Networks
Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York, ISBN: 0-8240-4406-1, 1972


  Loading...