Sciweavers

525 search results - page 89 / 105
» Static Interpretation of Modules
Sort
View
COOTS
1997
14 years 11 months ago
MiSFIT: A Tool for Constructing Safe Extensible C++ Systems
The boundary between application and system is becoming increasingly permeable. Extensible applications, such as web browsers, database systems, and operating systems, demonstrate...
Christopher Small
BMCBI
2008
121views more  BMCBI 2008»
14 years 9 months ago
Modularization of biochemical networks based on classification of Petri net t-invariants
Background: Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from ...
Eva Grafahrend-Belau, Falk Schreiber, Monika Heine...
78
Voted
JFP
2006
78views more  JFP 2006»
14 years 9 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
AI
2004
Springer
14 years 9 months ago
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
Ken Kaneiwa
CORR
2004
Springer
151views Education» more  CORR 2004»
14 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...