4047 search results - page 271 / 810 » Algebraic Model Checking |
185
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
181
click to vote
WAIM
2005
Springer
16 years 3 days ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
190
click to vote
CSL
1992
Springer
15 years 10 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
178
Voted
CAV
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
208
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...