844 search results - page 84 / 169 » Safraless Decision Procedures |
CADE
2001
Springer
14 years 1 months ago
2001
Springer
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...
DATE
2000
IEEE
14 years 1 months ago
2000
IEEE
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...
CHARME
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
MFCS
1999
Springer
14 years 1 months ago
1999
Springer
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
FOCS
1989
IEEE
14 years 26 days ago
1989
IEEE
We introduce a temporal logic for the speci cation of real-time systems. Our logic, TPTL, employs a novel quanti er construct for referencing time: the freeze quanti er binds a var...