2911 search results - page 144 / 583 » A Logic of Graph Constraints |
122
Voted
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
90
Voted
ITRUST
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Logic languages establish a formal framework to solve authorization and delegation conflicts. However, we consider that a visual representation is necessary since graphs...
102
click to vote
FMCO
2003
Springer
15 years 6 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
124
Voted
CADE
2012
Springer
13 years 3 months ago
2012
Springer
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
100
click to vote
DSD
2007
IEEE
15 years 7 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...