Tractable constraints in finite semilattices

Rehof, Jakob; Mogensen, Torben Ægidius

doi:10.1016/s0167-6423(99)00011-8

Cited by 38 publications

(16 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the security levels of some variables are missing, some systems (e.g., Jif [Myers et al 2006] and FlowCaml [Simonet 2003]) try to infer security levels for them whenever possible. Since the security levels form a lattice, a typical inference algorithm encodes inference as solving constraints in a semi-lattice, where sound and complete algorithms exist (e.g., [Rehof et al 1999]).…”

Section: Information Flow Analysis and Security Labelsmentioning

confidence: 99%

“…• Partition: When a set of constraints have no overlapping predicates, e.g., (2.3), we can easily compute its solution by solving each label constraint without predicate (e.g., via the Rehof-Mogensen algorithm [Rehof et al 1999]) and merge all local solutions to a global solution.…”

Section: Overviewmentioning

confidence: 99%

“…At line 7, a label constraint solver, rmSolver (an implementation of the Rehof-Mogensen algorithm [Rehof et al 1999]) is used to solve label constraints under each predicate. rmSolver solves label constraints without predicates.…”

Section: Constraint Solving Algorithmsmentioning

confidence: 99%

See 2 more Smart Citations

A derivation framework for dependent security label inference

Zhang

2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Dependent security labels (security labels that depend on program states) in various forms have been introduced to express rich information flow policies. They are shown to be essential in the verification of real-world software and hardware systems such as conference management systems, Android Apps, a MIPS processor and a TrustZone-like architecture. However, most work assumes that all (complex) labels are provided manually, which can both be error-prone and time-consuming. In this paper, we tackle the problem of automatic label inference for static information flow analyses with dependent security labels. In particular, we propose the first general framework to facilitate the design and validation (in terms of soundness and/or completeness) of inference algorithms. The framework models label inference as constraint solving and offers guidelines for sound and/or complete constraint solving. Under the framework, we propose novel constraint solving algorithms that are both sound and complete. Evaluation result on sets of constraints generated from secure and insecure variants of a MIPS processor suggests that the novel algorithms improve the performance of an existing algorithm by orders of magnitude and offers better scalability. CCS Concepts: • Security and privacy → Information flow control; • Software and its engineering → Constraint and logic languages; Constraints; Automated static analysis;

show abstract

Section: Information Flow Analysis and Security Labelsmentioning

confidence: 99%

Section: Overviewmentioning

confidence: 99%

See 1 more Smart Citation

A derivation framework for dependent security label inference

Zhang

2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…We follow the definitions of Rehof and Mogensen (Rehof & Mogenson 1999) in introducing the concept of definite inequalities.…”

Section: Ifv(z ) (= : F(s)mentioning

confidence: 99%

“…Rehof and Mogensen have shown that satisfiability of sets of definite inequality constraints involving monotone functions in a finite meet semilattice can be decided by a lineartime algorithm (Rehof & Mogenson 1999) using a fixpoint iteration. Their notion of definite inequality generalizes the logical notion of Horn clauses from the two-point boolean lattice of the truth values to arbitrary finite semilattices.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of efficient constraint-satisfaction programs

Westfold

Smith

2001

The Knowledge Engineering Review

View full text Add to dashboard Cite

In this paper we describe the framework we have developed in KIDS (Kestrel Interactive Development System) for generating efficient constraint satisfaction programs. We have used KIDS to synthesise global search scheduling programs that have proved to be dramatically faster than other programs running the same data. We focus on the underlying ideas that lead to this efficiency. The key to the efficiency is the reduction of the size of the search space by an effective representation of sets of possible solutions (solution spaces) that allows efficient constraint propagation and pruning at the level of solution spaces. Moving to a solution space representation involves a problem reformulation. Having found a solution to the reformulated problem, an extraction phase extracts solutions to the original problem. We show how constraints from the original problem can be automatically reformulated and specialised in order to derive efficient propagation code automatically. Our solution methods exploit the semi-lattice structure of our solution spaces.

show abstract

The design and application of structured types in Ptolemy II

Zhao

Xiong

Lee

et al. 2009

Int. J. Intell. Syst.

View full text Add to dashboard Cite

Ptolemy II is a component-based design and modeling environment. It has a polymorphic type system that supports both base types and structured types, such as arrays, records, and unions. This paper presents the extensions to the base type system that support structured types. In the base type system, all the types are organized into a type lattice, and type constraints in the form of inequalities can be solved efÞciently over the lattice. We take a hierarchical and granular approach to add structured types to the lattice and extend the format of inequality constraints to allow arbitrary nesting of structured types. We also analyze the convergence of the constraint-solving algorithm on an inÞnite lattice after structured types are added. To show the application of structured types, we present two Ptolemy II models that have direct real-world background. The Þrst one describes the workßow of a charity organization, and the second one implements part of the IEEE 802.11 speciÞcation. These models make extensive use of record and union types to represent structured information. C 2009 Wiley Periodicals, Inc.

show abstract

Tractable constraints in finite semilattices

Cited by 38 publications

References 0 publications

A derivation framework for dependent security label inference

A derivation framework for dependent security label inference

Synthesis of efficient constraint-satisfaction programs

The design and application of structured types in Ptolemy II

Contact Info

Product

Resources

About