Sciweavers

30 search results - page 3 / 6
» Abstraction preservation and subtyping in distributed langua...
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 4 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
DBPL
1999
Springer
102views Database» more  DBPL 1999»
13 years 10 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
ERSHOV
2006
Springer
13 years 9 months ago
Streaming Networks for Coordinating Data-Parallel Programs
A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordinatio...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
CALCO
2009
Springer
166views Mathematics» more  CALCO 2009»
14 years 17 days ago
Distributive Lattice-Structured Ontologies
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
Hans Bruun, Dion Coumans, Mai Gehrke
CAV
2010
Springer
194views Hardware» more  CAV 2010»
13 years 10 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber