Sciweavers

5536 search results - page 855 / 1108
» Programming Languages for Distributed Applications
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 1 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ENTCS
2006
127views more  ENTCS 2006»
15 years 1 months ago
Capability-Passing Processes
Capability passing processes model global applications in a way that decouples the global agreement aspects of protocols from the details of how the communications are actually ma...
Tom Chothia, Dominic Duggan
JAR
2008
89views more  JAR 2008»
15 years 1 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 1 months ago
Models and Tools for Collaborative Annotation
The Annotation Graph Toolkit (AGTK) is a collection of software which facilitates development of linguistic annotation tools. AGTK provides a database interface which allows appli...
Xiaoyi Ma, Haejoong Lee, Steven Bird, Kazuaki Maed...
ENTCS
2007
123views more  ENTCS 2007»
15 years 1 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...