Sciweavers

23201 search results - page 119 / 4641
» Rewriting Systems with Data
Sort
View
ENTCS
2006
114views more  ENTCS 2006»
15 years 5 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
ENTCS
2006
135views more  ENTCS 2006»
15 years 5 months ago
Formal Semantics and Analysis of Component Connectors in Reo
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...
Mohammad Reza Mousavi, Marjan Sirjani, Farhad Arba...
143
Voted
ENTCS
2007
111views more  ENTCS 2007»
15 years 5 months ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...
TPLP
2010
102views more  TPLP 2010»
15 years 3 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
BIRTHDAY
2010
Springer
15 years 3 months ago
Termination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...