Sciweavers

58 search results - page 9 / 12
» From Implicit via Inductive to Explicit Definitions
Sort
View
POPL
2006
ACM
14 years 8 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
GG
2010
Springer
13 years 8 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
ICOST
2007
Springer
14 years 1 months ago
A Context-Driven Programming Model for Pervasive Spaces
This paper defines a new, context-driven programming model for pervasive spaces. Existing models are prone to conflict, as it is hard to predict the outcome of interleaved actions ...
Hen-I Yang, Jeffrey King, Abdelsalam Helal, Erwin ...
SEMWEB
2010
Springer
13 years 5 months ago
Fusion - Visually Exploring and Eliciting Relationships in Linked Data
Building applications over Linked Data often requires a mapping between the application model and the ontology underlying the source dataset in the Linked Data cloud. This mapping ...
Samur Araújo, Geert-Jan Houben, Daniel Schw...
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
14 years 1 months ago
Bayesianism Without Priors, Acts Without Consequences
: A generalization of subjective expected utility is presented in which the primitives are a finite set of states of the world, a finite set of strategies available to the decision...
Robert Nau