Sciweavers

67 search results - page 6 / 14
» A Verification Technique Using Term Rewriting Systems and Ab...
Sort
View
RTA
2009
Springer
14 years 1 months ago
VMTL-A Modular Termination Laboratory
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
Felix Schernhammer, Bernhard Gramlich
SIGSOFT
2007
ACM
14 years 7 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
ACSD
2010
IEEE
251views Hardware» more  ACSD 2010»
13 years 4 months ago
Modular Interpretation of Heterogeneous Modeling Diagrams into Synchronous Equations Using Static Single Assignment
Abstract--The ANR project SPaCIFY develops a domainspecific programming environment, Synoptic, to engineer embedded software for space applications. Synoptic is an Eclipse-based mo...
Jean-Pierre Talpin, Julien Ouy, Thierry Gautier, L...
PEPM
2010
ACM
13 years 8 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
SAIG
2000
Springer
13 years 10 months ago
Compiling Embedded Languages
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
Conal Elliott, Sigbjorn Finne, Oege de Moor