Sciweavers

1710 search results - page 85 / 342
» High-Level Programs and Program Conditions
Sort
View
MP
2010
81views more  MP 2010»
13 years 6 months ago
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
Jean-Philippe P. Richard, Mohit Tawarmalani
LOPSTR
1994
Springer
14 years 5 days ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
ENTCS
2008
150views more  ENTCS 2008»
13 years 8 months ago
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
ESOP
2007
Springer
14 years 2 months ago
Dependent Types for Low-Level Programming
In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that c...
Jeremy Condit, Matthew Harren, Zachary R. Anderson...
VMCAI
2007
Springer
14 years 2 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif