Sciweavers

5550 search results - page 9 / 1110
» Different Approaches to Proof Systems
Sort
View
LATIN
2004
Springer
15 years 5 months ago
A Proof System and a Decision Procedure for Equality Logic
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
Olga Tveretina, Hans Zantema
FMCAD
2006
Springer
15 years 3 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi
ENTCS
2008
170views more  ENTCS 2008»
14 years 11 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
CADE
2001
Springer
16 years 6 hour ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
CSMR
2008
IEEE
15 years 6 months ago
How Lisp Systems Look Different
Many reverse engineering approaches have been developed to analyze software systems written in different languages like C/C++ or Java. These approaches typically rely on a meta-mo...
Adrian Dozsa, Tudor Gîrba, Radu Marinescu