Sciweavers

428 search results - page 9 / 86
» Completeness of a Fact Extractor
Sort
View
FMCAD
2009
Springer
14 years 4 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
LPAR
2001
Springer
14 years 2 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
IEE
2007
104views more  IEE 2007»
13 years 9 months ago
Complete distributed garbage collection using DGC-consistent cuts and .NET AOP-support
: The memory management of distributed objects, when done manually, is an error-prone task. It leads to memory leaks and dangling references, causing applications to fail. Avoiding...
Luís Veiga, P. Pereira, Paulo Ferreira
POPL
2007
ACM
14 years 10 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
FOCS
2009
IEEE
14 years 4 months ago
Bit Encryption Is Complete
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
Steven Myers, Abhi Shelat