Sciweavers

270 search results - page 52 / 54
» Call Invariants
Sort
View
ENTCS
2008
142views more  ENTCS 2008»
13 years 6 months ago
An Open System Operational Semantics for an Object-Oriented and Component-Based Language
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
Jasmin Christian Blanchette, Olaf Owe
BMCBI
2007
152views more  BMCBI 2007»
13 years 6 months ago
Recodon: Coalescent simulation of coding DNA sequences with recombination, migration and demography
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
Miguel Arenas, David Posada
JFP
2006
78views more  JFP 2006»
13 years 6 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
PAMI
2008
121views more  PAMI 2008»
13 years 6 months ago
Theoretical Foundations of Spatially-Variant Mathematical Morphology Part II: Gray-Level Images
In this paper, we develop a spatially-variant (SV) mathematical morphology theory for gray-level signals and images in the euclidean space. The proposed theory preserves the geomet...
Nidhal Bouaynaya, Dan Schonfeld
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 6 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard