Sciweavers

5904 search results - page 577 / 1181
» Requirements for a Composition Language
Sort
View
IJFCS
2007
105views more  IJFCS 2007»
15 years 7 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
JFP
2007
111views more  JFP 2007»
15 years 7 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
IWMM
2011
Springer
206views Hardware» more  IWMM 2011»
14 years 10 months ago
A comprehensive evaluation of object scanning techniques
At the heart of all garbage collectors lies the process of identifying and processing reference fields within an object. Despite its key role, and evidence of many different impl...
Robin Garner, Stephen M. Blackburn, Daniel Frampto...
ICDE
2005
IEEE
137views Database» more  ICDE 2005»
16 years 8 months ago
Extending Relational Database Systems to Automatically Enforce Privacy Policies
Databases are at the core of successful businesses. Due to the voluminous stores of personal data being held by companies today, preserving privacy has become a crucial requiremen...
Rakesh Agrawal, Paul Bird, Tyrone Grandison, Jerry...
IFIP
2005
Springer
16 years 23 days ago
Recovering Digital Evidence from Linux Systems
As Linux kernel-based operating systems gain market share there will be an inevitable increase in Linux systems that law enforcement agents must process at cybercrime scenes. The ...
Philip Craiger