Sciweavers

407 search results - page 57 / 82
» Automatic Correctness Proofs for Logic Program Transformatio...
Sort
View
DFG
2004
Springer
13 years 11 months ago
Verification of PLC Programs Given as Sequential Function Charts
Programmable Logic Controllers (PLC) are widespread in the manufacturing and processing industries to realize sequential procedures and to avoid safety-critical states. For the spe...
Nanette Bauer, Sebastian Engell, Ralf Huuck, Sven ...
TOOLS
2009
IEEE
14 years 2 months ago
On Realizing a Framework for Self-tuning Mappings
Realizing information exchange is a frequently recurring challenge in nearly every domain of computer science. Although languages, formalisms, and storage formats may differ in va...
Manuel Wimmer, Martina Seidl, Petra Brosch, Horst ...
POPL
2008
ACM
14 years 8 months ago
From dirt to shovels: fully automatic tool generation from ad hoc data
An ad hoc data source is any semistructured data source for which useful data analysis and transformation tools are not readily available. Such data must be queried, transformed a...
Kathleen Fisher, David Walker, Kenny Qili Zhu, Pet...
RTA
2007
Springer
14 years 1 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur