Sciweavers

949 search results - page 126 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
FMCAD
2000
Springer
14 years 13 days ago
Scalable Distributed On-the-Fly Symbolic Model Checking
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
Shoham Ben-David, Tamir Heyman, Orna Grumberg, Ass...
JAR
2000
145views more  JAR 2000»
13 years 8 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
ENTCS
2006
185views more  ENTCS 2006»
13 years 8 months ago
Time Domain Verification of Oscillator Circuit Properties
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
Goran Frehse, Bruce H. Krogh, Rob A. Rutenbar, Ode...
WWW
2009
ACM
14 years 9 months ago
The slashdot zoo: mining a social network with negative edges
We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other use...
Andreas Lommatzsch, Christian Bauckhage, Jé...
BIRTHDAY
2004
Springer
14 years 2 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira