Sciweavers

392 search results - page 71 / 79
» An Algebraic Representation of Calendars
Sort
View
CSL
1999
Springer
14 years 2 months ago
Pre-logical Relations
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
Furio Honsell, Donald Sannella
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 2 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
TAPSOFT
1997
Springer
14 years 2 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
ITC
1994
IEEE
151views Hardware» more  ITC 1994»
14 years 2 months ago
Automated Logic Synthesis of Random-Pattern-Testable Circuits
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
Nur A. Touba, Edward J. McCluskey
LCPC
1993
Springer
14 years 2 months ago
Event-based Composition of Concurrent Programs
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
Raju Pandey, James C. Browne