Sciweavers

234 search results - page 23 / 47
» Deduction, Strategies, and Rewriting
Sort
View
ENTCS
2007
101views more  ENTCS 2007»
13 years 7 months ago
From Functional Programs to Interaction Nets via the Rewriting Calculus
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
Horatiu Cirstea, Germain Faure, Maribel Fern&aacut...
JAR
2008
98views more  JAR 2008»
13 years 7 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
FMCAD
2004
Springer
14 years 1 months ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore
FUIN
2008
88views more  FUIN 2008»
13 years 7 months ago
Validating Behavioral Component Interfaces in Rewriting Logic
Many distributed applications can be understood in terms of components interacting in an open environment such as the Internet. Open environments are subject to change in unpredic...
Einar Broch Johnsen, Olaf Owe, Arild B. Torjusen
MFCS
1997
Springer
13 years 11 months ago
When are Two Rewrite Systems More than None?
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
Nachum Dershowitz