Sciweavers

38 search results - page 6 / 8
» On a Logical Foundation for Explicit Substitutions
Sort
View
ICFP
2000
ACM
13 years 11 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
EUROMICRO
2009
IEEE
13 years 11 months ago
Fault-Tolerant BPEL Workflow Execution via Cloud-Aware Recovery Policies
BPEL is the de facto standard for business process modeling in today's enterprises and is a promising candidate for the integration of business and scientific applications tha...
Ernst Juhnke, Tim Dörnemann, Bernd Freisleben
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
A Type System for Data-Flow Integrity on Windows Vista
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
Avik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani
AI
2004
Springer
13 years 7 months ago
A unifying semantics for time and events
We give a formal semantics for a highly expressive language for representing temporal relationships and events. This language, which we call Versatile Event Logic (VEL), provides ...
Brandon Bennett, Antony Galton
DLOG
2003
13 years 8 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt