Sciweavers

379 search results - page 8 / 76
» Generalized Typestate Checking for Data Structure Consistenc...
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 6 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
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 7 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
JDM
2006
77views more  JDM 2006»
13 years 7 months ago
Semantic Integrity Constraint Checking for Multiple XML Databases
Global semantic integrity constraints ensure integrity and consistency of data spanning multiple databases. In this paper, we take the initial steps towards representing global se...
Praveen Madiraju, Rajshekhar Sunderraman, Shamkant...
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 2 months ago
Psi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
DKE
2002
113views more  DKE 2002»
13 years 7 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...