Sciweavers

851 search results - page 79 / 171
» Inaccessibility in Decision Procedures
Sort
View
FOSSACS
2005
Springer
14 years 2 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz
TACAS
2004
Springer
110views Algorithms» more  TACAS 2004»
14 years 2 months ago
An Interpolating Theorem Prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
Kenneth L. McMillan
CADE
2001
Springer
14 years 1 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
14 years 1 months ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin
CHARME
1999
Springer
100views Hardware» more  CHARME 1999»
14 years 1 months ago
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
Mark Aagaard, Thomas F. Melham, John W. O'Leary