Sciweavers

357 search results - page 15 / 72
» Monaco: A DSL Approach for Programming Automation Systems
Sort
View
ICLP
1995
Springer
15 years 1 months ago
Type Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
Christoph Beierle
ASP
2003
Springer
15 years 2 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
ECBS
2006
IEEE
158views Hardware» more  ECBS 2006»
15 years 3 months ago
Automated Translation of C/C++ Models into a Synchronous Formalism
For complex systems that are reusing intellectual property components, functional and compositional design correctness are an important part of the design process. Common system l...
Hamoudi Kalla, Jean-Pierre Talpin, David Berner, L...
92
Voted
CSE
2009
IEEE
15 years 4 months ago
Architectural Support for Automated Software Attack Detection, Recovery, and Prevention
—Attacks on software systems are an increasingly serious problem from an economic and security standpoint. Many techniques have been proposed ranging from simple compiler modifi...
Jesse Sathre, Alex Baumgarten, Joseph Zambreno
FLOPS
1999
Springer
15 years 1 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer