Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
227
The PCP theorem by gap amplification
- In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing
, 2006
"... The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The celebrated equivalence of this theorem and inapproximability of certain optimization problems, due to [12], has placed the PC ..."
Abstract
-
Cited by 166 (8 self)
- Add to MetaCart
of “graph powering ” that can be applied to systems of binary constraints. This powering amplifies the unsat-value of a constraint system provided that the underlying graph structure is an expander. We also extend our amplification lemma towards construction of assignment testers (alternatively, PCPs
Towards formally verifiable resource bounds for real-time embedded systems
- ACM SIGBED Review— Special issues
, 2006
"... This paper describes ongoing work aimed at the construction of formal cost models and analyses that are capable of producing verifiable guarantees of resource usage (space, time and ultimately power consumption) in the context of real-time embedded systems. Our work is conducted in terms of the doma ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
This paper describes ongoing work aimed at the construction of formal cost models and analyses that are capable of producing verifiable guarantees of resource usage (space, time and ultimately power consumption) in the context of real-time embedded systems. Our work is conducted in terms
Towards Formally Verifiable WCET Analysis for a Functional Programming Language
- Proceedings of the 6th International Workshop on Worst-Case Execution Time (WCET) Analysis, Dagstuhl
"... This paper describes ongoing work aimed at the construction of formal cost models and analyses to yield verifiable guarantees of resource usage in the context of real-time embedded systems. Our work is conducted in terms of the domain-specific language Hume, a language that combines functional progr ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
This paper describes ongoing work aimed at the construction of formal cost models and analyses to yield verifiable guarantees of resource usage in the context of real-time embedded systems. Our work is conducted in terms of the domain-specific language Hume, a language that combines functional
studies: Beyond binaries
"... Let me begin by congratulating Michael Di Giovine on his initiative and thanking him for his invitation to comment on this interesting collection of papers. His initia-tive refl ects two key features of pilgrimage studies – an openness towards the multi-facetted nature of pilgrimage and a willingnes ..."
Abstract
- Add to MetaCart
willingness to operate across disciplinary bounda-ries in order to understand pilgrimage's many faces. In the short space available, I want to comment on some theoretical issues which the papers raised for me. Th e fi rst refers to the use of binaries. Binaries have long been used in Western intellectual
Generating customized verifiers for automatically generated code
- In GPCE’08
, 2008
"... Program verification using Hoare-style techniques requires many logical annotations. We have previously developed a generic annotation inference algorithm that weaves in all annotations required to certify safety properties for automatically generated code. It uses patterns to capture generator- and ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
and error-prone low-level term manipulations. Here, we describe an annotation schema compiler that largely automates this customization task using generative techniques. It takes a collection of high-level declarative annotation schemas tailored towards a specific code generator and safety property
Towards Formally Verified Optimizing Compilation in Flight Control Software, in "Bringing Theory to Practice: Predictability and Performance
- in Embedded Systems (PPES 2011)", OpenAccess Series in Informatics (OASIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
"... This work presents a preliminary evaluation of the use of the CompCert formally specified and verified optimizing compiler for the development of level A critical flight control software. First, the motivation for choosing CompCert is presented, as well as the requirements and constraints for safety ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
This work presents a preliminary evaluation of the use of the CompCert formally specified and verified optimizing compiler for the development of level A critical flight control software. First, the motivation for choosing CompCert is presented, as well as the requirements and constraints
Leakage-Resilient Symmetric Cryptography Under Empirically Verifiable Assumptions
"... Abstract. Leakage-resilient cryptography aims at formally proving the security of cryptographic implementations against large classes of side-channel adversaries. One important challenge for such an approach to be relevant is to adequately connect the formal models used in the proofs with the practi ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
with the practice of side-channel attacks. It raises the fundamental problem of finding reasonable restrictions of the leakage functions that can be empirically verified by evaluation laboratories. In this paper, we first argue that the previous “bounded leakage ” requirements used in leakage-resilient cryptography
Towards Integral Binary Execution: Implementing Oblivious Hashing Using Overlapped Instruction Encodings
, 2007
"... Executing binaries without interference by an outside adversary has been an ongoing duel between protection methods and attacks. Recently, an efficient kernel-patch attack has been presented against commonly used self-checking code techniques that use checksumming ahead of execution. While methods b ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Executing binaries without interference by an outside adversary has been an ongoing duel between protection methods and attacks. Recently, an efficient kernel-patch attack has been presented against commonly used self-checking code techniques that use checksumming ahead of execution. While methods
Predictable Binary Code Cache: A First Step Towards Reconciling Predictability and Just-In-Time Compilation
, 2011
"... Abstract—Virtualization and just-in-time (JIT) compilation have become important paradigms in computer science to address application portability issues without deteriorating average-case performance. Unfortunately, JIT compilation raises predictability issues, which currently hinder its disseminati ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—Virtualization and just-in-time (JIT) compilation have become important paradigms in computer science to address application portability issues without deteriorating average-case performance. Unfortunately, JIT compilation raises predictability issues, which currently hinder its
Binary Source Parallactic Effect in Gravitational Micro-lensing
, 1997
"... The first micro-lensing event discovered towards the Small Magellanic Cloud by the MACHO collaboration (Alcock et al. 1997b) had a very long time scale, t0 = 123 days. The EROS collaboration (Palanque-Delabrouille et al. 1997) discovered a ∼ 2.5 % brightness variation with a period P = 5.1 days. The ..."
Abstract
- Add to MetaCart
Porb = 10.2 days, with its component(s) tidally distorted. Such objects are known as ellipsoidal variables. The binary nature should be verified spectroscopically. Binary motion of the source introduces a parallactic effect into micro-lensing light curve, and a few examples are shown. The effect
Results 1 - 10
of
227
