Sciweavers

1128 search results - page 8 / 226
» Little Engines of Proof
Sort
View
DAC
2007
ACM
15 years 10 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
B
1998
Springer
15 years 1 months ago
Introducing Dynamic Constraints in B
In B, the expression of dynamic constraints is notoriously missing. In this paper, we make various proposals for introducing them. They all express, in di erent complementary ways,...
Jean-Raymond Abrial, Louis Mussat
CACM
2002
69views more  CACM 2002»
14 years 9 months ago
Software engineering considered harmful
ion, reviews, rigorous procedures, regression testing, metrics, and so forth) have been helpful, but we are still dealing with an intrinsically unsatisfactory situation. Especially...
Dennis de Champeaux
ACSW
2003
14 years 10 months ago
Provably Secure Key Exchange: An Engineering Approach
We promote an engineering approach to design of provably secure key exchange protocols. Using the model of Canetti and Krawczyk we present a systematic method to arrive at efficie...
Yiu Shing Terry Tin, Colin Boyd, Juanma Gonz&aacut...
JANCL
2006
100views more  JANCL 2006»
14 years 9 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo