Results 1  10
of
1,283,324
Assumeguarantee reasoning for deadlock
 IN: PROC. OF FMCAD.
, 2006
"... We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm L F that constructs the minimal deterministic failure autom ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm L F that constructs the minimal deterministic failure
Learningbased symbolic assumeguarantee reasoning with automatic decomposition
 In ATVA
, 2006
"... Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically based on the assumeguarantee reasoning principles, and requires decomposing the system into components as well as identify ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically based on the assumeguarantee reasoning principles, and requires decomposing the system into components as well
1AssumeGuarantee Reasoning for Deadlock
"... Abstract — We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm LF that constructs the minimal deterministic fai ..."
Abstract
 Add to MetaCart
Abstract — We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm LF that constructs the minimal deterministic
algorithm to automate assumeguarantee reasoning
, 2008
"... conquer: applying the L algorithm to automate ..."
Privacy Preserving Data Mining
 JOURNAL OF CRYPTOLOGY
, 2000
"... In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. Our work is motivated b ..."
Abstract

Cited by 512 (8 self)
 Add to MetaCart
In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information. Our work is motivated
Learningbased assumeguarantee verification
 In Proceeding of the 12th International SPIN Workshop
, 2005
"... Despite significant advances in the development of model checking, it remains a difficult task in the hands of experts to make it scale to the size of industrial systems. A key step in achieving scalability is to “divideandconquer”, that is, to break up the verification of a system into smaller ta ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Despite significant advances in the development of model checking, it remains a difficult task in the hands of experts to make it scale to the size of industrial systems. A key step in achieving scalability is to “divideandconquer”, that is, to break up the verification of a system into smaller tasks that involve the verification
Mining Sequential Patterns
, 1995
"... We are given a large database of customer transactions, where each transaction consists of customerid, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empiri ..."
Abstract

Cited by 1534 (7 self)
 Add to MetaCart
We are given a large database of customer transactions, where each transaction consists of customerid, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem
Breaking up is hard to do: An evaluation of automated assumeguarantee reasoning
 ACM Transactions on Software Engineering and Methodology
, 2008
"... Finitestate verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assumeguarantee reasoning, where a system under analysis is partitioned into subsystems and these subsystems are analyzed individually. By composing the resul ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
generating assumptions, we undertook a study to determine if assumeguarantee reasoning provides an advantage over monolithic verification. In this study, we considered all twoway decompositions for a set of systems and properties, using two different verifiers, FLAVERS and LTSA. By increasing the number
Automatic Assume/Guarantee Reasoning for
 In 1st AIOOL Workshop
, 2005
"... Assume/Guarantee (A/G) reasoning for heapmanipulating programs is challenging because the heap can be mutated in an arbitrary way by procedure calls. Moreover, specifying the potential sideeffects of a procedure is nontrivial. We report on an ongoing effort to reduce the burden of A/G reasoning ..."
Abstract
 Add to MetaCart
Assume/Guarantee (A/G) reasoning for heapmanipulating programs is challenging because the heap can be mutated in an arbitrary way by procedure calls. Moreover, specifying the potential sideeffects of a procedure is nontrivial. We report on an ongoing effort to reduce the burden of A/G reasoning
Results 1  10
of
1,283,324