233 search results - page 7 / 47 » Specifying, Programming and Verifying with Equational Logic |
IJCM
2002
13 years 7 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...
ECOOP
2009
Springer
14 years 8 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...
CORR
2008
Springer
13 years 7 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...
CCS
2004
ACM
14 years 24 days 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 ...
FM
2003
Springer
14 years 18 days 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 ...