Sciweavers

154 search results - page 19 / 31
» A Theory of Runtime Enforcement, with Results
Sort
View
ICFCA
2007
Springer
15 years 3 months ago
Some Notes on Pseudo-closed Sets
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
Sebastian Rudolph
FOAL
2009
ACM
15 years 1 months ago
Graph-based specification and simulation of featherweight Java with around advice
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
Tom Staijen, Arend Rensink
CAV
2012
Springer
236views Hardware» more  CAV 2012»
13 years 3 days ago
Lock Removal for Concurrent Trace Programs
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...
Vineet Kahlon, Chao Wang
ICFP
2003
ACM
15 years 9 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones
COLT
1994
Springer
15 years 1 months ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton