Sciweavers

9626 search results - page 116 / 1926
» Invariant Based Programming
Sort
View
APLAS
2010
ACM
15 years 5 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
ESOP
2007
Springer
15 years 11 months ago
Modular Shape Analysis for Dynamically Encapsulated Programs
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard ...
Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Rama...
112
Voted
ISSRE
2005
IEEE
15 years 10 months ago
An Experimental Evaluation on Reliability Features of N-Version Programming
Although N-version programming has been employed in some mission-critical applications, the reliability and fault correlation issues remain a debatable topic in the research commu...
Xia Cai, Michael R. Lyu, Mladen A. Vouk
144
Voted
CONCUR
2008
Springer
15 years 6 months ago
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs
We present the tool Sycraft (SYmboliC synthesizeR and Adder of Fault-Tolerance). In Sycraft, a distributed fault-intolerant program is specified in terms of a set of processes and ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
FOSSACS
2008
Springer
15 years 6 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo