Sciweavers

613 search results - page 36 / 123
» An analysis framework for network-code programs
Sort
View
ICLP
1992
Springer
15 years 1 months ago
A Declarative View of Inheritance in Logic Programming
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
Michele Bugliesi
CASCON
2001
115views Education» more  CASCON 2001»
14 years 11 months ago
Lightweight reasoning about program correctness
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
Marsha Chechik, Wei Ding
ENTCS
2007
91views more  ENTCS 2007»
14 years 9 months ago
Timed Concurrent Constraint Programming for Analysing Biological Systems
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
Julian Gutierrez, Jorge A. Pérez, Camilo Ru...
69
Voted
CAV
2007
Springer
104views Hardware» more  CAV 2007»
15 years 3 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
BMCBI
2005
122views more  BMCBI 2005»
14 years 9 months ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...