Sciweavers

632 search results - page 69 / 127
» Combining programming with theorem proving
Sort
View
ENTCS
2008
116views more  ENTCS 2008»
13 years 8 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
MSCS
1998
58views more  MSCS 1998»
13 years 7 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
TAP
2010
Springer
145views Hardware» more  TAP 2010»
13 years 5 months ago
QuickSpec: Guessing Formal Specifications Using Testing
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
Koen Claessen, Nicholas Smallbone, John Hughes
RTA
2005
Springer
14 years 1 months ago
Natural Narrowing for General Term Rewriting Systems
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
Santiago Escobar, José Meseguer, Prasanna T...
FAC
2000
124views more  FAC 2000»
13 years 7 months ago
Algebraic Models of Correctness for Microprocessors
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
Anthony C. J. Fox, Neal A. Harman