Sciweavers

570 search results - page 23 / 114
» From Program Verification to Program Synthesis
Sort
View
LICS
1992
IEEE
15 years 3 months ago
Compiler Verification in LF
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
John Hannan, Frank Pfenning
ENTCS
2006
123views more  ENTCS 2006»
14 years 11 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
IFIP
1999
Springer
15 years 4 months ago
A Synthesis Algorithm for Modular Design of Pipelined Circuits
: This paper presents a synthesis algorithm for pipelined circuits. The circuit is specified as a collection of independent, looselycoupled modules connected by queues. The synthe...
Maria-Cristina V. Marinescu, Martin C. Rinard
ICSE
2003
IEEE-ACM
15 years 4 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory
DSN
2004
IEEE
15 years 3 months ago
Automated Synthesis of Multitolerance
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...
Sandeep S. Kulkarni, Ali Ebnenasir