2661 search results - page 264 / 533 » Model Checking Performability Properties |
107
Voted
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
100
click to vote
ICSE
1995
IEEE-ACM
15 years 4 months ago
1995
IEEE-ACM
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
99
Voted
FAC
2008
15 years 26 days ago
2008
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
89
Voted
NIPS
2007
15 years 2 months ago
2007
Under natural viewing conditions, human observers shift their gaze to allocate processing resources to subsets of the visual input. Many computational models try to predict such v...
100
click to vote
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....