Sciweavers

767 search results - page 53 / 154
» Logic for Mathematical Writing
Sort
View
POPL
2004
ACM
14 years 10 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
ACL2
2006
ACM
14 years 3 months ago
Double rewriting for equivalential reasoning in ACL2
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
Matt Kaufmann, J. Strother Moore
PAPM
2001
Springer
126views Mathematics» more  PAPM 2001»
14 years 2 months ago
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
Gabriel G. Infante López, Holger Hermanns, ...
ITP
2010
156views Mathematics» more  ITP 2010»
14 years 1 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
14 years 1 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...