Sciweavers

SP
2002
IEEE
161views Security Privacy» more  SP 2002»
13 years 4 months ago
Improving Computer Security Using Extended Static Checking
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
Brian Chess
IJCAI
1997
13 years 5 months ago
High Performance ATP Systems by Combining Several AI Methods
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
Jörg Denzinger, Marc Fuchs, Matthias Fuchs
KBSE
1997
IEEE
13 years 8 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
DATE
2010
IEEE
168views Hardware» more  DATE 2010»
13 years 8 months ago
Formal verification of analog circuits in the presence of noise and process variation
We model and verify analog designs in the presence of noise and process variation using an automated theorem prover, MetiTarski. Due to the statistical nature of noise, we propose ...
Rajeev Narayanan, Behzad Akbarpour, Mohamed H. Zak...
LPAR
2007
Springer
13 years 10 months ago
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
Richard Bonichon, David Delahaye, Damien Doligez
CADE
2007
Springer
13 years 10 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
CADE
2009
Springer
13 years 11 months ago
SPASS Version 3.5
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
Christoph Weidenbach, Dilyana Dimova, Arnaud Fietz...