Sciweavers

322 search results - page 48 / 65
» Satisfiability Coding Lemma
Sort
View
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 11 days ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
CCS
2010
ACM
13 years 8 months ago
DIFC programs by automatic instrumentation
Decentralized information flow control (DIFC) operating systems provide applications with mechanisms for enforcing information-flow policies for their data. However, significant o...
William R. Harris, Somesh Jha, Thomas W. Reps
CONCUR
2010
Springer
13 years 9 months ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
AOSD
2011
ACM
13 years 3 months ago
Experiences documenting and preserving software constraints using aspects
Software systems are increasingly being built as compositions of reusable artifacts (components, frameworks, toolkits, plug-ins, APIs, etc) that have non-trivial usage constraints...
Roberto Silveira Silva Filho, François Bron...
DAC
2002
ACM
14 years 9 months ago
Model order reduction for strictly passive and causal distributed systems
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algor...
Luca Daniel, Joel R. Phillips