Sciweavers

157 search results - page 13 / 32
» Debugging formal specifications using simple counterstrategi...
Sort
View
POPL
1994
ACM
13 years 11 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 4 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
EKAW
2004
Springer
14 years 28 days ago
Graph-Based Acquisition of Expressive Knowledge
Capturing and exploiting knowledge is at the heart of several important problems such as decision making, the semantic web, and intelligent agents. The captured knowledge must be a...
Vinay K. Chaudhri, Kenneth S. Murray, John Pacheco...
ENTCS
2002
77views more  ENTCS 2002»
13 years 7 months ago
The variety of variables in computer-aided real-time programming
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Luke Wildman, Colin J. Fidge
JFP
2002
89views more  JFP 2002»
13 years 7 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton