Sciweavers

2145 search results - page 299 / 429
» Lax Logical Relations
Sort
View
VLSID
2005
IEEE
116views VLSI» more  VLSID 2005»
14 years 8 months ago
A Quasi-Delay-Insensitive Method to Overcome Transistor Variation
Synchronous design methods have intrinsic performance overheads due to their use of the global clock and timing assumptions. In future manufacturing processes not only may it beco...
C. Brej, Jim D. Garside
POPL
2003
ACM
14 years 8 months ago
Toward a foundational typed assembly language
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
Karl Crary
CADE
2007
Springer
14 years 8 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
CADE
2003
Springer
14 years 8 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
ICALP
2009
Springer
14 years 8 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...