Model-Based Run-Time Error Detection

Two-Stage Programming (2SP) is an experimental programming language, the first implementation of the Specification-Consistent Coordination Model (SCCM). The SCCM proposes a new, mixed-paradigm (functional/imperative) approach to developing reliable programs based on complete run-time checking of computations with respect to a given specification. A 2SP program consists of a functional specification and an imperative coordination tightly connected to the specification. The coordination maps the specification to an imperative and possibly parallel/distributed program. Normal termination of a 2SP program execution implies the correctness of the computed results with respect to the specification, for that execution. We present the basic feautures of the SCCM/2SP, a new message-spassing system of 2SP with integrated run-time checking, and a larger case study. We show that 2SP provides: functional specifications, specification-consistent imperative coordinations, automatic run-time result verification and error detection, enhanced debugging support, and good efficiency.

Download Full-text

Run-Time Monitoring for Model-Based Testing of Distributed Systems

10.15514/syrcose-2012-6-9 ◽

2012 ◽

Author(s):

Vladimir Fedotov

Keyword(s):

Distributed Systems ◽

Model Based ◽

Model Based Testing ◽

Run Time

Download Full-text

Logic Grammars for Diagnosis and Repair

International Journal of Artificial Intelligence Tools ◽

10.1142/s0218213003001216 ◽

2003 ◽

Vol 12 (03) ◽

pp. 227-248 ◽

Cited By ~ 5

Author(s):

Henning Christiansen ◽

Veronica Dahl

Keyword(s):

Natural Language ◽

Error Detection ◽

Specific Problem ◽

Constraint Handling ◽

Proof Of Concept ◽

Top Down ◽

Bottom Up ◽

Model Based ◽

Logic Grammars

We propose an abductive model based on Constraint Handling Rule Grammars (CHRGs) for detecting and correcting errors in problem domains that can be described in terms of strings of words accepted by a logic grammar. We provide a proof of concept for the specific problem of detecting and repairing natural language errors, in particular, those concerning feature agreement. Our methodology relies on grammar and string transformation in accordance with a user-defined dictionary of possible repairs. This transformation also serves as top-down guidance for our essentially bottom-up parser. With respect to previous approaches to error detection and repair, including those that also use constraints and/or abduction, our methodology is surprisingly simple while far-reaching and efficient.

Download Full-text