Sciweavers

1864 search results - page 97 / 373
» Formal topology and domains
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 4 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
JSAC
2006
157views more  JSAC 2006»
15 years 6 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
ISICT
2003
15 years 7 months ago
Analysis of a mobile communication security protocol
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...
Tom Coffey, Reiner Dojen
KI
2007
Springer
16 years 15 days ago
Relational Exploration - Reconciling Plato and Aristotle
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...
Sebastian Rudolph
ACL
1992
15 years 7 months ago
Handling Linear Precedence Constraints by Unification
Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. S...
Judith Engelkamp, Gregor Erbach, Hans Uszkoreit