Sciweavers

321 search results - page 4 / 65
» A Model for Change Propagation Based on Graph Rewriting
Sort
View
SYNASC
2007
IEEE
119views Algorithms» more  SYNASC 2007»
14 years 1 months ago
Graph Rewriting and Strategies for Modeling Biochemical Networks
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
Oana Andrei, Hélène Kirchner
ENTCS
2007
101views more  ENTCS 2007»
13 years 7 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...
CADE
2000
Springer
13 years 11 months ago
Two Techniques to Improve Finite Model Search
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
Gilles Audemard, Belaid Benhamou, Laurent Henocque
ESORICS
2004
Springer
14 years 22 days ago
Security Property Based Administrative Controls
Abstract. Access control languages which support administrative controls, and thus allow the ordinary permissions of a system to change, have traditionally been constructed with ...
Jon A. Solworth, Robert H. Sloan
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 11 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz