Sciweavers

3221 search results - page 300 / 645
» Termination of Linear Programs
Sort
View
EOR
2006
71views more  EOR 2006»
15 years 6 months ago
Control and optimal response problems for quasilinear impulsive integrodifferential equations
One of the central results of the paper is the Pontryagin maximum principle [16] which is considered in sufficient form for the linear case of impulsive differential equations. Th...
M. U. Akhmet, M. Kirane, M. A. Tleubergenova, Gerh...
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 6 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
ESOP
2009
Springer
16 years 1 months ago
All Secrets Great and Small
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...
Delphine Demange, David Sands
ISSTA
2004
ACM
15 years 12 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
ENTCS
2002
134views more  ENTCS 2002»
15 years 6 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells