Sciweavers

513 search results - page 41 / 103
» Test Construction for Mathematical Functions
Sort
View
ICFP
2012
ACM
11 years 10 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 11 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
ET
2010
122views more  ET 2010»
13 years 5 months ago
Fault Models for Quantum Mechanical Switching Networks
This work justifies several quantum gate level fault models and discusses the causal error mechanisms thwarting correct function. A quantum adaptation of the classical test set gen...
Jacob D. Biamonte, Jeff S. Allen, Marek A. Perkows...
ICFP
2009
ACM
14 years 8 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
VL
1999
IEEE
109views Visual Languages» more  VL 1999»
14 years 3 days ago
Constraint-Based Diagram Beautification
Recently a new metaphor for diagramming, the intelligent diagram has emerged. This new metaphor provides an excellent basis for diagram beautification since it automatically colle...
Sitt Sen Chok, Kim Marriott, Tom Paton