Sciweavers

1916 search results - page 210 / 384
» Reasoning with class algebra
Sort
View
FOSSACS
2007
Springer
14 years 4 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
TARK
2007
Springer
14 years 4 months ago
Preservation of epistemic properties in security protocol implementations
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
Ron van der Meyden, Thomas Wilke
CIE
2005
Springer
14 years 3 months ago
The Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
Philip D. Welch
INFOCOM
2003
IEEE
14 years 3 months ago
On the Stability of Adaptive Routing in the Presence of Congestion Control
— Efficient use of network resources has long been an important problem for large-scale network operators. To this end, several recent research efforts have proposed automated m...
Eric Anderson, Thomas E. Anderson
ASP
2003
Springer
14 years 3 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke