Sciweavers

4352 search results - page 161 / 871
» A Representation Theorem and Applications
Sort
View
199
Voted
ACSC
2004
IEEE
15 years 10 months ago
Code Improvements for Model Elimination Based Reasoning Systems
We have been investigating ways in which the performance of model elimination based systems can be improved and in this paper we present some of our results. Firstly, we have inve...
Richard A. Hagen, Scott D. Goodwin, Abdul Sattar
211
Voted
FMSD
2002
107views more  FMSD 2002»
15 years 6 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
188
Voted
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
15 years 11 months ago
Formal Derivation of Concurrent Garbage Collectors
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith
226
Voted
AISC
1998
Springer
15 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
228
Voted
ASE
2005
140views more  ASE 2005»
15 years 7 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen