Sciweavers

1175 search results - page 15 / 235
» Abstract computability and algebraic specification
Sort
View
AISC
1992
Springer
13 years 11 months ago
A Type-Coercion Problem in Computer Algebra
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
Andreas Weber
ETRICS
2006
13 years 11 months ago
Possibilistic Information Flow Control in MAKS and Action Refinement
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
Dieter Hutter
CIE
2005
Springer
14 years 1 months ago
A Network Model of Analogue Computation over Metric Algebras
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
J. V. Tucker, Jeffery I. Zucker
LPAR
2010
Springer
13 years 5 months ago
ABC: Algebraic Bound Computation for Loops
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
Régis Blanc, Thomas A. Henzinger, Thibaud H...
LISP
2002
105views more  LISP 2002»
13 years 7 months ago
Specification Diagrams for Actor Systems
Abstract. Specification diagrams (SD's) are a novel form of graphical notation for specifying open distributed object systems. The design goal is to define notation for specif...
Scott F. Smith, Carolyn L. Talcott