788 search results - page 102 / 158 » Symbolic Equivalence Checking |
CCS
2009
ACM
14 years 2 months ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types a...
EUROCOLT
1999
Springer
14 years 19 hour ago
1999
Springer
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
IJSI
2008
13 years 7 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...