Sciweavers

572 search results - page 96 / 115
» Functional Test Generation using Constraint Logic Programmin...
Sort
View
DAC
2007
ACM
14 years 8 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
VLDB
2007
ACM
77views Database» more  VLDB 2007»
14 years 1 months ago
Tracing Lineage Beyond Relational Operators
Tracing the lineage of data is an important requirement for establishing the quality and validity of data. Recently, the problem of data provenance has been increasingly addressed...
Mingwu Zhang, Xiangyu Zhang, Xiang Zhang, Sunil Pr...
CADE
1998
Springer
13 years 12 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
JSS
2002
90views more  JSS 2002»
13 years 7 months ago
Producing reliable software: an experiment
A customer of high assurance software recently sponsored a software engineering experiment in which a small real-time software system was developed concurrently by two popular sof...
Carol Smidts, Xin Huang, James C. Widmaier
ESOP
2007
Springer
13 years 11 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan