Sciweavers

173 search results - page 15 / 35
» Reasoning about VHDL using operational and observational sem...
Sort
View
PPOPP
2012
ACM
12 years 3 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
JUCS
2006
89views more  JUCS 2006»
13 years 7 months ago
Process Equivalences as Global Bisimulations
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
POLICY
2007
Springer
14 years 1 months ago
Proteus: A Semantic Context-Aware Adaptive Policy Model
The growing diffusion of portable devices enables users to benefit from anytime and anywhere impromptu collaboration. Appropriate policy models that take into account the dynamici...
Alessandra Toninelli, Rebecca Montanari, Lalana Ka...
TACAS
1999
Springer
88views Algorithms» more  TACAS 1999»
13 years 11 months ago
A Theorem Prover-Based Analysis Tool for Object-Oriented Databases
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
David Spelt, Susan Even
IJCAI
2007
13 years 8 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...