Sciweavers

47 search results - page 9 / 10
» cade 2006
Sort
View
CADE
2006
Springer
14 years 8 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
CADE
2006
Springer
14 years 8 months ago
Inferring Network Invariants Automatically
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...
Olga Grinchtein, Martin Leucker, Nir Piterman
CADE
2006
Springer
14 years 8 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
CADE
2006
Springer
14 years 8 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
CADE
2006
Springer
14 years 8 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...