Sciweavers

584 search results - page 12 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
14 years 9 months ago
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
Emanuel Kitzelmann, Ute Schmid
171
Voted
POPL
2005
ACM
15 years 10 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
RTA
2010
Springer
15 years 1 months ago
A Rewriting Logic Semantics Approach to Modular Program Analysis
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on deļ...
Mark Hills, Grigore Rosu
ICTAC
2005
Springer
15 years 3 months ago
A Rewriting Logic Sampler
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
José Meseguer
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund