Sciweavers

1026 search results - page 23 / 206
» A Methodology for Equational Reasoning
Sort
View
133
Voted
JSC
2000
117views more  JSC 2000»
15 years 1 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...
IANDC
2008
105views more  IANDC 2008»
15 years 1 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
IPPS
1998
IEEE
15 years 6 months ago
Experiments with Program Parallelization Using Archetypes and Stepwise Refinement
Parallel programming continues to be difficult and error-prone, whether starting from specifications or from an existing sequential program. This paper presents (1) a methodology f...
Berna L. Massingill
220
Voted
POPL
2006
ACM
16 years 2 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
109
Voted
APAL
2010
97views more  APAL 2010»
15 years 2 months ago
A modal logic framework for reasoning about comparative distances and topology
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...