233 search results - page 7 / 47 » Specifying, Programming and Verifying with Equational Logic |
128
Voted
IJCM
2002
15 years 3 months ago
2002
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
227
Voted
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
131
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
101
Voted
CCS
2004
ACM
15 years 8 months ago
2004
ACM
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
126
Voted
FM
2003
Springer
15 years 8 months ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...