Sciweavers

12107 search results - page 79 / 2422
» Software That Can Think
Sort
View
BIRTHDAY
2010
Springer
13 years 8 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
ENTCS
2008
91views more  ENTCS 2008»
13 years 8 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
ECEASST
2006
95views more  ECEASST 2006»
13 years 8 months ago
Towards Translating Graph Transformation Approaches by Model Transformations
Abstract. Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars writ...
Frank Hermann, Harmen Kastenberg, Tony Modica
ENTCS
2007
91views more  ENTCS 2007»
13 years 8 months ago
Dynamic Reverse Code Generation for Backward Execution
The need for backward execution in debuggers has been raised a number of times. Backward execution helps a user naturally think backwards and, in turn, easily locate the cause of ...
Jooyong Lee
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 8 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones