1763 search results - page 152 / 353 » A Formalization of Polytime Functions |
147
click to vote
CAISE
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Peer-oriented computing is an attempt to weave interconnected machines into the fabric of the Internet. Service-oriented computing (exemplified by web-services), on the ...
118
click to vote
ASM
2000
ASM
15 years 8 months ago
2000
ASM
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
131
click to vote
ECOOP
1999
Springer
15 years 8 months ago
1999
Springer
We develop an imperative calculus that provides a formal model for both single and mixin inheritance. By introducing classes and mixins as the basic object-oriented constructs in a...
112
click to vote
EPIA
1999
Springer
15 years 8 months ago
1999
Springer
We present two models of hierarchical structured multi-agents, and we describe how to obtain a modal knowledge base from distributed sources. We then propose a computationally orie...
159
click to vote
POPL
1998
ACM
15 years 8 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...