Sciweavers

10156 search results - page 1703 / 2032
» Step by Step to Histories
Sort
View
CADE
2005
Springer
16 years 8 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 8 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
OSDI
2008
ACM
16 years 7 months ago
Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
Xu Chen, Ming Zhang, Zhuoqing Morley Mao, Paramvir...
OSDI
2008
ACM
16 years 7 months ago
Experiences with Content Addressable Storage and Virtual Disks
Efficiently managing storage is important for virtualized computing environments. Its importance is magnified by developments such as cloud computing which consolidate many thousa...
Anthony Liguori, Eric Van Hensbergen
ICALP
2009
Springer
16 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
« Prev « First page 1703 / 2032 Last » Next »