Sciweavers

288 search results - page 39 / 58
» Interactive Termination Proofs Using Termination Cores
Sort
View
HICSS
2009
IEEE
107views Biometrics» more  HICSS 2009»
15 years 4 months ago
EM Enforcing Information Flow Properties using Compensating Events
Deeply embedded infrastructures are pervasive systems that have significant cyber and physical components, interacting with each other in complex ways. These interactions can vio...
Thoshitha T. Gamage, Bruce M. McMillin
AIML
2008
14 years 11 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
JACM
2007
84views more  JACM 2007»
14 years 9 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
ICML
1998
IEEE
15 years 10 months ago
Intra-Option Learning about Temporally Abstract Actions
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
Richard S. Sutton, Doina Precup, Satinder P. Singh
IPPS
2009
IEEE
15 years 4 months ago
DMTCP: Transparent checkpointing for cluster computations and the desktop
DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wid...
Jason Ansel, Kapil Arya, Gene Cooperman