 | 2006 |
|---|
| 38 |       | Hosung Song,
Kevin J. Compton,
William C. Rounds:
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN.
Electr. Notes Theor. Comput. Sci. 145: 167-183 (2006) |
| 2004 |
|---|
| 37 | | William C. Rounds:
A Spatial Logic for the Hybrid p-Calculus.
HSCC 2004: 508-522 |
| 36 | | Guo-Qiang Zhang,
William C. Rounds:
Reasoning with power defaults.
Theor. Comput. Sci. 323(1-3): 321-350 (2004) |
| 2003 |
|---|
| 35 | | William C. Rounds,
Hosung Song:
The Phi-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems.
HSCC 2003: 435-449 |
| 2001 |
|---|
| 34 | | William C. Rounds,
Guo-Qiang Zhang:
Clausal Logic and Logic Programming in Algebraic Domains.
Inf. Comput. 171(2): 183-200 (2001) |
| 1998 |
|---|
| 33 |  | Eric Klavins,
William C. Rounds,
Guo-Qiang Zhang:
Experimenting with Power Default Reasoning.
AAAI/IAAI 1998: 846-852 |
| 1997 |
|---|
| 32 | | Guo-Qiang Zhang,
Chang Huang,
William C. Rounds:
A Modal Logic for Reasoning about Belief.
HICSS (5) 1997: 383- |
| 31 | | Guo-Qiang Zhang,
William C. Rounds:
Complexity of Power Default Reasoning.
LICS 1997: 328-339 |
| 30 | | Guo-Qiang Zhang,
William C. Rounds:
Power Defaults.
LPNMR 1997: 152-169 |
| 29 | | William C. Rounds,
Guo-Qiang Zhang:
Logical Considerations on Default Semantics.
Ann. Math. Artif. Intell. 20(1-4): 195-226 (1997) |
| 28 | | Guo-Qiang Zhang,
William C. Rounds:
Nonmonotonic Consequences in Default Domain Theory.
Ann. Math. Artif. Intell. 20(1-4): 227-265 (1997) |
| 27 | | Guo-Qiang Zhang,
William C. Rounds:
Resolution in the Smyth powerdomain.
Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 26 | | Guo-Qiang Zhang,
William C. Rounds:
Defaults in Domain Theory.
Theor. Comput. Sci. 177(1): 155-182 (1997) |
| 1995 |
|---|
| 25 | | William C. Rounds,
Guo-Qiang Zhang:
Domain Theory Meets Default Logic.
J. Log. Comput. 5(1): 1-25 (1995) |
| 1993 |
|---|
| 24 | | Mark A. Young,
William C. Rounds:
A Logical Semantics for Nonmonotonic Sorts.
ACL 1993: 209-215 |
| 23 | | William C. Rounds,
Guo-Qiang Zhang:
Constraints in Nonmonotonic Reasoning.
PPCP 1993: 247-257 |
| 1992 |
|---|
| 22 | | Jochen Dörre,
William C. Rounds:
On Subsumption and Semiunifaction in Feature Algebras.
J. Symb. Comput. 13(4): 441-461 (1992) |
| 1990 |
|---|
| 21 | | Jochen Dörre,
William C. Rounds:
On Subsumption and Semiunification in Feature Algebras
LICS 1990: 300-310 |
| 1989 |
|---|
| 20 | | Jochen Dörre,
William C. Rounds:
On Subsumption and Semiunifaction in Feature Algebras
IWBS Report 97: (1989) |
| 1988 |
|---|
| 19 | | William C. Rounds:
LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity.
Computational Linguistics 14(3): 1-9 (1988) |
| 1987 |
|---|
| 18 | | M. Drew Moshier,
William C. Rounds:
A Logic for Partially Specified Data Structures.
POPL 1987: 156-167 |
| 17 | | Michael B. Kac,
Alexis Manaster-Ramer,
William C. Rounds:
Simultaneous-Distributive Coordination and Context-Freeness.
Computational Linguistics 13(1-2): 25-30 (1987) |
| 1986 |
|---|
| 16 | | William C. Rounds,
Robert T. Kasper:
A Complete Logical Calculus for Record Structures Representing Linguistic Information
LICS 1986: 38-43 |
| 1985 |
|---|
| 15 | | William C. Rounds:
On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces
Information and Control 66(1/2): 6-28 (1985) |
| 1984 |
|---|
| 14 | | William C. Rounds:
Applications of Topology to Semantics of Communicating Processes.
Seminar on Concurrency 1984: 360-372 |
| 1983 |
|---|
| 13 | | Stephen D. Brookes,
William C. Rounds:
Behavioural Equivalence Relations Induced by Programming Logics.
ICALP 1983: 97-108 |
| 12 | | William G. Golson,
William C. Rounds:
Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees
Information and Control 57(2/3): 102-124 (1983) |
| 1981 |
|---|
| 11 | | William C. Rounds,
Stephen D. Brookes:
Possible Futures, Acceptances, Refusals, and Communicating Processes
FOCS 1981: 140-149 |
| 1979 |
|---|
| 10 | | John S. Gourlay,
William C. Rounds,
Richard Statman:
On Properties Preserved by Contraction of Concurrent Systems.
Semantics of Concurrent Computation 1979: 51-65 |
| 1978 |
|---|
| 9 | | William F. Ogden,
William E. Riddle,
William C. Rounds:
Complexity of Expressions Allowing Concurrency.
POPL 1978: 185-194 |
| 1975 |
|---|
| 8 | | William C. Rounds:
A Grammatical Characterization of Exponential-Time Languages
FOCS 1975: 135-143 |
| 7 | | Mehdi Jazayeri,
William F. Ogden,
William C. Rounds:
On the Complexity of the Circularity Test for Attribute Grammars.
POPL 1975: 119-129 |
| 6 | | Mehdi Jazayeri,
William F. Ogden,
William C. Rounds:
The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.
Commun. ACM 18(12): 697-706 (1975) |
| 1973 |
|---|
| 5 | | William C. Rounds:
Complexity of Recognition in Intermediate-Level Languages
FOCS 1973: 145-158 |
| 1972 |
|---|
| 4 | | William F. Ogden,
William C. Rounds:
Compositions of n Tree Transducers
STOC 1972: 198-206 |
| 1970 |
|---|
| 3 | | William C. Rounds:
Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages
STOC 1970: 109-116 |
| 2 | | William C. Rounds:
Mappings and Grammars on Trees.
Mathematical Systems Theory 4(3): 257-287 (1970) |
| 1969 |
|---|
| 1 | | William C. Rounds:
Context-Free Grammars on Trees
STOC 1969: 143-148 |
