Sciweavers

1368 search results - page 44 / 274
» Recursive modules for programming
Sort
View
CAV
2006
Springer
146views Hardware» more  CAV 2006»
13 years 11 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
CASCON
1996
118views Education» more  CASCON 1996»
13 years 9 months ago
On predicting reliability of modules using code coverage
The estimation of reliability of modules using code coverage is motivated by a two-phase method for estimating the quality of software using static structure and predicted quality...
Saileshwar Krishnamurthy, Aditya P. Mathur
CTCS
1987
Springer
13 years 11 months ago
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...
Tatsuya Hagino
ICALP
1998
Springer
14 years 2 days ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
ESOP
2006
Springer
13 years 11 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed