Sciweavers

4693 search results - page 346 / 939
» Verifying Hybrid Systems
Sort
View
TPHOL
2003
IEEE
16 years 11 hour ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
CC
2001
Springer
103views System Software» more  CC 2001»
15 years 11 months ago
Design-Driven Compilation
This paper introduces design-driven compilation, an approach in which the compiler uses design information to drive its analysis and verify that the program conforms to its design....
Radu Rugina, Martin C. Rinard
DAC
1997
ACM
15 years 10 months ago
Formal Verification of a Superscalar Execution Unit
Abstract. Many modern systems are designed as a set of interconnected reactive subsystems. The subsystem verification task is to verify an implementation of the subsystem against t...
Kyle L. Nelson, Alok Jain, Randal E. Bryant
CIE
2008
Springer
15 years 8 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
SP
2008
IEEE
187views Security Privacy» more  SP 2008»
15 years 6 months ago
Efficient and Robust TCP Stream Normalization
Network intrusion detection and prevention systems are vulnerable to evasion by attackers who craft ambiguous traffic to breach the defense of such systems. A normalizer is an inl...
Mythili Vutukuru, Hari Balakrishnan, Vern Paxson