Sciweavers

303 search results - page 11 / 61
» Unifying Theories of Confidentiality
Sort
View
FOSSACS
2011
Springer
13 years 1 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
EACL
1993
ACL Anthology
13 years 11 months ago
Abductive Explanation of Dialogue Misunderstandings
To respond to an utterance, a listener must interpret what others have said and why they have said it. Misunderstandings occur when agents differ in their beliefs about what has b...
Susan McRoy, Graeme Hirst
UTP
2010
13 years 8 months ago
On Modelling User Observations in the UTP
This paper presents an approach for modelling interactions between users and systems in the Unifying Theories of Programming. Working in the predicate calculus, we outline generic ...
Michael J. Banks, Jeremy L. Jacob
SIGGRAPH
2010
ACM
14 years 2 months ago
Unified simulation of elastic rods, shells, and solids
We develop an accurate, unified treatment of elastica. Following the method of resultant-based formulation to its logical extreme, we derive a higher-order integration rule, or el...
Sebastian Martin, Peter Kaufmann, Mario Botsch, Ei...
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Unifying Two Graph Decompositions with Modular Decomposition
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...