88 search results - page 9 / 18 » Nominal Reasoning Techniques in Coq: (Extended Abstract) |
AGP
1997
IEEE
14 years 19 days ago
1997
IEEE
We present the rational construction of a generic domain for structural analysis anguages: Pattern(D ), where the parameter D is an abstract domain satisfying certain properties. ...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
FCSC
2010
13 years 5 months ago
2010
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...