Sciweavers

65 search results - page 13 / 13
» Foundations of Modular SOS
Sort
View
CSL
2010
Springer
13 years 6 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
BMCBI
2010
164views more  BMCBI 2010»
13 years 5 months ago
Investigating the validity of current network analysis on static conglomerate networks by protein network stratification
Background: A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform networ...
Minlu Zhang, Long J. Lu
AMAI
2000
Springer
13 years 5 months ago
The logic of events
An event space is a set of instantaneous events that vary both in time and specificity. The concept of an event space provides a foundation for a logical--i.e., modular and open-a...
Glenn Shafer, Peter R. Gillett, Richard B. Scherl
SIGSOFT
2010
ACM
13 years 3 months ago
Managing technical debt in software-reliant systems
Delivering increasingly complex software-reliant systems demands better ways to manage the long-term effects of shortterm expedients. The technical debt metaphor is gaining signif...
Nanette Brown, Yuanfang Cai, Yuepu Guo, Rick Kazma...
PLDI
2011
ACM
12 years 8 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...