Sciweavers

61 search results - page 6 / 13
» A New Look at Causal Independence
Sort
View
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 6 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
ENTCS
2007
70views more  ENTCS 2007»
13 years 6 months ago
Component Substitutability via Equivalencies of Component-Interaction Automata
We provide a new look at formal aspects of component substitutability (replacement of a component with a new one) and independent implementability (reuse of a component in any sys...
Ivana Cerná, Pavlína Vareková...
WCRE
2010
IEEE
13 years 5 months ago
Computer-Aided Extraction of Software Components
—In a software project, outsourcing the development of a particular functionality, reusing a part in another software, or handing-over a part of the code to a new team member req...
Andreas Marx, Fabian Beck, Stephan Diehl
APSEC
2007
IEEE
14 years 1 months ago
Modeling and Learning Interaction-based Accidents for Safety-Critical Software Systems
Analyzing accidents is a vital exercise in the development of safety-critical software systems to prevent past accidents from reoccurring in the future. Current practices such as ...
Tariq Mahmood, Edmund Kazmierczak, Tim Kelly, Denn...
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 27 days ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada