Sciweavers

641 search results - page 123 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
FMCAD
2008
Springer
13 years 10 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
SBP
2010
Springer
14 years 1 months ago
Social Network Data and Practices: The Case of Friendfeed
Due to their large worldwide adoption, Social Network Sites (SNSs) have been widely used in many global events as an important source to spread news and information. While the sear...
Fabio Celli, F. Marta L. Di Lascio, Matteo Magnani...
POPL
2008
ACM
14 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
UC
2009
Springer
14 years 3 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong