Sciweavers

1716 search results - page 107 / 344
» Proving Conditional Termination
Sort
View
CORR
2011
Springer
142views Education» more  CORR 2011»
13 years 3 months ago
A Logical Method for Policy Enforcement over Evolving Audit Logs
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
Deepak Garg, Limin Jia, Anupam Datta
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
14 years 1 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
JACM
2007
84views more  JACM 2007»
13 years 8 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
ACHI
2008
IEEE
14 years 3 months ago
Spatial Auditory Interface for an Embedded Communication Device in a Car
In this paper we evaluate the safety of the driver when using an embedded communication device while driving. As a part of our research, four different tasks were preformed with t...
Jaka Sodnik, Saso Tomazic, Christina Dicke, Mark B...
ICTAC
2004
Springer
14 years 2 months ago
Inherent Causal Orderings of Partial Order Scenarios
Scenario based requirements specifications are the industry norm for defining communication protocols. Basic scenarios captured as UML sequence diagrams, Message Sequence Charts ...
Bill Mitchell