200 search results - page 18 / 40 » Symbolic Equivalences for Open Systems |
141
click to vote
STACS
2007
Springer
16 years 14 hour ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
180
click to vote
IJCNLP
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text...
172
click to vote
EMSOFT
2007
Springer
16 years 2 days 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...
119
click to vote
STACS
2010
Springer
16 years 26 days ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
148
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...