1128 search results - page 50 / 226 » Little Engines of Proof |
115
click to vote
CHES
2011
Springer
13 years 9 months ago
2011
Springer
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
ICECCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Collaborative development, incremental design and revision management require the ability to compare different versions of software artifacts. There are well-established approache...
FMCAD
2007
Springer
15 years 3 months ago
2007
Springer
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
CDC
2009
IEEE
15 years 27 days ago
2009
IEEE
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
EJC
2010
14 years 9 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...