362 search results - page 28 / 73 » Formal Theories for Linear Algebra |
LPAR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
GG
2004
Springer
14 years 1 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
SIGSOFT
2005
ACM
14 years 9 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...