Showing papers by "Christian Schallhart published in 2015"
TL;DR: This paper provides a systematic theoretical foundation for FQL test specifications, which are in fact rational sets of regular languages (RSRLs), and proves complexity results for equivalence, inclusion, and membership checking.
1 citations
Patent•
30 Sep 2015
TL;DR: In this article, the authors propose a system for automatically generating a wrapper for an entire website, the wrapper characterizing the structure of the website, having a plurality of functional elements, including at least one annotation module to classify components of a page and generate an annotated, a page classification module to identify functional and informational components of annotated page, and an action to be taken to further navigate the website.
Abstract: A system for automatically generating a wrapper for an entire website, the wrapper characterizing the structure of the website, the system having a plurality of functional elements, including at least one annotation module to classify components of a page and generate an annotated, a page classification module to identify functional and informational components of an annotated page, and an action module to identify an action to be taken to further navigate the website, wherein at least one of the annotation module, page classification module and action module is operable in response to a plurality of domain-specific rules, where a domain is understood as a conceptual domain such as real estate, used cars, or electronics.
Journal Article•
TL;DR: Recent work that forms a significant step towards practically realizable STCs that can be integrated into modern software engineering frameworks are discussed, including the compiler CBMC-GC which uses model checking techniques to automatically generate efficient STC protocols from ANSI C programs.
Abstract: Secure two-party computation (STC) is a computer security paradigm that enables two distrusting parties to jointly compute on sensitive input data. While both parties are interested in the outcome of the computation, they are not willing to share their data with each other. Until recently, STC was deemed theoretical and impractical. However, novel efficient cryptographic primitives bring STC well within practical reach. Indeed, custom-tailored commercial STC products already appeared on the market. Unfortunately, a widespread application of STC is still hindered by the difficulty to implement STC protocols. While recent work proposed simple programming languages for the specification of STCs, they are still difficult to use for practitioners, and translating existing source code into this format is cumbersome. Similarly, the manual construction of STC protocols is labor intensive and error-prone. We discuss recent work that forms a significant step towards practically realizable STCs that can be integrated into modern software engineering frameworks. In particular, we discuss the compiler CBMC-GC which uses model checking techniques to automatically generate efficient STC protocols from ANSI C programs. Experimental results demonstrate CBMC-GC’s practical usefulness.