Sciweavers

5326 search results - page 80 / 1066
» On what we can ensure
Sort
View
KR
1991
Springer
15 years 9 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
LICS
2000
IEEE
15 years 10 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
SADFE
2010
IEEE
15 years 4 months ago
Fonts for Forensics
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
Fred Cohen
WPES
2003
ACM
15 years 11 months ago
Anonymous credentials with biometrically-enforced non-transferability
We present a model and protocol for anonymous credentials. Rather than using deterrents to ensure non-transferability, our model uses secure hardware with biometric authentication...
Russell Impagliazzo, Sara Miner More
CC
2002
Springer
131views System Software» more  CC 2002»
15 years 6 months ago
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Abstract. This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C ...
George C. Necula, Scott McPeak, Shree Prakash Rahu...