Sciweavers

15 search results - page 2 / 3
» MTT: The Maude Termination Tool (System Description)
Sort
View
FROCOS
2007
Springer
13 years 10 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
TELSYS
1998
154views more  TELSYS 1998»
13 years 4 months ago
The Multimedia Internet Terminal (MInT)
The Multimedia Internet Terminal (MINT)1 is a flexible multimedia tool set that allows the establishment and control of multimedia sessions across the Internet. The system archit...
Dorgham Sisalem, Henning Schulzrinne
RTA
2011
Springer
12 years 7 months ago
Maximal Completion
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 1 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
HYBRID
2001
Springer
13 years 9 months ago
Accurate Event Detection for Simulating Hybrid Systems
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
Joel M. Esposito, Vijay Kumar, George J. Pappas