Sciweavers

1175 search results - page 16 / 235
» Abstract computability and algebraic specification
Sort
View
IFIPTCS
2000
13 years 11 months ago
Open Ended Systems, Dynamic Bisimulation and Tile Logic
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
Roberto Bruni, Ugo Montanari, Vladimiro Sassone
ACMSE
2005
ACM
14 years 1 months ago
A metaprogramming approach to generating optimized code for algorithms in linear algebra
an extended abstract for a poster that presents a new approach that employs metaprogramming to generate optimized code for algorithms in Linear Algebra. Categories and Subject Des...
Najaf A. Shah, Anthony Skjellum
JUCS
2002
113views more  JUCS 2002»
13 years 7 months ago
The Origins and the Development of the ASM Method for High Level System Design and Analysis
: The research belonging to the Abstract State Machines approach to system design and analysis is surveyed and documented in an annotated ASM bibliography. The survey covers the pe...
Egon Börger
CALCO
2009
Springer
159views Mathematics» more  CALCO 2009»
14 years 2 months ago
Complete Iterativity for Algebras with Effects
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
Stefan Milius, Thorsten Palm, Daniel Schwencke
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti