William C. Rounds

43 papers A* 16B 2Journal 14Unranked 10
YearRankTypeTitle / Venue / Authors
2005 — conf
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN.
AVoCS
Hosung Song, Kevin J. Compton, William C. Rounds
2004 — conf
A Spatial Logic for the Hybrid p-Calculus.
HSCC
William C. Rounds
2004 J jnl
Reasoning with power defaults.
Theor. Comput. Sci.
Guo-Qiang Zhang, William C. Rounds
2003 — conf
The Phi-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems.
HSCC
William C. Rounds, Hosung Song
2001 J jnl
Clausal Logic and Logic Programming in Algebraic Domains.
Inf. Comput.
William C. Rounds, Guo-Qiang Zhang
1998 — conf
Experimenting with Power Default Reasoning.
AAAI/IAAI
Eric Klavins, William C. Rounds, Guo-Qiang Zhang
1997 — conf
A Modal Logic for Reasoning about Belief.
HICSS (5)
Guo-Qiang Zhang, Chang Huang, William C. Rounds
1997 A* conf
Complexity of Power Default Reasoning.
LICS
Guo-Qiang Zhang, William C. Rounds
1997 J jnl
Defaults in Domain Theory.
Theor. Comput. Sci.
Guo-Qiang Zhang, William C. Rounds
1997 — ch.
Feature Logics.
Handbook of Logic and Language
William C. Rounds
1997 J jnl
Logical Considerations on Default Semantics.
Ann. Math. Artif. Intell.
William C. Rounds, Guo-Qiang Zhang
1997 J jnl
Nonmonotonic Consequences in Default Domain Theory.
Ann. Math. Artif. Intell.
Guo-Qiang Zhang, William C. Rounds
1997 B conf
Power Defaults.
LPNMR
Guo-Qiang Zhang, William C. Rounds
1997 B conf
Resolution in the Smyth powerdomain.
MFPS
Guo-Qiang Zhang, William C. Rounds
1995 J jnl
Domain Theory Meets Default Logic.
J. Log. Comput.
William C. Rounds, Guo-Qiang Zhang
1993 A* conf
A Logical Semantics for Nonmonotonic Sorts.
ACL
Mark A. Young, William C. Rounds
1993 — conf
Constraints in Nonmonotonic Reasoning.
PPCP
William C. Rounds, Guo-Qiang Zhang
1992 J jnl
On Subsumption and Semiunifaction in Feature Algebras.
J. Symb. Comput.
Jochen Dörre, William C. Rounds
1990 A* conf
On Subsumption and Semiunification in Feature Algebras
LICS
Jochen Dörre, William C. Rounds
1989 J jnl
On Subsumption and Semiunifaction in Feature Algebras
IWBS Report
Jochen Dörre, William C. Rounds
1988 J jnl
LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity.
Comput. Linguistics
William C. Rounds
1987 A* conf
A Logic for Partially Specified Data Structures.
POPL
M. Drew Moshier, William C. Rounds
1987 A* conf
A Logical Version of Functional Grammar.
ACL
William C. Rounds, Alexis Manaster-Ramer
1987 A* conf
On the Succinctness Properties of Unordered Context-Free Grammars.
ACL
M. Drew Moshier, William C. Rounds
1987 J jnl
Simultaneous-Distributive Coordination and Context-Freeness.
Comput. Linguistics
Michael B. Kac, Alexis Manaster-Ramer, William C. Rounds
1986 A* conf
A Complete Logical Calculus for Record Structures Representing Linguistic Information
LICS
William C. Rounds, Robert T. Kasper
1985 J jnl
On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces
Inf. Control.
William C. Rounds
1984 — conf
Applications of Topology to Semantics of Communicating Processes.
Seminar on Concurrency
William C. Rounds
1983 A* conf
Behavioural Equivalence Relations Induced by Programming Logics.
ICALP
Stephen D. Brookes, William C. Rounds
1983 J jnl
Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees
Inf. Control.
William G. Golson, William C. Rounds
1981 A* conf
Possible Futures, Acceptances, Refusals, and Communicating Processes
FOCS
William C. Rounds, Stephen D. Brookes
1979 — conf
On Properties Preserved by Contraction of Concurrent Systems.
Semantics of Concurrent Computation
John S. Gourlay, William C. Rounds, Richard Statman
1978 A* conf
Complexity of Expressions Allowing Concurrency.
POPL
William F. Ogden, William E. Riddle, William C. Rounds
1975 A* conf
A Grammatical Characterization of Exponential-Time Languages
FOCS
William C. Rounds
1975 A* conf
On the Complexity of the Circularity Test for Attribute Grammars.
POPL
Mehdi Jazayeri, William F. Ogden, William C. Rounds
1975 A* ed.
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, May 5-7, 1975, Albuquerque, New Mexico, USA
STOC
William C. Rounds, Nancy Martin, Jack W. Carlyle, Michael A. Harrison
1975 — conf
Structured specification of a Security Kernel.
Reliable Software
Kenneth G. Walter, Samuel I. Schaen, William F. Ogden, William C. Rounds, D. G. Shumway, D. D. Schaeffer, K. J. Biba, Franklyn T. Bradshaw, S. R. Ames, J. M. Gilligan
1975 J jnl
The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.
Commun. ACM
Mehdi Jazayeri, William F. Ogden, William C. Rounds
1973 — conf
Complexity of Recognition in Intermediate-Level Languages
SWAT
William C. Rounds
1972 A* conf
Compositions of n Tree Transducers
STOC
William F. Ogden, William C. Rounds
1970 J jnl
Mappings and Grammars on Trees.
Math. Syst. Theory
William C. Rounds
1970 A* conf
Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages
STOC
William C. Rounds
1969 A* conf
Context-Free Grammars on Trees
STOC
William C. Rounds