4513 search results - page 322 / 903 » Logic programming with satisfiability |
116
click to vote
TAPSOFT
1997
Springer
15 years 8 months ago
1997
Springer
This paper presents a type system which guarantees that well-typed programs in a procedural programming language satisfy a noninterference security property. With all program input...
164
click to vote
ANOR
2011
14 years 11 months ago
2011
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
160
Voted
ENTCS
2002
15 years 4 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
139
click to vote
SAS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
124
click to vote
FOSAD
2009
Springer
15 years 8 months ago
2009
Springer
A program verifier is a tool that allows developers to prove that their code satisfies its specification for every possible input and every thread schedule. These lecture notes des...