200 search results - page 5 / 40 » Invariant Logics |
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
TPHOL
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
ACL2
2006
ACM
14 years 12 days ago
2006
ACM
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
JSC
2010
13 years 3 months ago
2010
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...