2000 search results - page 309 / 400 » Program Transformation and Proof Transformation |
129
Voted
ENTCS
2008
15 years 3 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
142
click to vote
ENTCS
2008
15 years 3 months ago
2008
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
133
click to vote
KI
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decisiontheoretic polic...
136
click to vote
JUCS
2002
15 years 3 months ago
2002
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
136
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
A design method of a linear-phased, two-dimensional (2-D), twofold symmetric circular shaped filter is presented in this paper. Although the proposed method designs a non-separab...