Sciweavers

584 search results - page 51 / 117
» Logic Programs as term Rewriting Systems
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
14 years 9 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
POPL
2006
ACM
15 years 10 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands
EMSOFT
2008
Springer
14 years 11 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 4 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
CIDR
2009
159views Algorithms» more  CIDR 2009»
14 years 11 months ago
RIOT: I/O-Efficient Numerical Computing without SQL
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
Yi Zhang 0011, Herodotos Herodotou, Jun Yang 0001