Sciweavers

2911 search results - page 229 / 583
» A Logic of Graph Constraints
Sort
View
SIROCCO
2001
15 years 8 months ago
Cycle Covering
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
Jean-Claude Bermond, Lilian Chacon, David Coudert,...
TCAD
1998
82views more  TCAD 1998»
15 years 6 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...
PASTE
2004
ACM
16 years 6 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
NDJFL
2000
97views more  NDJFL 2000»
15 years 6 months ago
Neo-Fregean Foundations for Real Analysis: Some Reflections on Frege's Constraint
now of a number of ways of developing Real Analysis on a basis of abstraction principles and second-order logic. One, outlined by Shapiro in his contribution to this volume, mimic...
Crispin Wright
KBSE
2010
IEEE
15 years 5 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer