Sciweavers

446 search results - page 18 / 90
» A Theorem Prover for a Computational Logic
Sort
View
CADE
2007
Springer
15 years 10 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
102
Voted
FMCAD
2008
Springer
14 years 11 months ago
Mechanized Information Flow Analysis through Inductive Assertions
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
Warren A. Hunt Jr., Robert Bellarmine Krug, Sandip...
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
15 years 1 months ago
Accounting for Various Register Allocation Schemes During Post-Synthesis Verification of RTL Designs
This paper reports a formal methodology for verifying a broad class of synthesized register-transfer-level (RTL) designs by accommodating various register allocation/optimization ...
Nazanin Mansouri, Ranga Vemuri
77
Voted
WADT
1998
Springer
15 years 1 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
CADE
2001
Springer
15 years 10 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...