Sciweavers

37 search results - page 4 / 8
» Computations modulo regular chains
Sort
View
CSR
2007
Springer
14 years 1 months ago
Decidability of Parameterized Probabilistic Information Flow
In this paper, we consider the decidability of two problems related to information flow in a system with respect to some property. A flow occurs in a system if the conditional pr...
Danièle Beauquier, Marie Duflot, Yury Lifsh...
CONCUR
2011
Springer
12 years 6 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
ICDCSW
2003
IEEE
14 years 8 days ago
Foundations of Security for Hash Chains in Ad Hoc Networks
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...
Phillip G. Bradford, Olga V. Gavrylyako
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
14 years 1 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
RTA
2005
Springer
14 years 14 days ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...