Sciweavers

1175 search results - page 29 / 235
» Abstract computability and algebraic specification
Sort
View
TLCA
2007
Springer
14 years 1 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
MOC
2002
136views more  MOC 2002»
13 years 7 months ago
Automatic reduction of elliptic integrals using Carlson's relations
In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions, using a group of multivariate recurre...
Norman Gray
EUROPAR
2006
Springer
13 years 11 months ago
Specification of Inefficiency Patterns for MPI-2 One-Sided Communication
Abstract. Automatic performance analysis of parallel programs can be accomplished by scanning event traces of program execution for patterns representing inefficient behavior. The ...
Andrej Kühnal, Marc-André Hermanns, Be...
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 7 months ago
Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols
ion for Epistemic Model Checking of Dining Cryptographers-based Protocols Omar I. Al-Bataineh and Ron van der Meyden School of Computer Science and Engineering, University of New S...
Omar I. Al-Bataineh, Ron van der Meyden
STACS
2007
Springer
14 years 1 months ago
A Calculus and Algebra for Distributed Data Management
Abstract. The sharing of content by communities of users (e.g., scientists) in a P2P context remains cumbersome. We argue that main reasons for this is the lack of calculus and alg...
Serge Abiteboul