899 search results - page 122 / 180 » A CTL-Based Logic for Program Abstractions |
156
Voted
FCA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
103
click to vote
TGC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
111
click to vote
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
80
Voted
CORR
2004
Springer
15 years 10 days ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
97
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...